/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-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:39:07,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:39:07,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:39:07,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:39:07,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:39:07,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:39:07,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:39:07,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:39:07,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:39:07,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:39:07,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:39:07,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:39:07,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:39:07,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:39:07,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:39:07,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:39:07,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:39:07,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:39:07,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:39:07,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:39:07,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:39:07,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:39:07,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:39:07,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:39:07,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:39:07,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:39:07,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:39:07,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:39:07,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:39:07,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:39:07,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:39:07,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:39:07,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:39:07,641 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:39:07,642 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:39:07,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:39:07,643 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:39:07,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:39:07,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:39:07,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:39:07,645 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:39:07,645 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-SemanticLooper.epf [2020-10-16 04:39:07,667 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:39:07,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:39:07,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:39:07,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:39:07,669 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:39:07,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:39:07,669 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:39:07,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:39:07,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:39:07,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:39:07,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:39:07,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:39:07,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:39:07,671 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:39:07,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:39:07,671 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:39:07,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:39:07,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:39:07,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:39:07,672 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:39:07,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:39:07,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:39:07,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:39:07,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:39:07,673 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:39:07,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:39:07,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:39:07,673 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:39:07,673 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:39:07,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:39:07,984 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:39:07,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:39:07,990 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:39:07,990 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:39:07,991 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_rmo.oepc.i [2020-10-16 04:39:08,047 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/422032784/01a6c7ea641343c580c5b5c71ef2ee49/FLAGd047f2e38 [2020-10-16 04:39:08,599 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:39:08,599 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_rmo.oepc.i [2020-10-16 04:39:08,617 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/422032784/01a6c7ea641343c580c5b5c71ef2ee49/FLAGd047f2e38 [2020-10-16 04:39:08,859 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/422032784/01a6c7ea641343c580c5b5c71ef2ee49 [2020-10-16 04:39:08,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:39:08,869 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:39:08,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:39:08,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:39:08,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:39:08,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:39:08" (1/1) ... [2020-10-16 04:39:08,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d182b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:39:08, skipping insertion in model container [2020-10-16 04:39:08,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:39:08" (1/1) ... [2020-10-16 04:39:08,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:39:08,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:39:09,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:39:09,483 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:39:09,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:39:09,637 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:39:09,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:39:09 WrapperNode [2020-10-16 04:39:09,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:39:09,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:39:09,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:39:09,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:39:09,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:39:09" (1/1) ... [2020-10-16 04:39:09,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:39:09" (1/1) ... [2020-10-16 04:39:09,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:39:09,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:39:09,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:39:09,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:39:09,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:39:09" (1/1) ... [2020-10-16 04:39:09,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:39:09" (1/1) ... [2020-10-16 04:39:09,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:39:09" (1/1) ... [2020-10-16 04:39:09,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:39:09" (1/1) ... [2020-10-16 04:39:09,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:39:09" (1/1) ... [2020-10-16 04:39:09,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:39:09" (1/1) ... [2020-10-16 04:39:09,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:39:09" (1/1) ... [2020-10-16 04:39:09,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:39:09,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:39:09,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:39:09,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:39:09,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:39:09" (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 04:39:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:39:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:39:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:39:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:39:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:39:09,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:39:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:39:09,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:39:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:39:09,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:39:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:39:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:39:09,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:39:09,825 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 04:39:11,845 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:39:11,846 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:39:11,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:39:11 BoogieIcfgContainer [2020-10-16 04:39:11,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:39:11,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:39:11,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:39:11,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:39:11,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:39:08" (1/3) ... [2020-10-16 04:39:11,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484a7ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:39:11, skipping insertion in model container [2020-10-16 04:39:11,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:39:09" (2/3) ... [2020-10-16 04:39:11,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484a7ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:39:11, skipping insertion in model container [2020-10-16 04:39:11,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:39:11" (3/3) ... [2020-10-16 04:39:11,857 INFO L111 eAbstractionObserver]: Analyzing ICFG mix006_rmo.oepc.i [2020-10-16 04:39:11,868 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:39:11,876 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:39:11,877 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:39:11,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,911 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,911 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,912 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,912 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,912 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,913 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,916 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,916 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,916 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,917 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,918 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,918 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,918 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,919 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,919 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,920 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,920 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,924 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,924 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,924 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,924 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,924 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,925 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,925 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,925 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,925 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,925 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,926 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,926 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,926 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,926 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,926 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,938 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,941 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,953 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,953 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,953 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,955 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,956 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:39:11,976 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 04:39:11,999 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:39:11,999 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:39:11,999 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:39:11,999 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:39:12,000 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:39:12,000 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:39:12,000 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:39:12,000 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:39:12,015 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2020-10-16 04:39:12,064 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2020-10-16 04:39:12,064 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:39:12,070 INFO L80 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-16 04:39:12,070 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2020-10-16 04:39:12,077 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2020-10-16 04:39:12,081 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:39:12,083 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2020-10-16 04:39:12,087 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2020-10-16 04:39:12,088 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2020-10-16 04:39:12,146 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2020-10-16 04:39:12,146 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:39:12,147 INFO L80 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-16 04:39:12,150 INFO L117 LiptonReduction]: Number of co-enabled transitions 1824 [2020-10-16 04:39:12,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:12,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:12,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:12,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:12,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:12,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:12,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:12,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:12,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:12,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:12,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:12,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:12,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:12,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:12,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:12,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:12,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:12,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:12,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:12,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:12,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:12,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:12,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:12,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:12,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:12,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:12,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:12,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:12,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:12,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:12,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:12,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:12,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:12,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:12,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:12,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:12,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:12,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:12,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:12,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:12,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:12,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:12,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:12,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:12,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:12,846 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:39:12,950 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 04:39:13,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:39:13,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:13,569 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-10-16 04:39:13,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:13,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:13,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:13,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:13,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:13,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:13,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:13,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:13,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:13,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:13,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:13,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:13,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:13,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:13,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:13,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:13,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:13,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:13,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:13,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:13,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:13,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:13,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:13,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:13,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:13,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:13,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:13,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:13,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:13,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:13,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:13,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:13,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:13,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:13,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:13,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:13,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:13,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:13,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:13,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:13,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:13,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:13,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:14,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:39:14,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:39:14,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:39:14,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:39:14,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:14,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:14,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:39:14,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:39:14,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:39:14,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:39:14,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:39:14,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:39:14,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:39:14,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:39:14,139 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 04:39:14,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:39:14,141 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 04:39:14,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:39:14,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:39:14,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:14,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:14,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:14,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:39:14,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:39:14,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:39:14,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:39:14,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:39:14,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:39:14,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:39:14,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:39:14,720 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 04:39:14,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:39:14,722 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 04:39:14,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:39:14,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:39:14,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:39:14,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:39:14,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:39:14,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:14,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:14,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:14,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:14,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:14,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:14,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:14,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:14,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:14,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:14,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:14,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:14,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:14,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:14,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:14,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:15,805 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-16 04:39:15,943 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-16 04:39:15,952 INFO L132 LiptonReduction]: Checked pairs total: 5439 [2020-10-16 04:39:15,952 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 04:39:15,969 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3891 [2020-10-16 04:39:15,980 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2020-10-16 04:39:15,981 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:39:15,981 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:15,982 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 04:39:15,982 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:15,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:15,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1054062, now seen corresponding path program 1 times [2020-10-16 04:39:15,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:16,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999866457] [2020-10-16 04:39:16,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:16,197 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 04:39:16,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999866457] [2020-10-16 04:39:16,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:16,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:39:16,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020520985] [2020-10-16 04:39:16,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:39:16,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:16,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:39:16,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:39:16,268 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 174 [2020-10-16 04:39:16,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states. [2020-10-16 04:39:16,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:16,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 174 [2020-10-16 04:39:16,278 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:16,398 INFO L129 PetriNetUnfolder]: 49/151 cut-off events. [2020-10-16 04:39:16,398 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:39:16,399 INFO L80 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 151 events. 49/151 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 708 event pairs, 38 based on Foata normal form. 17/152 useless extension candidates. Maximal degree in co-relation 237. Up to 65 conditions per place. [2020-10-16 04:39:16,401 INFO L132 encePairwiseOnDemand]: 170/174 looper letters, 9 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2020-10-16 04:39:16,402 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 29 transitions, 89 flow [2020-10-16 04:39:16,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:39:16,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:39:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2020-10-16 04:39:16,420 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8773946360153256 [2020-10-16 04:39:16,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2020-10-16 04:39:16,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2020-10-16 04:39:16,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:16,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2020-10-16 04:39:16,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:39:16,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:39:16,440 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:39:16,443 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 458 transitions. [2020-10-16 04:39:16,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 29 transitions, 89 flow [2020-10-16 04:39:16,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 86 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 04:39:16,449 INFO L241 Difference]: Finished difference. Result has 34 places, 25 transitions, 60 flow [2020-10-16 04:39:16,452 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2020-10-16 04:39:16,453 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2020-10-16 04:39:16,453 INFO L481 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow [2020-10-16 04:39:16,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:39:16,454 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:16,454 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:39:16,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:39:16,454 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:16,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:16,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1416486098, now seen corresponding path program 1 times [2020-10-16 04:39:16,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:16,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949747295] [2020-10-16 04:39:16,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:16,577 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 04:39:16,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949747295] [2020-10-16 04:39:16,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:16,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:39:16,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338330874] [2020-10-16 04:39:16,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:39:16,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:16,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:39:16,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:39:16,583 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 174 [2020-10-16 04:39:16,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand 4 states. [2020-10-16 04:39:16,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:16,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 174 [2020-10-16 04:39:16,584 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:16,630 INFO L129 PetriNetUnfolder]: 26/90 cut-off events. [2020-10-16 04:39:16,631 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:39:16,631 INFO L80 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 90 events. 26/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 326 event pairs, 7 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 146. Up to 28 conditions per place. [2020-10-16 04:39:16,632 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 5 selfloop transitions, 3 changer transitions 9/35 dead transitions. [2020-10-16 04:39:16,632 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 35 transitions, 114 flow [2020-10-16 04:39:16,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:39:16,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:39:16,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 739 transitions. [2020-10-16 04:39:16,637 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8494252873563218 [2020-10-16 04:39:16,638 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 739 transitions. [2020-10-16 04:39:16,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 739 transitions. [2020-10-16 04:39:16,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:16,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 739 transitions. [2020-10-16 04:39:16,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:39:16,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:39:16,644 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:39:16,644 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 5 states and 739 transitions. [2020-10-16 04:39:16,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 35 transitions, 114 flow [2020-10-16 04:39:16,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 35 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:39:16,646 INFO L241 Difference]: Finished difference. Result has 39 places, 26 transitions, 81 flow [2020-10-16 04:39:16,646 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=81, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2020-10-16 04:39:16,647 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2020-10-16 04:39:16,647 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 81 flow [2020-10-16 04:39:16,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:39:16,647 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:16,647 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:39:16,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:39:16,648 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:16,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:16,648 INFO L82 PathProgramCache]: Analyzing trace with hash -961132222, now seen corresponding path program 1 times [2020-10-16 04:39:16,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:16,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115754294] [2020-10-16 04:39:16,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:16,740 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 04:39:16,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115754294] [2020-10-16 04:39:16,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:16,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:39:16,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834638782] [2020-10-16 04:39:16,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:39:16,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:16,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:39:16,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:39:16,744 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 174 [2020-10-16 04:39:16,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 81 flow. Second operand 4 states. [2020-10-16 04:39:16,745 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:16,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 174 [2020-10-16 04:39:16,745 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:16,770 INFO L129 PetriNetUnfolder]: 5/47 cut-off events. [2020-10-16 04:39:16,770 INFO L130 PetriNetUnfolder]: For 24/28 co-relation queries the response was YES. [2020-10-16 04:39:16,770 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 47 events. 5/47 cut-off events. For 24/28 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 1 based on Foata normal form. 5/49 useless extension candidates. Maximal degree in co-relation 85. Up to 14 conditions per place. [2020-10-16 04:39:16,771 INFO L132 encePairwiseOnDemand]: 170/174 looper letters, 2 selfloop transitions, 2 changer transitions 2/28 dead transitions. [2020-10-16 04:39:16,771 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 28 transitions, 99 flow [2020-10-16 04:39:16,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:39:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:39:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 743 transitions. [2020-10-16 04:39:16,774 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8540229885057471 [2020-10-16 04:39:16,775 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 743 transitions. [2020-10-16 04:39:16,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 743 transitions. [2020-10-16 04:39:16,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:16,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 743 transitions. [2020-10-16 04:39:16,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:39:16,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:39:16,779 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:39:16,780 INFO L185 Difference]: Start difference. First operand has 39 places, 26 transitions, 81 flow. Second operand 5 states and 743 transitions. [2020-10-16 04:39:16,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 28 transitions, 99 flow [2020-10-16 04:39:16,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 92 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 04:39:16,782 INFO L241 Difference]: Finished difference. Result has 41 places, 26 transitions, 86 flow [2020-10-16 04:39:16,782 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2020-10-16 04:39:16,782 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2020-10-16 04:39:16,782 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 86 flow [2020-10-16 04:39:16,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:39:16,783 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:16,783 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:39:16,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:39:16,783 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:16,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:16,784 INFO L82 PathProgramCache]: Analyzing trace with hash 269622998, now seen corresponding path program 1 times [2020-10-16 04:39:16,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:16,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597089313] [2020-10-16 04:39:16,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:16,843 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 04:39:16,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597089313] [2020-10-16 04:39:16,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:16,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:39:16,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081066726] [2020-10-16 04:39:16,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:39:16,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:16,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:39:16,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:39:16,847 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 174 [2020-10-16 04:39:16,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 86 flow. Second operand 4 states. [2020-10-16 04:39:16,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:16,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 174 [2020-10-16 04:39:16,848 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:16,874 INFO L129 PetriNetUnfolder]: 4/45 cut-off events. [2020-10-16 04:39:16,874 INFO L130 PetriNetUnfolder]: For 50/58 co-relation queries the response was YES. [2020-10-16 04:39:16,875 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 45 events. 4/45 cut-off events. For 50/58 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 116 event pairs, 0 based on Foata normal form. 4/47 useless extension candidates. Maximal degree in co-relation 85. Up to 12 conditions per place. [2020-10-16 04:39:16,875 INFO L132 encePairwiseOnDemand]: 170/174 looper letters, 2 selfloop transitions, 2 changer transitions 2/28 dead transitions. [2020-10-16 04:39:16,875 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 28 transitions, 106 flow [2020-10-16 04:39:16,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:39:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:39:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 738 transitions. [2020-10-16 04:39:16,879 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8482758620689655 [2020-10-16 04:39:16,879 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 738 transitions. [2020-10-16 04:39:16,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 738 transitions. [2020-10-16 04:39:16,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:16,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 738 transitions. [2020-10-16 04:39:16,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:39:16,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:39:16,883 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:39:16,884 INFO L185 Difference]: Start difference. First operand has 41 places, 26 transitions, 86 flow. Second operand 5 states and 738 transitions. [2020-10-16 04:39:16,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 28 transitions, 106 flow [2020-10-16 04:39:16,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 28 transitions, 98 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 04:39:16,886 INFO L241 Difference]: Finished difference. Result has 42 places, 26 transitions, 90 flow [2020-10-16 04:39:16,886 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2020-10-16 04:39:16,886 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2020-10-16 04:39:16,886 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 90 flow [2020-10-16 04:39:16,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:39:16,887 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:16,887 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:39:16,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:39:16,887 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:16,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:16,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1454503552, now seen corresponding path program 1 times [2020-10-16 04:39:16,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:16,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54256726] [2020-10-16 04:39:16,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:17,013 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 04:39:17,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54256726] [2020-10-16 04:39:17,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:17,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:39:17,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713637054] [2020-10-16 04:39:17,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:39:17,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:17,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:39:17,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:39:17,017 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 174 [2020-10-16 04:39:17,018 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 90 flow. Second operand 4 states. [2020-10-16 04:39:17,018 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:17,018 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 174 [2020-10-16 04:39:17,018 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:17,094 INFO L129 PetriNetUnfolder]: 41/119 cut-off events. [2020-10-16 04:39:17,094 INFO L130 PetriNetUnfolder]: For 76/82 co-relation queries the response was YES. [2020-10-16 04:39:17,098 INFO L80 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 119 events. 41/119 cut-off events. For 76/82 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 506 event pairs, 14 based on Foata normal form. 10/123 useless extension candidates. Maximal degree in co-relation 273. Up to 56 conditions per place. [2020-10-16 04:39:17,100 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 7 selfloop transitions, 7 changer transitions 2/36 dead transitions. [2020-10-16 04:39:17,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 142 flow [2020-10-16 04:39:17,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:39:17,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:39:17,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 733 transitions. [2020-10-16 04:39:17,103 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8425287356321839 [2020-10-16 04:39:17,104 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 733 transitions. [2020-10-16 04:39:17,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 733 transitions. [2020-10-16 04:39:17,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:17,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 733 transitions. [2020-10-16 04:39:17,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:39:17,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:39:17,109 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:39:17,109 INFO L185 Difference]: Start difference. First operand has 42 places, 26 transitions, 90 flow. Second operand 5 states and 733 transitions. [2020-10-16 04:39:17,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 142 flow [2020-10-16 04:39:17,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 134 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 04:39:17,115 INFO L241 Difference]: Finished difference. Result has 43 places, 32 transitions, 136 flow [2020-10-16 04:39:17,115 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2020-10-16 04:39:17,115 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2020-10-16 04:39:17,115 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 136 flow [2020-10-16 04:39:17,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:39:17,116 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:17,116 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 04:39:17,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:39:17,121 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:17,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:17,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1400760568, now seen corresponding path program 1 times [2020-10-16 04:39:17,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:17,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968196996] [2020-10-16 04:39:17,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:17,255 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 04:39:17,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968196996] [2020-10-16 04:39:17,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:17,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:39:17,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980399745] [2020-10-16 04:39:17,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:39:17,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:17,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:39:17,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:39:17,259 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 174 [2020-10-16 04:39:17,263 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 136 flow. Second operand 5 states. [2020-10-16 04:39:17,263 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:17,263 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 174 [2020-10-16 04:39:17,264 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:17,366 INFO L129 PetriNetUnfolder]: 91/274 cut-off events. [2020-10-16 04:39:17,367 INFO L130 PetriNetUnfolder]: For 292/361 co-relation queries the response was YES. [2020-10-16 04:39:17,369 INFO L80 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 274 events. 91/274 cut-off events. For 292/361 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1686 event pairs, 32 based on Foata normal form. 17/272 useless extension candidates. Maximal degree in co-relation 773. Up to 136 conditions per place. [2020-10-16 04:39:17,374 INFO L132 encePairwiseOnDemand]: 170/174 looper letters, 7 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2020-10-16 04:39:17,374 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 173 flow [2020-10-16 04:39:17,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:39:17,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:39:17,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 701 transitions. [2020-10-16 04:39:17,378 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8057471264367816 [2020-10-16 04:39:17,378 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 701 transitions. [2020-10-16 04:39:17,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 701 transitions. [2020-10-16 04:39:17,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:17,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 701 transitions. [2020-10-16 04:39:17,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:39:17,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:39:17,385 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:39:17,385 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 136 flow. Second operand 5 states and 701 transitions. [2020-10-16 04:39:17,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 173 flow [2020-10-16 04:39:17,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 36 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:39:17,396 INFO L241 Difference]: Finished difference. Result has 49 places, 34 transitions, 159 flow [2020-10-16 04:39:17,397 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2020-10-16 04:39:17,397 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2020-10-16 04:39:17,398 INFO L481 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 159 flow [2020-10-16 04:39:17,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:39:17,398 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:17,398 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 04:39:17,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:39:17,398 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:17,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:17,399 INFO L82 PathProgramCache]: Analyzing trace with hash -967375978, now seen corresponding path program 2 times [2020-10-16 04:39:17,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:17,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417454880] [2020-10-16 04:39:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:17,530 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 04:39:17,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417454880] [2020-10-16 04:39:17,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:17,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:39:17,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286683827] [2020-10-16 04:39:17,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:39:17,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:17,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:39:17,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:39:17,536 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 174 [2020-10-16 04:39:17,537 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 159 flow. Second operand 5 states. [2020-10-16 04:39:17,537 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:17,537 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 174 [2020-10-16 04:39:17,537 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:17,648 INFO L129 PetriNetUnfolder]: 48/175 cut-off events. [2020-10-16 04:39:17,648 INFO L130 PetriNetUnfolder]: For 285/446 co-relation queries the response was YES. [2020-10-16 04:39:17,649 INFO L80 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 175 events. 48/175 cut-off events. For 285/446 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 926 event pairs, 4 based on Foata normal form. 64/232 useless extension candidates. Maximal degree in co-relation 596. Up to 103 conditions per place. [2020-10-16 04:39:17,650 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 5 selfloop transitions, 13 changer transitions 5/44 dead transitions. [2020-10-16 04:39:17,650 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 44 transitions, 261 flow [2020-10-16 04:39:17,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:39:17,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:39:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1025 transitions. [2020-10-16 04:39:17,654 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8415435139573071 [2020-10-16 04:39:17,654 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1025 transitions. [2020-10-16 04:39:17,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1025 transitions. [2020-10-16 04:39:17,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:17,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1025 transitions. [2020-10-16 04:39:17,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:39:17,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:39:17,660 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:39:17,660 INFO L185 Difference]: Start difference. First operand has 49 places, 34 transitions, 159 flow. Second operand 7 states and 1025 transitions. [2020-10-16 04:39:17,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 44 transitions, 261 flow [2020-10-16 04:39:17,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 44 transitions, 258 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 04:39:17,667 INFO L241 Difference]: Finished difference. Result has 57 places, 39 transitions, 234 flow [2020-10-16 04:39:17,667 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=234, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2020-10-16 04:39:17,667 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2020-10-16 04:39:17,667 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 234 flow [2020-10-16 04:39:17,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:39:17,668 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:17,668 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 04:39:17,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:39:17,668 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:17,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:17,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1109873826, now seen corresponding path program 1 times [2020-10-16 04:39:17,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:17,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593540256] [2020-10-16 04:39:17,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:17,861 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 04:39:17,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593540256] [2020-10-16 04:39:17,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:17,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:39:17,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144683990] [2020-10-16 04:39:17,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:39:17,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:17,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:39:17,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:39:17,865 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 174 [2020-10-16 04:39:17,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 234 flow. Second operand 6 states. [2020-10-16 04:39:17,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:17,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 174 [2020-10-16 04:39:17,866 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:17,970 INFO L129 PetriNetUnfolder]: 25/124 cut-off events. [2020-10-16 04:39:17,971 INFO L130 PetriNetUnfolder]: For 445/744 co-relation queries the response was YES. [2020-10-16 04:39:17,972 INFO L80 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 124 events. 25/124 cut-off events. For 445/744 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 615 event pairs, 0 based on Foata normal form. 70/187 useless extension candidates. Maximal degree in co-relation 536. Up to 80 conditions per place. [2020-10-16 04:39:17,973 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 2 selfloop transitions, 17 changer transitions 3/43 dead transitions. [2020-10-16 04:39:17,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 43 transitions, 310 flow [2020-10-16 04:39:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:39:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:39:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1311 transitions. [2020-10-16 04:39:17,977 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8371647509578544 [2020-10-16 04:39:17,978 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1311 transitions. [2020-10-16 04:39:17,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1311 transitions. [2020-10-16 04:39:17,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:17,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1311 transitions. [2020-10-16 04:39:17,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:39:17,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:39:17,985 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:39:17,986 INFO L185 Difference]: Start difference. First operand has 57 places, 39 transitions, 234 flow. Second operand 9 states and 1311 transitions. [2020-10-16 04:39:17,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 43 transitions, 310 flow [2020-10-16 04:39:17,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 43 transitions, 264 flow, removed 17 selfloop flow, removed 6 redundant places. [2020-10-16 04:39:17,991 INFO L241 Difference]: Finished difference. Result has 61 places, 40 transitions, 244 flow [2020-10-16 04:39:17,991 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=244, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2020-10-16 04:39:17,991 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2020-10-16 04:39:17,992 INFO L481 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 244 flow [2020-10-16 04:39:17,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:39:17,992 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:17,992 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] [2020-10-16 04:39:17,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:39:17,992 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:17,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:17,993 INFO L82 PathProgramCache]: Analyzing trace with hash -16633485, now seen corresponding path program 1 times [2020-10-16 04:39:17,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:17,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323073116] [2020-10-16 04:39:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:18,198 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 04:39:18,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323073116] [2020-10-16 04:39:18,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:18,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:39:18,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273403315] [2020-10-16 04:39:18,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:39:18,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:18,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:39:18,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:39:18,204 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 174 [2020-10-16 04:39:18,205 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 244 flow. Second operand 8 states. [2020-10-16 04:39:18,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:18,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 174 [2020-10-16 04:39:18,206 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:18,570 INFO L129 PetriNetUnfolder]: 124/484 cut-off events. [2020-10-16 04:39:18,570 INFO L130 PetriNetUnfolder]: For 1522/1785 co-relation queries the response was YES. [2020-10-16 04:39:18,574 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1767 conditions, 484 events. 124/484 cut-off events. For 1522/1785 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 3823 event pairs, 11 based on Foata normal form. 69/528 useless extension candidates. Maximal degree in co-relation 1743. Up to 161 conditions per place. [2020-10-16 04:39:18,578 INFO L132 encePairwiseOnDemand]: 165/174 looper letters, 8 selfloop transitions, 8 changer transitions 7/54 dead transitions. [2020-10-16 04:39:18,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 54 transitions, 344 flow [2020-10-16 04:39:18,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:39:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:39:18,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 984 transitions. [2020-10-16 04:39:18,582 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7068965517241379 [2020-10-16 04:39:18,583 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 984 transitions. [2020-10-16 04:39:18,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 984 transitions. [2020-10-16 04:39:18,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:18,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 984 transitions. [2020-10-16 04:39:18,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:39:18,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:39:18,591 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:39:18,591 INFO L185 Difference]: Start difference. First operand has 61 places, 40 transitions, 244 flow. Second operand 8 states and 984 transitions. [2020-10-16 04:39:18,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 54 transitions, 344 flow [2020-10-16 04:39:18,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 54 transitions, 278 flow, removed 18 selfloop flow, removed 8 redundant places. [2020-10-16 04:39:18,614 INFO L241 Difference]: Finished difference. Result has 64 places, 46 transitions, 248 flow [2020-10-16 04:39:18,615 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=248, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2020-10-16 04:39:18,615 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 28 predicate places. [2020-10-16 04:39:18,615 INFO L481 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 248 flow [2020-10-16 04:39:18,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:39:18,616 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:18,616 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] [2020-10-16 04:39:18,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:39:18,616 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:18,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:18,616 INFO L82 PathProgramCache]: Analyzing trace with hash 832618099, now seen corresponding path program 2 times [2020-10-16 04:39:18,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:18,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610963185] [2020-10-16 04:39:18,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:18,824 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 04:39:18,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610963185] [2020-10-16 04:39:18,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:18,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:39:18,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911417695] [2020-10-16 04:39:18,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:39:18,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:18,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:39:18,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:39:18,829 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 174 [2020-10-16 04:39:18,830 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 248 flow. Second operand 8 states. [2020-10-16 04:39:18,830 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:18,830 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 174 [2020-10-16 04:39:18,830 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:19,157 INFO L129 PetriNetUnfolder]: 115/472 cut-off events. [2020-10-16 04:39:19,158 INFO L130 PetriNetUnfolder]: For 972/1160 co-relation queries the response was YES. [2020-10-16 04:39:19,163 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 472 events. 115/472 cut-off events. For 972/1160 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3728 event pairs, 12 based on Foata normal form. 79/530 useless extension candidates. Maximal degree in co-relation 1565. Up to 122 conditions per place. [2020-10-16 04:39:19,166 INFO L132 encePairwiseOnDemand]: 167/174 looper letters, 13 selfloop transitions, 6 changer transitions 4/54 dead transitions. [2020-10-16 04:39:19,166 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 54 transitions, 342 flow [2020-10-16 04:39:19,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:39:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:39:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 915 transitions. [2020-10-16 04:39:19,172 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6573275862068966 [2020-10-16 04:39:19,172 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 915 transitions. [2020-10-16 04:39:19,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 915 transitions. [2020-10-16 04:39:19,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:19,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 915 transitions. [2020-10-16 04:39:19,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:39:19,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:39:19,183 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:39:19,183 INFO L185 Difference]: Start difference. First operand has 64 places, 46 transitions, 248 flow. Second operand 8 states and 915 transitions. [2020-10-16 04:39:19,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 54 transitions, 342 flow [2020-10-16 04:39:19,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 54 transitions, 329 flow, removed 6 selfloop flow, removed 4 redundant places. [2020-10-16 04:39:19,195 INFO L241 Difference]: Finished difference. Result has 67 places, 46 transitions, 263 flow [2020-10-16 04:39:19,196 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=263, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2020-10-16 04:39:19,196 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 31 predicate places. [2020-10-16 04:39:19,196 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 263 flow [2020-10-16 04:39:19,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:39:19,196 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:19,197 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] [2020-10-16 04:39:19,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:39:19,197 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:19,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:19,197 INFO L82 PathProgramCache]: Analyzing trace with hash -391111613, now seen corresponding path program 3 times [2020-10-16 04:39:19,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:19,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099734642] [2020-10-16 04:39:19,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:39:19,307 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:39:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:39:19,409 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:39:19,486 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:39:19,486 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:39:19,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:39:19,530 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 04:39:19,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,541 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 04:39:19,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,541 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 04:39:19,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,542 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 04:39:19,542 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,542 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 04:39:19,542 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,542 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 04:39:19,542 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,543 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 04:39:19,543 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,544 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 04:39:19,544 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,544 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 04:39:19,544 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,545 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 04:39:19,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,545 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 04:39:19,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,545 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 04:39:19,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,545 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 04:39:19,546 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,546 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 04:39:19,546 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,546 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 04:39:19,546 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,546 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 04:39:19,547 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,547 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 04:39:19,547 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,551 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 04:39:19,551 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,552 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 04:39:19,552 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,552 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 04:39:19,552 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,552 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 04:39:19,553 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,553 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 04:39:19,553 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,553 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 04:39:19,553 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,553 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 04:39:19,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,554 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 04:39:19,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,554 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 04:39:19,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,554 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 04:39:19,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,555 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 04:39:19,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,556 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 04:39:19,556 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,557 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 04:39:19,557 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,557 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 04:39:19,557 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,557 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 04:39:19,557 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,558 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 04:39:19,558 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:19,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:39:19 BasicIcfg [2020-10-16 04:39:19,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:39:19,648 INFO L168 Benchmark]: Toolchain (without parser) took 10779.07 ms. Allocated memory was 251.7 MB in the beginning and 501.7 MB in the end (delta: 250.1 MB). Free memory was 204.1 MB in the beginning and 273.0 MB in the end (delta: -68.9 MB). Peak memory consumption was 181.2 MB. Max. memory is 14.2 GB. [2020-10-16 04:39:19,648 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 251.7 MB. Free memory is still 225.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:39:19,649 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.87 ms. Allocated memory was 251.7 MB in the beginning and 315.6 MB in the end (delta: 64.0 MB). Free memory was 204.1 MB in the beginning and 261.4 MB in the end (delta: -57.3 MB). Peak memory consumption was 29.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:39:19,650 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.63 ms. Allocated memory is still 315.6 MB. Free memory was 261.4 MB in the beginning and 258.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:39:19,650 INFO L168 Benchmark]: Boogie Preprocessor took 42.85 ms. Allocated memory is still 315.6 MB. Free memory was 258.9 MB in the beginning and 256.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:39:19,651 INFO L168 Benchmark]: RCFGBuilder took 2104.00 ms. Allocated memory was 315.6 MB in the beginning and 359.1 MB in the end (delta: 43.5 MB). Free memory was 256.3 MB in the beginning and 185.3 MB in the end (delta: 71.1 MB). Peak memory consumption was 114.6 MB. Max. memory is 14.2 GB. [2020-10-16 04:39:19,652 INFO L168 Benchmark]: TraceAbstraction took 7796.46 ms. Allocated memory was 359.1 MB in the beginning and 501.7 MB in the end (delta: 142.6 MB). Free memory was 185.3 MB in the beginning and 273.0 MB in the end (delta: -87.7 MB). Peak memory consumption was 54.9 MB. Max. memory is 14.2 GB. [2020-10-16 04:39:19,656 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.18 ms. Allocated memory is still 251.7 MB. Free memory is still 225.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 768.87 ms. Allocated memory was 251.7 MB in the beginning and 315.6 MB in the end (delta: 64.0 MB). Free memory was 204.1 MB in the beginning and 261.4 MB in the end (delta: -57.3 MB). Peak memory consumption was 29.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 59.63 ms. Allocated memory is still 315.6 MB. Free memory was 261.4 MB in the beginning and 258.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 42.85 ms. Allocated memory is still 315.6 MB. Free memory was 258.9 MB in the beginning and 256.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2104.00 ms. Allocated memory was 315.6 MB in the beginning and 359.1 MB in the end (delta: 43.5 MB). Free memory was 256.3 MB in the beginning and 185.3 MB in the end (delta: 71.1 MB). Peak memory consumption was 114.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 7796.46 ms. Allocated memory was 359.1 MB in the beginning and 501.7 MB in the end (delta: 142.6 MB). Free memory was 185.3 MB in the beginning and 273.0 MB in the end (delta: -87.7 MB). Peak memory consumption was 54.9 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1327 VarBasedMoverChecksPositive, 74 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 52 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 201 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.8s, 102 PlacesBefore, 36 PlacesAfterwards, 94 TransitionsBefore, 27 TransitionsAfterwards, 1824 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 5439 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p1_EAX = 0; [L702] 0 int __unbuffered_p1_EBX = 0; [L704] 0 int __unbuffered_p2_EAX = 0; [L706] 0 int __unbuffered_p2_EBX = 0; [L707] 0 _Bool main$tmp_guard0; [L708] 0 _Bool main$tmp_guard1; [L710] 0 int x = 0; [L712] 0 int y = 0; [L714] 0 int z = 0; [L715] 0 _Bool z$flush_delayed; [L716] 0 int z$mem_tmp; [L717] 0 _Bool z$r_buff0_thd0; [L718] 0 _Bool z$r_buff0_thd1; [L719] 0 _Bool z$r_buff0_thd2; [L720] 0 _Bool z$r_buff0_thd3; [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$read_delayed; [L726] 0 int *z$read_delayed_var; [L727] 0 int z$w_buff0; [L728] 0 _Bool z$w_buff0_used; [L729] 0 int z$w_buff1; [L730] 0 _Bool z$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L832] 0 pthread_t t165; [L833] FCALL, FORK 0 pthread_create(&t165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L736] 1 z$w_buff1 = z$w_buff0 [L737] 1 z$w_buff0 = 1 [L738] 1 z$w_buff1_used = z$w_buff0_used [L739] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L741] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L742] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L743] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L744] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L745] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 pthread_t t166; [L835] FCALL, FORK 0 pthread_create(&t166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t167; [L837] FCALL, FORK 0 pthread_create(&t167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0: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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 3 z$flush_delayed = weak$$choice2 [L797] 3 z$mem_tmp = z [L798] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L798] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L799] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L799] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L800] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L801] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L802] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L803] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L803] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L803] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L803] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L803] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L804] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L804] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] 3 __unbuffered_p2_EBX = z [L806] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L806] 3 z = z$flush_delayed ? z$mem_tmp : z [L807] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L810] 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) [L810] 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) [L811] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L812] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 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 [L813] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L814] 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 [L751] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L751] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L752] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L753] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L753] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L754] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L755] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L839] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L847] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 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: 7.4s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 43 SDtfs, 45 SDslu, 42 SDs, 0 SdLazy, 281 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=10, 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.7s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 14037 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...