/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:22:56,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:22:56,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:22:56,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:22:56,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:22:56,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:22:56,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:22:56,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:22:56,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:22:56,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:22:56,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:22:56,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:22:56,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:22:56,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:22:56,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:22:56,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:22:56,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:22:56,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:22:56,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:22:56,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:22:56,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:22:56,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:22:56,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:22:56,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:22:56,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:22:56,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:22:56,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:22:56,616 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:22:56,617 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:22:56,618 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:22:56,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:22:56,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:22:56,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:22:56,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:22:56,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:22:56,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:22:56,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:22:56,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:22:56,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:22:56,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:22:56,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:22:56,628 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 01:22:56,667 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:22:56,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:22:56,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:22:56,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:22:56,670 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:22:56,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:22:56,671 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:22:56,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:22:56,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:22:56,671 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:22:56,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:22:56,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:22:56,673 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:22:56,673 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:22:56,673 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:22:56,674 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:22:56,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:22:56,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:22:56,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:22:56,675 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:22:56,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:22:56,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:22:56,676 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:22:56,676 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:22:56,676 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:22:56,677 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:22:56,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:22:56,677 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:22:56,677 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:22:56,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:22:56,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:22:56,996 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:22:56,997 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:22:56,998 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:22:56,998 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.oepc.i [2020-10-16 01:22:57,071 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bda8581e/21aa2a5435034bd18bd4546b00245277/FLAG7d0d7caab [2020-10-16 01:22:57,702 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:22:57,703 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_tso.oepc.i [2020-10-16 01:22:57,721 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bda8581e/21aa2a5435034bd18bd4546b00245277/FLAG7d0d7caab [2020-10-16 01:22:57,950 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bda8581e/21aa2a5435034bd18bd4546b00245277 [2020-10-16 01:22:57,962 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:22:57,964 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:22:57,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:22:57,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:22:57,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:22:57,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:22:57" (1/1) ... [2020-10-16 01:22:57,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d743a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:57, skipping insertion in model container [2020-10-16 01:22:57,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:22:57" (1/1) ... [2020-10-16 01:22:57,981 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:22:58,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:22:58,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:22:58,618 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:22:58,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:22:58,767 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:22:58,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:58 WrapperNode [2020-10-16 01:22:58,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:22:58,769 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:22:58,769 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:22:58,769 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:22:58,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:58" (1/1) ... [2020-10-16 01:22:58,800 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:58" (1/1) ... [2020-10-16 01:22:58,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:22:58,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:22:58,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:22:58,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:22:58,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:58" (1/1) ... [2020-10-16 01:22:58,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:58" (1/1) ... [2020-10-16 01:22:58,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:58" (1/1) ... [2020-10-16 01:22:58,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:58" (1/1) ... [2020-10-16 01:22:58,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:58" (1/1) ... [2020-10-16 01:22:58,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:58" (1/1) ... [2020-10-16 01:22:58,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:58" (1/1) ... [2020-10-16 01:22:58,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:22:58,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:22:58,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:22:58,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:22:58,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:22:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:22:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:22:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:22:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:22:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:22:58,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:22:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:22:58,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:22:58,969 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:22:58,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:22:58,969 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 01:22:58,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 01:22:58,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:22:58,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:22:58,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:22:58,972 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:23:01,593 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:23:01,593 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:23:01,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:23:01 BoogieIcfgContainer [2020-10-16 01:23:01,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:23:01,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:23:01,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:23:01,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:23:01,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:22:57" (1/3) ... [2020-10-16 01:23:01,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6016aba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:23:01, skipping insertion in model container [2020-10-16 01:23:01,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:58" (2/3) ... [2020-10-16 01:23:01,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6016aba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:23:01, skipping insertion in model container [2020-10-16 01:23:01,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:23:01" (3/3) ... [2020-10-16 01:23:01,612 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_tso.oepc.i [2020-10-16 01:23:01,627 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:23:01,637 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:23:01,638 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:23:01,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,691 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,691 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,694 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,694 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,695 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,696 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,699 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,699 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,700 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,700 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,705 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,705 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,707 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,707 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,707 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,707 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,707 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,710 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,710 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,711 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,711 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,712 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,712 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,712 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,712 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,713 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,718 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,718 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,718 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,718 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,719 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,719 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,719 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,720 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,720 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,726 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,727 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,730 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,732 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,736 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,737 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,743 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,750 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,750 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,753 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,753 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,756 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,756 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:23:01,774 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 01:23:01,797 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:23:01,798 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:23:01,798 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:23:01,798 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:23:01,798 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:23:01,798 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:23:01,798 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:23:01,799 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:23:01,823 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 120 places, 109 transitions, 238 flow [2020-10-16 01:23:01,899 INFO L129 PetriNetUnfolder]: 2/105 cut-off events. [2020-10-16 01:23:01,900 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:23:01,909 INFO L80 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-10-16 01:23:01,910 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 109 transitions, 238 flow [2020-10-16 01:23:01,922 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 105 transitions, 222 flow [2020-10-16 01:23:01,925 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:23:01,929 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 105 transitions, 222 flow [2020-10-16 01:23:01,932 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 105 transitions, 222 flow [2020-10-16 01:23:01,932 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 116 places, 105 transitions, 222 flow [2020-10-16 01:23:01,979 INFO L129 PetriNetUnfolder]: 2/105 cut-off events. [2020-10-16 01:23:01,980 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:23:01,982 INFO L80 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-10-16 01:23:01,987 INFO L117 LiptonReduction]: Number of co-enabled transitions 2446 [2020-10-16 01:23:02,414 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 01:23:02,771 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:23:02,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:23:02,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:02,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:23:02,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:03,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:23:03,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:03,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:23:03,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:04,183 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-16 01:23:04,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-16 01:23:04,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:04,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:23:04,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:05,117 WARN L193 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-10-16 01:23:05,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:05,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:05,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:23:05,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:23:05,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:05,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:23:05,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:23:05,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:23:05,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:23:05,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:05,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:05,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:05,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:05,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:05,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:05,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:23:05,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:23:05,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:05,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:23:05,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:05,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:05,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:05,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:05,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:05,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:23:05,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:05,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:23:05,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:05,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:05,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:05,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:05,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:05,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:23:05,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:05,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:05,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:05,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:05,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:05,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:05,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:05,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:23:05,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:05,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:05,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:05,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:05,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:05,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:05,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:05,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:23:05,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:05,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:05,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:05,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:05,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:05,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:05,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:05,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:23:05,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:05,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:05,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:05,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:05,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:05,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:05,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:05,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:23:05,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:05,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:23:05,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:06,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:06,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:23:06,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:23:06,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:06,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:23:06,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:06,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:23:06,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:23:06,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:06,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:23:06,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:23:06,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:23:06,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:23:06,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:06,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:06,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:06,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:06,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:06,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:06,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:06,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:23:06,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:23:06,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:06,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:23:06,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:23:06,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:23:06,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:23:06,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:06,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:06,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:06,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:06,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:06,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:06,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:23:06,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:23:06,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:06,757 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 01:23:06,885 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 01:23:07,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:07,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:23:07,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:23:07,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:07,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:07,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:07,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:23:07,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:23:07,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:07,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:23:07,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:23:07,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:23:07,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:23:07,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:07,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:07,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:07,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:07,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:08,016 WARN L193 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 110 [2020-10-16 01:23:08,325 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 01:23:08,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:23:08,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:08,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:08,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:08,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:23:08,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:08,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:08,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:08,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:08,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:23:08,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:08,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:08,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:08,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:08,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:23:08,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:08,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:08,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:08,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:08,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:23:08,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:08,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:08,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:08,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:08,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:23:08,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:08,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:08,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:08,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:08,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:23:08,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:08,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:08,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:23:08,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:23:08,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:08,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:23:08,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:23:08,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:23:08,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:23:08,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:08,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:08,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:08,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:08,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:08,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:23:08,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:23:08,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:23:08,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:08,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:08,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:08,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:08,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:23:08,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:23:08,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:23:08,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:08,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:23:08,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:23:08,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:08,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:23:08,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:23:09,647 WARN L193 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2020-10-16 01:23:09,978 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 01:23:11,238 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 137 DAG size of output: 136 [2020-10-16 01:23:11,905 WARN L193 SmtUtils]: Spent 664.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-16 01:23:12,157 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-16 01:23:12,286 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-16 01:23:12,395 INFO L132 LiptonReduction]: Checked pairs total: 6967 [2020-10-16 01:23:12,395 INFO L134 LiptonReduction]: Total number of compositions: 92 [2020-10-16 01:23:12,399 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10476 [2020-10-16 01:23:12,411 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2020-10-16 01:23:12,411 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:23:12,411 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:23:12,412 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:23:12,413 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:23:12,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:23:12,419 INFO L82 PathProgramCache]: Analyzing trace with hash -137982902, now seen corresponding path program 1 times [2020-10-16 01:23:12,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:23:12,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987027692] [2020-10-16 01:23:12,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:23:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:23:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:23:12,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987027692] [2020-10-16 01:23:12,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:23:12,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:23:12,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793233453] [2020-10-16 01:23:12,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:23:12,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:23:12,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:23:12,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:23:12,703 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 201 [2020-10-16 01:23:12,705 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states. [2020-10-16 01:23:12,705 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:23:12,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 201 [2020-10-16 01:23:12,707 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:23:12,818 INFO L129 PetriNetUnfolder]: 33/99 cut-off events. [2020-10-16 01:23:12,818 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:23:12,819 INFO L80 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 99 events. 33/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 369 event pairs, 3 based on Foata normal form. 8/99 useless extension candidates. Maximal degree in co-relation 167. Up to 55 conditions per place. [2020-10-16 01:23:12,821 INFO L132 encePairwiseOnDemand]: 197/201 looper letters, 8 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2020-10-16 01:23:12,821 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 98 flow [2020-10-16 01:23:12,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:23:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:23:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2020-10-16 01:23:12,841 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8557213930348259 [2020-10-16 01:23:12,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 516 transitions. [2020-10-16 01:23:12,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 516 transitions. [2020-10-16 01:23:12,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:23:12,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 516 transitions. [2020-10-16 01:23:12,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:23:12,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:23:12,860 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:23:12,863 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 516 transitions. [2020-10-16 01:23:12,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 98 flow [2020-10-16 01:23:12,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 94 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 01:23:12,869 INFO L241 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2020-10-16 01:23:12,872 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2020-10-16 01:23:12,873 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2020-10-16 01:23:12,874 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2020-10-16 01:23:12,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:23:12,874 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:23:12,874 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:23:12,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:23:12,874 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:23:12,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:23:12,875 INFO L82 PathProgramCache]: Analyzing trace with hash 542442462, now seen corresponding path program 1 times [2020-10-16 01:23:12,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:23:12,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190893200] [2020-10-16 01:23:12,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:23:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:23:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:23:13,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190893200] [2020-10-16 01:23:13,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:23:13,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:23:13,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930785813] [2020-10-16 01:23:13,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:23:13,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:23:13,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:23:13,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:23:13,031 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 201 [2020-10-16 01:23:13,032 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states. [2020-10-16 01:23:13,032 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:23:13,032 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 201 [2020-10-16 01:23:13,032 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:23:13,161 INFO L129 PetriNetUnfolder]: 112/232 cut-off events. [2020-10-16 01:23:13,161 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-16 01:23:13,163 INFO L80 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 232 events. 112/232 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1022 event pairs, 47 based on Foata normal form. 1/229 useless extension candidates. Maximal degree in co-relation 435. Up to 182 conditions per place. [2020-10-16 01:23:13,166 INFO L132 encePairwiseOnDemand]: 196/201 looper letters, 9 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2020-10-16 01:23:13,166 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 100 flow [2020-10-16 01:23:13,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:23:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:23:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2020-10-16 01:23:13,170 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7893864013266998 [2020-10-16 01:23:13,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 476 transitions. [2020-10-16 01:23:13,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 476 transitions. [2020-10-16 01:23:13,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:23:13,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 476 transitions. [2020-10-16 01:23:13,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:23:13,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:23:13,177 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:23:13,177 INFO L185 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 476 transitions. [2020-10-16 01:23:13,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 100 flow [2020-10-16 01:23:13,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:23:13,179 INFO L241 Difference]: Finished difference. Result has 38 places, 29 transitions, 86 flow [2020-10-16 01:23:13,179 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2020-10-16 01:23:13,180 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2020-10-16 01:23:13,180 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 86 flow [2020-10-16 01:23:13,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:23:13,180 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:23:13,181 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:23:13,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:23:13,181 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:23:13,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:23:13,181 INFO L82 PathProgramCache]: Analyzing trace with hash -364152957, now seen corresponding path program 1 times [2020-10-16 01:23:13,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:23:13,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799979553] [2020-10-16 01:23:13,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:23:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:23:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:23:13,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799979553] [2020-10-16 01:23:13,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:23:13,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:23:13,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405258836] [2020-10-16 01:23:13,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:23:13,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:23:13,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:23:13,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:23:13,315 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 201 [2020-10-16 01:23:13,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 86 flow. Second operand 3 states. [2020-10-16 01:23:13,316 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:23:13,316 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 201 [2020-10-16 01:23:13,316 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:23:13,484 INFO L129 PetriNetUnfolder]: 353/661 cut-off events. [2020-10-16 01:23:13,485 INFO L130 PetriNetUnfolder]: For 93/99 co-relation queries the response was YES. [2020-10-16 01:23:13,488 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1355 conditions, 661 events. 353/661 cut-off events. For 93/99 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3639 event pairs, 207 based on Foata normal form. 2/634 useless extension candidates. Maximal degree in co-relation 1345. Up to 475 conditions per place. [2020-10-16 01:23:13,494 INFO L132 encePairwiseOnDemand]: 196/201 looper letters, 11 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2020-10-16 01:23:13,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 135 flow [2020-10-16 01:23:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:23:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:23:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2020-10-16 01:23:13,497 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7910447761194029 [2020-10-16 01:23:13,497 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2020-10-16 01:23:13,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2020-10-16 01:23:13,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:23:13,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2020-10-16 01:23:13,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:23:13,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:23:13,501 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:23:13,501 INFO L185 Difference]: Start difference. First operand has 38 places, 29 transitions, 86 flow. Second operand 3 states and 477 transitions. [2020-10-16 01:23:13,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 135 flow [2020-10-16 01:23:13,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:23:13,503 INFO L241 Difference]: Finished difference. Result has 40 places, 33 transitions, 119 flow [2020-10-16 01:23:13,503 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2020-10-16 01:23:13,504 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2020-10-16 01:23:13,504 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 119 flow [2020-10-16 01:23:13,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:23:13,504 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:23:13,504 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:23:13,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:23:13,504 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:23:13,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:23:13,505 INFO L82 PathProgramCache]: Analyzing trace with hash -363745214, now seen corresponding path program 1 times [2020-10-16 01:23:13,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:23:13,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924583841] [2020-10-16 01:23:13,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:23:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:23:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:23:13,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924583841] [2020-10-16 01:23:13,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:23:13,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:23:13,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28094865] [2020-10-16 01:23:13,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:23:13,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:23:13,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:23:13,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:23:13,587 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 201 [2020-10-16 01:23:13,588 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 119 flow. Second operand 4 states. [2020-10-16 01:23:13,588 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:23:13,588 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 201 [2020-10-16 01:23:13,588 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:23:13,843 INFO L129 PetriNetUnfolder]: 345/635 cut-off events. [2020-10-16 01:23:13,843 INFO L130 PetriNetUnfolder]: For 330/362 co-relation queries the response was YES. [2020-10-16 01:23:13,847 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1540 conditions, 635 events. 345/635 cut-off events. For 330/362 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3394 event pairs, 187 based on Foata normal form. 15/629 useless extension candidates. Maximal degree in co-relation 1528. Up to 426 conditions per place. [2020-10-16 01:23:13,852 INFO L132 encePairwiseOnDemand]: 196/201 looper letters, 15 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2020-10-16 01:23:13,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 183 flow [2020-10-16 01:23:13,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:23:13,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:23:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 637 transitions. [2020-10-16 01:23:13,855 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7922885572139303 [2020-10-16 01:23:13,856 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 637 transitions. [2020-10-16 01:23:13,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 637 transitions. [2020-10-16 01:23:13,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:23:13,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 637 transitions. [2020-10-16 01:23:13,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:23:13,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:23:13,859 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:23:13,860 INFO L185 Difference]: Start difference. First operand has 40 places, 33 transitions, 119 flow. Second operand 4 states and 637 transitions. [2020-10-16 01:23:13,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 183 flow [2020-10-16 01:23:13,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 178 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:23:13,863 INFO L241 Difference]: Finished difference. Result has 43 places, 35 transitions, 146 flow [2020-10-16 01:23:13,863 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2020-10-16 01:23:13,863 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2020-10-16 01:23:13,863 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 146 flow [2020-10-16 01:23:13,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:23:13,864 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:23:13,864 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:23:13,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:23:13,864 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:23:13,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:23:13,865 INFO L82 PathProgramCache]: Analyzing trace with hash -451038647, now seen corresponding path program 1 times [2020-10-16 01:23:13,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:23:13,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582667246] [2020-10-16 01:23:13,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:23:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:23:13,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:23:13,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582667246] [2020-10-16 01:23:13,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:23:13,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:23:13,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788764219] [2020-10-16 01:23:13,921 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:23:13,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:23:13,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:23:13,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:23:13,923 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 201 [2020-10-16 01:23:13,923 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 146 flow. Second operand 3 states. [2020-10-16 01:23:13,924 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:23:13,924 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 201 [2020-10-16 01:23:13,924 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:23:14,076 INFO L129 PetriNetUnfolder]: 215/439 cut-off events. [2020-10-16 01:23:14,076 INFO L130 PetriNetUnfolder]: For 427/482 co-relation queries the response was YES. [2020-10-16 01:23:14,079 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 439 events. 215/439 cut-off events. For 427/482 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2363 event pairs, 69 based on Foata normal form. 5/406 useless extension candidates. Maximal degree in co-relation 1123. Up to 269 conditions per place. [2020-10-16 01:23:14,084 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 7 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2020-10-16 01:23:14,085 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 174 flow [2020-10-16 01:23:14,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:23:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:23:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2020-10-16 01:23:14,090 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7976782752902156 [2020-10-16 01:23:14,090 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 481 transitions. [2020-10-16 01:23:14,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 481 transitions. [2020-10-16 01:23:14,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:23:14,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 481 transitions. [2020-10-16 01:23:14,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:23:14,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:23:14,095 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:23:14,095 INFO L185 Difference]: Start difference. First operand has 43 places, 35 transitions, 146 flow. Second operand 3 states and 481 transitions. [2020-10-16 01:23:14,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 174 flow [2020-10-16 01:23:14,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 160 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 01:23:14,104 INFO L241 Difference]: Finished difference. Result has 44 places, 35 transitions, 149 flow [2020-10-16 01:23:14,104 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2020-10-16 01:23:14,104 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2020-10-16 01:23:14,104 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 149 flow [2020-10-16 01:23:14,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:23:14,105 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:23:14,105 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:23:14,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:23:14,105 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:23:14,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:23:14,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1594357569, now seen corresponding path program 1 times [2020-10-16 01:23:14,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:23:14,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216952583] [2020-10-16 01:23:14,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:23:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:23:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:23:14,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216952583] [2020-10-16 01:23:14,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:23:14,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:23:14,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267274302] [2020-10-16 01:23:14,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:23:14,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:23:14,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:23:14,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:23:14,214 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 201 [2020-10-16 01:23:14,214 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 149 flow. Second operand 3 states. [2020-10-16 01:23:14,214 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:23:14,215 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 201 [2020-10-16 01:23:14,215 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:23:14,253 INFO L129 PetriNetUnfolder]: 34/131 cut-off events. [2020-10-16 01:23:14,253 INFO L130 PetriNetUnfolder]: For 253/303 co-relation queries the response was YES. [2020-10-16 01:23:14,254 INFO L80 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 131 events. 34/131 cut-off events. For 253/303 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 580 event pairs, 8 based on Foata normal form. 10/130 useless extension candidates. Maximal degree in co-relation 297. Up to 47 conditions per place. [2020-10-16 01:23:14,255 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 1 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2020-10-16 01:23:14,255 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 155 flow [2020-10-16 01:23:14,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:23:14,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:23:14,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2020-10-16 01:23:14,258 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8822553897180763 [2020-10-16 01:23:14,258 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 532 transitions. [2020-10-16 01:23:14,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 532 transitions. [2020-10-16 01:23:14,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:23:14,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 532 transitions. [2020-10-16 01:23:14,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:23:14,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:23:14,262 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:23:14,262 INFO L185 Difference]: Start difference. First operand has 44 places, 35 transitions, 149 flow. Second operand 3 states and 532 transitions. [2020-10-16 01:23:14,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 155 flow [2020-10-16 01:23:14,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 145 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:23:14,266 INFO L241 Difference]: Finished difference. Result has 45 places, 35 transitions, 147 flow [2020-10-16 01:23:14,266 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2020-10-16 01:23:14,266 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2020-10-16 01:23:14,267 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 147 flow [2020-10-16 01:23:14,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:23:14,267 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:23:14,267 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:23:14,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:23:14,267 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:23:14,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:23:14,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1841916541, now seen corresponding path program 1 times [2020-10-16 01:23:14,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:23:14,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659505626] [2020-10-16 01:23:14,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:23:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:23:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:23:14,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659505626] [2020-10-16 01:23:14,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:23:14,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:23:14,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007702957] [2020-10-16 01:23:14,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:23:14,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:23:14,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:23:14,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:23:14,355 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 201 [2020-10-16 01:23:14,356 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 147 flow. Second operand 3 states. [2020-10-16 01:23:14,356 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:23:14,356 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 201 [2020-10-16 01:23:14,356 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:23:14,394 INFO L129 PetriNetUnfolder]: 28/122 cut-off events. [2020-10-16 01:23:14,395 INFO L130 PetriNetUnfolder]: For 191/209 co-relation queries the response was YES. [2020-10-16 01:23:14,395 INFO L80 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 122 events. 28/122 cut-off events. For 191/209 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 537 event pairs, 7 based on Foata normal form. 4/116 useless extension candidates. Maximal degree in co-relation 288. Up to 40 conditions per place. [2020-10-16 01:23:14,396 INFO L132 encePairwiseOnDemand]: 197/201 looper letters, 3 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2020-10-16 01:23:14,397 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 37 transitions, 171 flow [2020-10-16 01:23:14,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:23:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:23:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2020-10-16 01:23:14,401 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8772802653399668 [2020-10-16 01:23:14,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 529 transitions. [2020-10-16 01:23:14,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 529 transitions. [2020-10-16 01:23:14,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:23:14,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 529 transitions. [2020-10-16 01:23:14,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:23:14,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:23:14,404 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:23:14,405 INFO L185 Difference]: Start difference. First operand has 45 places, 35 transitions, 147 flow. Second operand 3 states and 529 transitions. [2020-10-16 01:23:14,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 37 transitions, 171 flow [2020-10-16 01:23:14,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 160 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 01:23:14,410 INFO L241 Difference]: Finished difference. Result has 45 places, 37 transitions, 165 flow [2020-10-16 01:23:14,410 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2020-10-16 01:23:14,410 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2020-10-16 01:23:14,410 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 165 flow [2020-10-16 01:23:14,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:23:14,412 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:23:14,412 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:23:14,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:23:14,413 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:23:14,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:23:14,413 INFO L82 PathProgramCache]: Analyzing trace with hash 586188265, now seen corresponding path program 1 times [2020-10-16 01:23:14,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:23:14,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507492629] [2020-10-16 01:23:14,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:23:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:23:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:23:14,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507492629] [2020-10-16 01:23:14,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:23:14,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:23:14,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565926910] [2020-10-16 01:23:14,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:23:14,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:23:14,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:23:14,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:23:14,501 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 201 [2020-10-16 01:23:14,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 165 flow. Second operand 3 states. [2020-10-16 01:23:14,502 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:23:14,502 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 201 [2020-10-16 01:23:14,502 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:23:14,533 INFO L129 PetriNetUnfolder]: 22/120 cut-off events. [2020-10-16 01:23:14,533 INFO L130 PetriNetUnfolder]: For 197/223 co-relation queries the response was YES. [2020-10-16 01:23:14,534 INFO L80 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 120 events. 22/120 cut-off events. For 197/223 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 598 event pairs, 7 based on Foata normal form. 8/120 useless extension candidates. Maximal degree in co-relation 280. Up to 38 conditions per place. [2020-10-16 01:23:14,535 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 4 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2020-10-16 01:23:14,535 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 37 transitions, 181 flow [2020-10-16 01:23:14,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:23:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:23:14,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2020-10-16 01:23:14,539 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8756218905472637 [2020-10-16 01:23:14,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2020-10-16 01:23:14,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2020-10-16 01:23:14,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:23:14,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2020-10-16 01:23:14,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:23:14,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:23:14,542 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:23:14,543 INFO L185 Difference]: Start difference. First operand has 45 places, 37 transitions, 165 flow. Second operand 3 states and 528 transitions. [2020-10-16 01:23:14,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 37 transitions, 181 flow [2020-10-16 01:23:14,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:23:14,545 INFO L241 Difference]: Finished difference. Result has 47 places, 37 transitions, 174 flow [2020-10-16 01:23:14,545 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2020-10-16 01:23:14,545 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2020-10-16 01:23:14,546 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 174 flow [2020-10-16 01:23:14,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:23:14,546 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:23:14,546 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:23:14,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:23:14,546 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:23:14,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:23:14,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1904991324, now seen corresponding path program 1 times [2020-10-16 01:23:14,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:23:14,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459571668] [2020-10-16 01:23:14,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:23:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:23:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:23:14,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459571668] [2020-10-16 01:23:14,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:23:14,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:23:14,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445376746] [2020-10-16 01:23:14,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:23:14,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:23:14,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:23:14,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:23:14,633 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 201 [2020-10-16 01:23:14,634 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 174 flow. Second operand 4 states. [2020-10-16 01:23:14,634 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:23:14,634 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 201 [2020-10-16 01:23:14,634 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:23:14,766 INFO L129 PetriNetUnfolder]: 350/713 cut-off events. [2020-10-16 01:23:14,767 INFO L130 PetriNetUnfolder]: For 780/959 co-relation queries the response was YES. [2020-10-16 01:23:14,771 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1678 conditions, 713 events. 350/713 cut-off events. For 780/959 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 4517 event pairs, 64 based on Foata normal form. 63/678 useless extension candidates. Maximal degree in co-relation 1661. Up to 334 conditions per place. [2020-10-16 01:23:14,775 INFO L132 encePairwiseOnDemand]: 194/201 looper letters, 10 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2020-10-16 01:23:14,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 224 flow [2020-10-16 01:23:14,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:23:14,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:23:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 666 transitions. [2020-10-16 01:23:14,779 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8283582089552238 [2020-10-16 01:23:14,779 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 666 transitions. [2020-10-16 01:23:14,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 666 transitions. [2020-10-16 01:23:14,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:23:14,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 666 transitions. [2020-10-16 01:23:14,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:23:14,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:23:14,783 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:23:14,783 INFO L185 Difference]: Start difference. First operand has 47 places, 37 transitions, 174 flow. Second operand 4 states and 666 transitions. [2020-10-16 01:23:14,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 224 flow [2020-10-16 01:23:14,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 218 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 01:23:14,786 INFO L241 Difference]: Finished difference. Result has 51 places, 42 transitions, 214 flow [2020-10-16 01:23:14,786 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2020-10-16 01:23:14,786 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2020-10-16 01:23:14,787 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 214 flow [2020-10-16 01:23:14,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:23:14,787 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:23:14,787 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:23:14,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:23:14,787 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:23:14,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:23:14,788 INFO L82 PathProgramCache]: Analyzing trace with hash 579585481, now seen corresponding path program 1 times [2020-10-16 01:23:14,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:23:14,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562315807] [2020-10-16 01:23:14,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:23:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:23:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:23:14,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562315807] [2020-10-16 01:23:14,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:23:14,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:23:14,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488534239] [2020-10-16 01:23:14,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:23:14,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:23:14,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:23:14,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:23:14,836 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 201 [2020-10-16 01:23:14,836 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 214 flow. Second operand 3 states. [2020-10-16 01:23:14,836 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:23:14,836 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 201 [2020-10-16 01:23:14,836 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:23:14,962 INFO L129 PetriNetUnfolder]: 461/919 cut-off events. [2020-10-16 01:23:14,962 INFO L130 PetriNetUnfolder]: For 1483/1870 co-relation queries the response was YES. [2020-10-16 01:23:15,023 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2231 conditions, 919 events. 461/919 cut-off events. For 1483/1870 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 6133 event pairs, 216 based on Foata normal form. 34/805 useless extension candidates. Maximal degree in co-relation 2211. Up to 758 conditions per place. [2020-10-16 01:23:15,026 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 4 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2020-10-16 01:23:15,027 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 230 flow [2020-10-16 01:23:15,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:23:15,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:23:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2020-10-16 01:23:15,030 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8756218905472637 [2020-10-16 01:23:15,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2020-10-16 01:23:15,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2020-10-16 01:23:15,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:23:15,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2020-10-16 01:23:15,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:23:15,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:23:15,033 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:23:15,033 INFO L185 Difference]: Start difference. First operand has 51 places, 42 transitions, 214 flow. Second operand 3 states and 528 transitions. [2020-10-16 01:23:15,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 230 flow [2020-10-16 01:23:15,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 42 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:23:15,036 INFO L241 Difference]: Finished difference. Result has 53 places, 42 transitions, 226 flow [2020-10-16 01:23:15,037 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2020-10-16 01:23:15,037 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2020-10-16 01:23:15,037 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 226 flow [2020-10-16 01:23:15,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:23:15,037 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:23:15,038 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:23:15,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:23:15,038 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:23:15,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:23:15,038 INFO L82 PathProgramCache]: Analyzing trace with hash -690348747, now seen corresponding path program 1 times [2020-10-16 01:23:15,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:23:15,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234974838] [2020-10-16 01:23:15,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:23:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:23:15,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:23:15,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234974838] [2020-10-16 01:23:15,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:23:15,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:23:15,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88681726] [2020-10-16 01:23:15,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:23:15,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:23:15,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:23:15,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:23:15,137 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 201 [2020-10-16 01:23:15,137 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 226 flow. Second operand 5 states. [2020-10-16 01:23:15,138 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:23:15,138 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 201 [2020-10-16 01:23:15,138 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:23:15,344 INFO L129 PetriNetUnfolder]: 570/1124 cut-off events. [2020-10-16 01:23:15,344 INFO L130 PetriNetUnfolder]: For 1314/3315 co-relation queries the response was YES. [2020-10-16 01:23:15,350 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3559 conditions, 1124 events. 570/1124 cut-off events. For 1314/3315 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 7583 event pairs, 45 based on Foata normal form. 155/1134 useless extension candidates. Maximal degree in co-relation 3538. Up to 900 conditions per place. [2020-10-16 01:23:15,355 INFO L132 encePairwiseOnDemand]: 194/201 looper letters, 11 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2020-10-16 01:23:15,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 304 flow [2020-10-16 01:23:15,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:23:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:23:15,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 833 transitions. [2020-10-16 01:23:15,359 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8288557213930349 [2020-10-16 01:23:15,359 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 833 transitions. [2020-10-16 01:23:15,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 833 transitions. [2020-10-16 01:23:15,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:23:15,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 833 transitions. [2020-10-16 01:23:15,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:23:15,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:23:15,365 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:23:15,365 INFO L185 Difference]: Start difference. First operand has 53 places, 42 transitions, 226 flow. Second operand 5 states and 833 transitions. [2020-10-16 01:23:15,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 304 flow [2020-10-16 01:23:15,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 51 transitions, 298 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 01:23:15,369 INFO L241 Difference]: Finished difference. Result has 58 places, 47 transitions, 287 flow [2020-10-16 01:23:15,369 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=287, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2020-10-16 01:23:15,369 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2020-10-16 01:23:15,370 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 287 flow [2020-10-16 01:23:15,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:23:15,370 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:23:15,370 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:23:15,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:23:15,370 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:23:15,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:23:15,371 INFO L82 PathProgramCache]: Analyzing trace with hash -560561865, now seen corresponding path program 1 times [2020-10-16 01:23:15,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:23:15,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942304471] [2020-10-16 01:23:15,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:23:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:23:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:23:15,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942304471] [2020-10-16 01:23:15,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:23:15,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:23:15,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355691722] [2020-10-16 01:23:15,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:23:15,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:23:15,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:23:15,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:23:15,454 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 201 [2020-10-16 01:23:15,454 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 287 flow. Second operand 6 states. [2020-10-16 01:23:15,455 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:23:15,455 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 201 [2020-10-16 01:23:15,455 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:23:15,655 INFO L129 PetriNetUnfolder]: 479/988 cut-off events. [2020-10-16 01:23:15,656 INFO L130 PetriNetUnfolder]: For 2382/6161 co-relation queries the response was YES. [2020-10-16 01:23:15,662 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4270 conditions, 988 events. 479/988 cut-off events. For 2382/6161 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 6556 event pairs, 29 based on Foata normal form. 178/1024 useless extension candidates. Maximal degree in co-relation 4246. Up to 785 conditions per place. [2020-10-16 01:23:15,666 INFO L132 encePairwiseOnDemand]: 194/201 looper letters, 12 selfloop transitions, 14 changer transitions 0/56 dead transitions. [2020-10-16 01:23:15,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 56 transitions, 394 flow [2020-10-16 01:23:15,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:23:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:23:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1000 transitions. [2020-10-16 01:23:15,670 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8291873963515755 [2020-10-16 01:23:15,670 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1000 transitions. [2020-10-16 01:23:15,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1000 transitions. [2020-10-16 01:23:15,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:23:15,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1000 transitions. [2020-10-16 01:23:15,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:23:15,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:23:15,675 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:23:15,676 INFO L185 Difference]: Start difference. First operand has 58 places, 47 transitions, 287 flow. Second operand 6 states and 1000 transitions. [2020-10-16 01:23:15,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 56 transitions, 394 flow [2020-10-16 01:23:15,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 56 transitions, 378 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 01:23:15,680 INFO L241 Difference]: Finished difference. Result has 63 places, 52 transitions, 357 flow [2020-10-16 01:23:15,681 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=357, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2020-10-16 01:23:15,681 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2020-10-16 01:23:15,681 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 357 flow [2020-10-16 01:23:15,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:23:15,681 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:23:15,681 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:23:15,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:23:15,682 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:23:15,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:23:15,682 INFO L82 PathProgramCache]: Analyzing trace with hash -664143257, now seen corresponding path program 1 times [2020-10-16 01:23:15,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:23:15,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962296779] [2020-10-16 01:23:15,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:23:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:23:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:23:15,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962296779] [2020-10-16 01:23:15,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:23:15,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:23:15,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403569107] [2020-10-16 01:23:15,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:23:15,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:23:15,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:23:15,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:23:15,862 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 201 [2020-10-16 01:23:15,863 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 357 flow. Second operand 7 states. [2020-10-16 01:23:15,863 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:23:15,863 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 201 [2020-10-16 01:23:15,864 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:23:16,143 INFO L129 PetriNetUnfolder]: 453/932 cut-off events. [2020-10-16 01:23:16,143 INFO L130 PetriNetUnfolder]: For 4342/8179 co-relation queries the response was YES. [2020-10-16 01:23:16,150 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4798 conditions, 932 events. 453/932 cut-off events. For 4342/8179 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 6183 event pairs, 27 based on Foata normal form. 161/951 useless extension candidates. Maximal degree in co-relation 4772. Up to 685 conditions per place. [2020-10-16 01:23:16,154 INFO L132 encePairwiseOnDemand]: 194/201 looper letters, 5 selfloop transitions, 18 changer transitions 6/53 dead transitions. [2020-10-16 01:23:16,154 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 53 transitions, 412 flow [2020-10-16 01:23:16,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:23:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:23:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1159 transitions. [2020-10-16 01:23:16,159 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8237384506041222 [2020-10-16 01:23:16,159 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1159 transitions. [2020-10-16 01:23:16,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1159 transitions. [2020-10-16 01:23:16,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:23:16,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1159 transitions. [2020-10-16 01:23:16,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:23:16,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:23:16,166 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:23:16,166 INFO L185 Difference]: Start difference. First operand has 63 places, 52 transitions, 357 flow. Second operand 7 states and 1159 transitions. [2020-10-16 01:23:16,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 53 transitions, 412 flow [2020-10-16 01:23:16,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 53 transitions, 368 flow, removed 13 selfloop flow, removed 4 redundant places. [2020-10-16 01:23:16,178 INFO L241 Difference]: Finished difference. Result has 67 places, 47 transitions, 339 flow [2020-10-16 01:23:16,178 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=339, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2020-10-16 01:23:16,179 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2020-10-16 01:23:16,179 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 339 flow [2020-10-16 01:23:16,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:23:16,179 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:23:16,179 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:23:16,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:23:16,180 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:23:16,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:23:16,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1081744341, now seen corresponding path program 1 times [2020-10-16 01:23:16,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:23:16,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195660270] [2020-10-16 01:23:16,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:23:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:23:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:23:16,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195660270] [2020-10-16 01:23:16,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:23:16,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:23:16,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216817761] [2020-10-16 01:23:16,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:23:16,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:23:16,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:23:16,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:23:16,246 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 201 [2020-10-16 01:23:16,247 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 339 flow. Second operand 4 states. [2020-10-16 01:23:16,247 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:23:16,247 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 201 [2020-10-16 01:23:16,247 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:23:16,312 INFO L129 PetriNetUnfolder]: 182/418 cut-off events. [2020-10-16 01:23:16,312 INFO L130 PetriNetUnfolder]: For 1984/2324 co-relation queries the response was YES. [2020-10-16 01:23:16,315 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1837 conditions, 418 events. 182/418 cut-off events. For 1984/2324 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 2439 event pairs, 2 based on Foata normal form. 1/360 useless extension candidates. Maximal degree in co-relation 1810. Up to 175 conditions per place. [2020-10-16 01:23:16,317 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 3 selfloop transitions, 1 changer transitions 9/48 dead transitions. [2020-10-16 01:23:16,317 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 48 transitions, 351 flow [2020-10-16 01:23:16,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:23:16,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:23:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 686 transitions. [2020-10-16 01:23:16,320 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8532338308457711 [2020-10-16 01:23:16,320 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 686 transitions. [2020-10-16 01:23:16,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 686 transitions. [2020-10-16 01:23:16,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:23:16,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 686 transitions. [2020-10-16 01:23:16,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:23:16,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:23:16,324 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:23:16,324 INFO L185 Difference]: Start difference. First operand has 67 places, 47 transitions, 339 flow. Second operand 4 states and 686 transitions. [2020-10-16 01:23:16,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 48 transitions, 351 flow [2020-10-16 01:23:16,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 48 transitions, 288 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-16 01:23:16,333 INFO L241 Difference]: Finished difference. Result has 64 places, 39 transitions, 232 flow [2020-10-16 01:23:16,333 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=64, PETRI_TRANSITIONS=39} [2020-10-16 01:23:16,333 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2020-10-16 01:23:16,333 INFO L481 AbstractCegarLoop]: Abstraction has has 64 places, 39 transitions, 232 flow [2020-10-16 01:23:16,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:23:16,334 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:23:16,334 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:23:16,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:23:16,334 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:23:16,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:23:16,334 INFO L82 PathProgramCache]: Analyzing trace with hash -402538943, now seen corresponding path program 2 times [2020-10-16 01:23:16,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:23:16,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099929979] [2020-10-16 01:23:16,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:23:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:23:16,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:23:16,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099929979] [2020-10-16 01:23:16,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:23:16,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:23:16,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396824009] [2020-10-16 01:23:16,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:23:16,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:23:16,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:23:16,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:23:16,530 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 201 [2020-10-16 01:23:16,531 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 39 transitions, 232 flow. Second operand 6 states. [2020-10-16 01:23:16,531 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:23:16,531 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 201 [2020-10-16 01:23:16,531 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:23:16,629 INFO L129 PetriNetUnfolder]: 65/183 cut-off events. [2020-10-16 01:23:16,629 INFO L130 PetriNetUnfolder]: For 374/384 co-relation queries the response was YES. [2020-10-16 01:23:16,630 INFO L80 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 183 events. 65/183 cut-off events. For 374/384 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 838 event pairs, 0 based on Foata normal form. 1/168 useless extension candidates. Maximal degree in co-relation 626. Up to 57 conditions per place. [2020-10-16 01:23:16,631 INFO L132 encePairwiseOnDemand]: 196/201 looper letters, 7 selfloop transitions, 3 changer transitions 3/43 dead transitions. [2020-10-16 01:23:16,631 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 43 transitions, 280 flow [2020-10-16 01:23:16,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:23:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:23:16,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 625 transitions. [2020-10-16 01:23:16,634 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.777363184079602 [2020-10-16 01:23:16,635 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 625 transitions. [2020-10-16 01:23:16,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 625 transitions. [2020-10-16 01:23:16,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:23:16,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 625 transitions. [2020-10-16 01:23:16,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:23:16,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:23:16,638 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:23:16,638 INFO L185 Difference]: Start difference. First operand has 64 places, 39 transitions, 232 flow. Second operand 4 states and 625 transitions. [2020-10-16 01:23:16,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 43 transitions, 280 flow [2020-10-16 01:23:16,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 167 flow, removed 19 selfloop flow, removed 18 redundant places. [2020-10-16 01:23:16,642 INFO L241 Difference]: Finished difference. Result has 49 places, 39 transitions, 146 flow [2020-10-16 01:23:16,642 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2020-10-16 01:23:16,643 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2020-10-16 01:23:16,643 INFO L481 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 146 flow [2020-10-16 01:23:16,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:23:16,643 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:23:16,643 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:23:16,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:23:16,643 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:23:16,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:23:16,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1927431871, now seen corresponding path program 3 times [2020-10-16 01:23:16,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:23:16,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942317138] [2020-10-16 01:23:16,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:23:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:23:16,710 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:23:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:23:16,812 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:23:16,849 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:23:16,850 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:23:16,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 01:23:16,851 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 01:23:16,869 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1295] [1295] L851-->L859: Formula: (let ((.cse8 (= (mod ~z$r_buff1_thd0~0_In-766538084 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In-766538084 256) 0)) (.cse6 (= 0 (mod ~z$w_buff0_used~0_In-766538084 256))) (.cse7 (= (mod ~z$r_buff0_thd0~0_In-766538084 256) 0))) (let ((.cse0 (not .cse7)) (.cse1 (not .cse6)) (.cse5 (or .cse8 .cse9)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse2 (or .cse6 .cse7))) (and (or (and (= ~z$w_buff0_used~0_Out-766538084 0) .cse0 .cse1) (and (= ~z$w_buff0_used~0_In-766538084 ~z$w_buff0_used~0_Out-766538084) .cse2)) (or (and (= ~z$w_buff1_used~0_Out-766538084 0) .cse3 .cse4) (and (= ~z$w_buff1_used~0_Out-766538084 ~z$w_buff1_used~0_In-766538084) .cse5)) (= ~z$r_buff1_thd0~0_In-766538084 ~z$r_buff1_thd0~0_Out-766538084) (or (and .cse0 (= ~z~0_Out-766538084 ~z$w_buff0~0_In-766538084) .cse1) (and (or (and .cse5 (= ~z~0_In-766538084 ~z~0_Out-766538084)) (and .cse3 .cse4 (= ~z$w_buff1~0_In-766538084 ~z~0_Out-766538084))) .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-766538084 0)) (= (mod ~main$tmp_guard0~0_In-766538084 256) |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-766538084|) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-766538084 |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-766538084|) (= ~z$r_buff0_thd0~0_In-766538084 ~z$r_buff0_thd0~0_Out-766538084)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-766538084, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-766538084, ~z$w_buff0~0=~z$w_buff0~0_In-766538084, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-766538084, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-766538084, ~z$w_buff1~0=~z$w_buff1~0_In-766538084, ~z~0=~z~0_In-766538084, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-766538084} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-766538084, ~z$w_buff0~0=~z$w_buff0~0_In-766538084, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-766538084, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-766538084|, ~z$w_buff1~0=~z$w_buff1~0_In-766538084, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-766538084, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-766538084|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-766538084|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-766538084|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-766538084|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out-766538084|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-766538084, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-766538084|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-766538084, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-766538084, ~z~0=~z~0_Out-766538084} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_assume_abort_if_not_#in~cond, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_assume_abort_if_not_~cond, ~z$r_buff1_thd0~0, ~z~0] because there is no mapped edge [2020-10-16 01:23:16,876 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,876 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,877 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,877 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,877 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,877 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,878 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,878 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,878 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,878 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,878 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,879 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,879 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,879 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,879 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,879 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,879 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,880 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,880 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,880 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,880 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,880 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,881 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,881 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,882 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,882 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,882 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,883 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,883 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,883 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,883 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,883 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,883 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,884 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,885 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,885 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,885 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,885 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,885 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,885 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,886 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,886 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,886 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,886 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,887 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,887 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,887 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,888 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,888 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,888 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,888 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,888 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,888 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,889 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,889 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,889 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,889 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,889 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,890 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,890 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,890 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:23:16,890 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:23:16,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:23:16 BasicIcfg [2020-10-16 01:23:16,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:23:16,981 INFO L168 Benchmark]: Toolchain (without parser) took 19017.58 ms. Allocated memory was 250.6 MB in the beginning and 631.8 MB in the end (delta: 381.2 MB). Free memory was 205.8 MB in the beginning and 553.2 MB in the end (delta: -347.5 MB). Peak memory consumption was 432.7 MB. Max. memory is 14.2 GB. [2020-10-16 01:23:16,981 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:23:16,982 INFO L168 Benchmark]: CACSL2BoogieTranslator took 802.99 ms. Allocated memory was 250.6 MB in the beginning and 312.0 MB in the end (delta: 61.3 MB). Free memory was 205.8 MB in the beginning and 260.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:23:16,983 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.42 ms. Allocated memory is still 312.0 MB. Free memory was 260.1 MB in the beginning and 257.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:23:16,983 INFO L168 Benchmark]: Boogie Preprocessor took 48.72 ms. Allocated memory is still 312.0 MB. Free memory was 255.1 MB in the beginning and 252.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:23:16,984 INFO L168 Benchmark]: RCFGBuilder took 2702.53 ms. Allocated memory was 312.0 MB in the beginning and 370.1 MB in the end (delta: 58.2 MB). Free memory was 252.6 MB in the beginning and 285.6 MB in the end (delta: -33.0 MB). Peak memory consumption was 143.6 MB. Max. memory is 14.2 GB. [2020-10-16 01:23:16,985 INFO L168 Benchmark]: TraceAbstraction took 15379.25 ms. Allocated memory was 370.1 MB in the beginning and 631.8 MB in the end (delta: 261.6 MB). Free memory was 285.6 MB in the beginning and 553.2 MB in the end (delta: -267.6 MB). Peak memory consumption was 393.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:23:16,988 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 802.99 ms. Allocated memory was 250.6 MB in the beginning and 312.0 MB in the end (delta: 61.3 MB). Free memory was 205.8 MB in the beginning and 260.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 77.42 ms. Allocated memory is still 312.0 MB. Free memory was 260.1 MB in the beginning and 257.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 48.72 ms. Allocated memory is still 312.0 MB. Free memory was 255.1 MB in the beginning and 252.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2702.53 ms. Allocated memory was 312.0 MB in the beginning and 370.1 MB in the end (delta: 58.2 MB). Free memory was 252.6 MB in the beginning and 285.6 MB in the end (delta: -33.0 MB). Peak memory consumption was 143.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 15379.25 ms. Allocated memory was 370.1 MB in the beginning and 631.8 MB in the end (delta: 261.6 MB). Free memory was 285.6 MB in the beginning and 553.2 MB in the end (delta: -267.6 MB). Peak memory consumption was 393.0 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1643 VarBasedMoverChecksPositive, 100 VarBasedMoverChecksNegative, 34 SemBasedMoverChecksPositive, 66 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 233 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.4s, 116 PlacesBefore, 41 PlacesAfterwards, 105 TransitionsBefore, 29 TransitionsAfterwards, 2446 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 6967 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p3_EAX = 0; [L703] 0 int __unbuffered_p3_EBX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L713] 0 int z = 0; [L714] 0 _Bool z$flush_delayed; [L715] 0 int z$mem_tmp; [L716] 0 _Bool z$r_buff0_thd0; [L717] 0 _Bool z$r_buff0_thd1; [L718] 0 _Bool z$r_buff0_thd2; [L719] 0 _Bool z$r_buff0_thd3; [L720] 0 _Bool z$r_buff0_thd4; [L721] 0 _Bool z$r_buff1_thd0; [L722] 0 _Bool z$r_buff1_thd1; [L723] 0 _Bool z$r_buff1_thd2; [L724] 0 _Bool z$r_buff1_thd3; [L725] 0 _Bool z$r_buff1_thd4; [L726] 0 _Bool z$read_delayed; [L727] 0 int *z$read_delayed_var; [L728] 0 int z$w_buff0; [L729] 0 _Bool z$w_buff0_used; [L730] 0 int z$w_buff1; [L731] 0 _Bool z$w_buff1_used; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L841] 0 pthread_t t825; [L842] FCALL, FORK 0 pthread_create(&t825, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 pthread_t t826; [L844] FCALL, FORK 0 pthread_create(&t826, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t827; [L846] FCALL, FORK 0 pthread_create(&t827, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t828; [L848] FCALL, FORK 0 pthread_create(&t828, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 4 z$w_buff1 = z$w_buff0 [L788] 4 z$w_buff0 = 2 [L789] 4 z$w_buff1_used = z$w_buff0_used [L790] 4 z$w_buff0_used = (_Bool)1 [L7] COND FALSE 4 !(!expression) [L792] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L793] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L794] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L795] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L796] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L797] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 4 z$flush_delayed = weak$$choice2 [L803] 4 z$mem_tmp = z [L804] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L804] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L805] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L805] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L806] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L806] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L807] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L807] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used) [L807] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L807] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used) [L807] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L807] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L808] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L808] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L809] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L810] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L810] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L810] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L811] 4 __unbuffered_p3_EAX = z [L812] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L812] 4 z = z$flush_delayed ? z$mem_tmp : z [L813] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L737] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L773] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L776] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L777] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L780] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 3 return 0; [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L819] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L819] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L820] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L821] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L821] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L823] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 4 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 z$flush_delayed = weak$$choice2 [L864] 0 z$mem_tmp = z [L865] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L865] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L865] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L866] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L866] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L867] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L867] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L868] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L868] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L869] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L870] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L871] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L871] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L873] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L873] 0 z = z$flush_delayed ? z$mem_tmp : z [L874] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 108 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 15.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.6s, HoareTripleCheckerStatistics: 65 SDtfs, 25 SDslu, 23 SDs, 0 SdLazy, 194 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=357occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 18244 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...