/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 02:21:17,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 02:21:17,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 02:21:17,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 02:21:17,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 02:21:17,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 02:21:17,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 02:21:17,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 02:21:17,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 02:21:17,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 02:21:17,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 02:21:17,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 02:21:17,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 02:21:17,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 02:21:17,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 02:21:17,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 02:21:17,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 02:21:17,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 02:21:17,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 02:21:17,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 02:21:17,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 02:21:17,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 02:21:17,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 02:21:17,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 02:21:17,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 02:21:17,469 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 02:21:17,470 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 02:21:17,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 02:21:17,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 02:21:17,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 02:21:17,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 02:21:17,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 02:21:17,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 02:21:17,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 02:21:17,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 02:21:17,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 02:21:17,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 02:21:17,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 02:21:17,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 02:21:17,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 02:21:17,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 02:21:17,478 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-NoLbe.epf [2021-03-11 02:21:17,498 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 02:21:17,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 02:21:17,499 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 02:21:17,499 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 02:21:17,499 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 02:21:17,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 02:21:17,500 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 02:21:17,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 02:21:17,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 02:21:17,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 02:21:17,500 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 02:21:17,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 02:21:17,501 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 02:21:17,501 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 02:21:17,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 02:21:17,501 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 02:21:17,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 02:21:17,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 02:21:17,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 02:21:17,502 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 02:21:17,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 02:21:17,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 02:21:17,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 02:21:17,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 02:21:17,503 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 02:21:17,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 02:21:17,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 02:21:17,503 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-03-11 02:21:17,503 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 02:21:17,503 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 02:21:17,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 02:21:17,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 02:21:17,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 02:21:17,824 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 02:21:17,825 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 02:21:17,825 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2021-03-11 02:21:17,884 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9639e5c85/0f2f5c5c4367408cb0661195a77ee5e5/FLAGedf3a8a96 [2021-03-11 02:21:18,368 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 02:21:18,369 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2021-03-11 02:21:18,381 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9639e5c85/0f2f5c5c4367408cb0661195a77ee5e5/FLAGedf3a8a96 [2021-03-11 02:21:18,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9639e5c85/0f2f5c5c4367408cb0661195a77ee5e5 [2021-03-11 02:21:18,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 02:21:18,874 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 02:21:18,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 02:21:18,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 02:21:18,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 02:21:18,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 02:21:18" (1/1) ... [2021-03-11 02:21:18,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a580b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:21:18, skipping insertion in model container [2021-03-11 02:21:18,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 02:21:18" (1/1) ... [2021-03-11 02:21:18,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 02:21:18,923 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 02:21:19,060 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i[949,962] [2021-03-11 02:21:19,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 02:21:19,232 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 02:21:19,241 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i[949,962] [2021-03-11 02:21:19,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 02:21:19,368 INFO L208 MainTranslator]: Completed translation [2021-03-11 02:21:19,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:21:19 WrapperNode [2021-03-11 02:21:19,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 02:21:19,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 02:21:19,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 02:21:19,371 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 02:21:19,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:21:19" (1/1) ... [2021-03-11 02:21:19,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:21:19" (1/1) ... [2021-03-11 02:21:19,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 02:21:19,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 02:21:19,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 02:21:19,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 02:21:19,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:21:19" (1/1) ... [2021-03-11 02:21:19,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:21:19" (1/1) ... [2021-03-11 02:21:19,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:21:19" (1/1) ... [2021-03-11 02:21:19,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:21:19" (1/1) ... [2021-03-11 02:21:19,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:21:19" (1/1) ... [2021-03-11 02:21:19,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:21:19" (1/1) ... [2021-03-11 02:21:19,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:21:19" (1/1) ... [2021-03-11 02:21:19,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 02:21:19,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 02:21:19,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 02:21:19,492 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 02:21:19,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:21:19" (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 [2021-03-11 02:21:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 02:21:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 02:21:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 02:21:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 02:21:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 02:21:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 02:21:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 02:21:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 02:21:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 02:21:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 02:21:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 02:21:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 02:21:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 02:21:19,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 02:21:19,559 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 02:21:21,314 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 02:21:21,315 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 02:21:21,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 02:21:21 BoogieIcfgContainer [2021-03-11 02:21:21,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 02:21:21,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 02:21:21,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 02:21:21,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 02:21:21,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 02:21:18" (1/3) ... [2021-03-11 02:21:21,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a5ac06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 02:21:21, skipping insertion in model container [2021-03-11 02:21:21,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:21:19" (2/3) ... [2021-03-11 02:21:21,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a5ac06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 02:21:21, skipping insertion in model container [2021-03-11 02:21:21,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 02:21:21" (3/3) ... [2021-03-11 02:21:21,324 INFO L111 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2021-03-11 02:21:21,329 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 02:21:21,332 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 02:21:21,333 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 02:21:21,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,363 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,363 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,364 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,364 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,368 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,368 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,369 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,369 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,369 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,370 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,370 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,371 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,375 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,375 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,376 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,376 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,381 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,382 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,383 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,384 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,385 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,393 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,393 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:21:21,395 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 02:21:21,410 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 02:21:21,435 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 02:21:21,435 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 02:21:21,435 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 02:21:21,435 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 02:21:21,435 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 02:21:21,435 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 02:21:21,435 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 02:21:21,435 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 02:21:21,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 219 flow [2021-03-11 02:21:21,474 INFO L129 PetriNetUnfolder]: 2/99 cut-off events. [2021-03-11 02:21:21,475 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:21:21,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 2/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-03-11 02:21:21,478 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 102 transitions, 219 flow [2021-03-11 02:21:21,482 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 99 transitions, 207 flow [2021-03-11 02:21:21,490 INFO L129 PetriNetUnfolder]: 0/53 cut-off events. [2021-03-11 02:21:21,490 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:21:21,491 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:21:21,491 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:21:21,491 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:21:21,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:21:21,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1549699591, now seen corresponding path program 1 times [2021-03-11 02:21:21,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:21:21,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866976567] [2021-03-11 02:21:21,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:21:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:21:21,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:21,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:21,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:21,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:21:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:21:21,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866976567] [2021-03-11 02:21:21,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:21:21,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 02:21:21,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12604297] [2021-03-11 02:21:21,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 02:21:21,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:21:21,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 02:21:21,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 02:21:21,776 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 102 [2021-03-11 02:21:21,780 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 99 transitions, 207 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:21,780 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:21:21,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 102 [2021-03-11 02:21:21,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:21:21,927 INFO L129 PetriNetUnfolder]: 49/384 cut-off events. [2021-03-11 02:21:21,927 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:21:21,935 INFO L84 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 384 events. 49/384 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1975 event pairs, 27 based on Foata normal form. 19/380 useless extension candidates. Maximal degree in co-relation 432. Up to 65 conditions per place. [2021-03-11 02:21:21,938 INFO L132 encePairwiseOnDemand]: 97/102 looper letters, 9 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2021-03-11 02:21:21,938 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 99 transitions, 229 flow [2021-03-11 02:21:21,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 02:21:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 02:21:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2021-03-11 02:21:21,954 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2021-03-11 02:21:21,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 289 transitions. [2021-03-11 02:21:21,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 289 transitions. [2021-03-11 02:21:21,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:21:21,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 289 transitions. [2021-03-11 02:21:21,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:21,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:21,970 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:21,971 INFO L185 Difference]: Start difference. First operand has 107 places, 99 transitions, 207 flow. Second operand 3 states and 289 transitions. [2021-03-11 02:21:21,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 99 transitions, 229 flow [2021-03-11 02:21:21,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 99 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-11 02:21:21,977 INFO L241 Difference]: Finished difference. Result has 104 places, 95 transitions, 200 flow [2021-03-11 02:21:21,978 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=104, PETRI_TRANSITIONS=95} [2021-03-11 02:21:21,979 INFO L335 CegarLoopForPetriNet]: 107 programPoint places, -3 predicate places. [2021-03-11 02:21:21,979 INFO L480 AbstractCegarLoop]: Abstraction has has 104 places, 95 transitions, 200 flow [2021-03-11 02:21:21,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:21,979 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:21:21,980 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:21:21,980 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 02:21:21,980 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:21:21,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:21:21,980 INFO L82 PathProgramCache]: Analyzing trace with hash -66595132, now seen corresponding path program 1 times [2021-03-11 02:21:21,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:21:21,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078760762] [2021-03-11 02:21:21,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:21:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:21:22,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:22,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:22,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:22,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:21:22,163 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:21:22,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:21:22,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:22,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:21:22,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:22,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:21:22,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:22,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:22,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:21:22,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078760762] [2021-03-11 02:21:22,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:21:22,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 02:21:22,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775033410] [2021-03-11 02:21:22,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 02:21:22,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:21:22,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 02:21:22,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 02:21:22,195 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 102 [2021-03-11 02:21:22,196 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 95 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:22,196 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:21:22,196 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 102 [2021-03-11 02:21:22,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:21:22,295 INFO L129 PetriNetUnfolder]: 4/132 cut-off events. [2021-03-11 02:21:22,296 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:21:22,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 132 events. 4/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 209 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2021-03-11 02:21:22,297 INFO L132 encePairwiseOnDemand]: 96/102 looper letters, 6 selfloop transitions, 2 changer transitions 23/107 dead transitions. [2021-03-11 02:21:22,297 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 107 transitions, 266 flow [2021-03-11 02:21:22,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 02:21:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 02:21:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 833 transitions. [2021-03-11 02:21:22,300 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9074074074074074 [2021-03-11 02:21:22,300 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 833 transitions. [2021-03-11 02:21:22,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 833 transitions. [2021-03-11 02:21:22,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:21:22,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 833 transitions. [2021-03-11 02:21:22,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.55555555555556) internal successors, (833), 9 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:22,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 102.0) internal successors, (1020), 10 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:22,307 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 102.0) internal successors, (1020), 10 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:22,307 INFO L185 Difference]: Start difference. First operand has 104 places, 95 transitions, 200 flow. Second operand 9 states and 833 transitions. [2021-03-11 02:21:22,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 107 transitions, 266 flow [2021-03-11 02:21:22,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 107 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 02:21:22,310 INFO L241 Difference]: Finished difference. Result has 117 places, 84 transitions, 194 flow [2021-03-11 02:21:22,310 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=194, PETRI_PLACES=117, PETRI_TRANSITIONS=84} [2021-03-11 02:21:22,310 INFO L335 CegarLoopForPetriNet]: 107 programPoint places, 10 predicate places. [2021-03-11 02:21:22,311 INFO L480 AbstractCegarLoop]: Abstraction has has 117 places, 84 transitions, 194 flow [2021-03-11 02:21:22,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:22,311 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:21:22,311 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:21:22,311 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 02:21:22,311 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:21:22,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:21:22,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1076159554, now seen corresponding path program 1 times [2021-03-11 02:21:22,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:21:22,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664833964] [2021-03-11 02:21:22,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:21:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:21:22,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:22,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:22,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:22,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:21:22,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:22,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:21:22,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:22,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 02:21:22,521 INFO L142 QuantifierPusher]: treesize reduction 17, result has 70.2 percent of original size [2021-03-11 02:21:22,523 INFO L147 QuantifierPusher]: treesize reduction 9, result has 77.5 percent of original size 31 [2021-03-11 02:21:22,550 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:21:22,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:21:22,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:22,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:21:22,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:22,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:21:22,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:22,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:22,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:21:22,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664833964] [2021-03-11 02:21:22,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:21:22,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-11 02:21:22,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275920912] [2021-03-11 02:21:22,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 02:21:22,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:21:22,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 02:21:22,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-03-11 02:21:22,597 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 102 [2021-03-11 02:21:22,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 84 transitions, 194 flow. Second operand has 9 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:22,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:21:22,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 102 [2021-03-11 02:21:22,598 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:21:23,015 INFO L129 PetriNetUnfolder]: 319/748 cut-off events. [2021-03-11 02:21:23,015 INFO L130 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2021-03-11 02:21:23,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 748 events. 319/748 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4183 event pairs, 81 based on Foata normal form. 19/752 useless extension candidates. Maximal degree in co-relation 1419. Up to 308 conditions per place. [2021-03-11 02:21:23,023 INFO L132 encePairwiseOnDemand]: 90/102 looper letters, 14 selfloop transitions, 10 changer transitions 43/136 dead transitions. [2021-03-11 02:21:23,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 136 transitions, 460 flow [2021-03-11 02:21:23,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-11 02:21:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-03-11 02:21:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1218 transitions. [2021-03-11 02:21:23,028 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8529411764705882 [2021-03-11 02:21:23,028 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1218 transitions. [2021-03-11 02:21:23,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1218 transitions. [2021-03-11 02:21:23,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:21:23,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1218 transitions. [2021-03-11 02:21:23,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 87.0) internal successors, (1218), 14 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:23,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 102.0) internal successors, (1530), 15 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:23,035 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 102.0) internal successors, (1530), 15 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:23,035 INFO L185 Difference]: Start difference. First operand has 117 places, 84 transitions, 194 flow. Second operand 14 states and 1218 transitions. [2021-03-11 02:21:23,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 136 transitions, 460 flow [2021-03-11 02:21:23,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 136 transitions, 420 flow, removed 18 selfloop flow, removed 8 redundant places. [2021-03-11 02:21:23,046 INFO L241 Difference]: Finished difference. Result has 116 places, 91 transitions, 275 flow [2021-03-11 02:21:23,046 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=275, PETRI_PLACES=116, PETRI_TRANSITIONS=91} [2021-03-11 02:21:23,046 INFO L335 CegarLoopForPetriNet]: 107 programPoint places, 9 predicate places. [2021-03-11 02:21:23,046 INFO L480 AbstractCegarLoop]: Abstraction has has 116 places, 91 transitions, 275 flow [2021-03-11 02:21:23,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:23,047 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:21:23,047 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:21:23,047 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 02:21:23,047 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:21:23,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:21:23,047 INFO L82 PathProgramCache]: Analyzing trace with hash -640347104, now seen corresponding path program 1 times [2021-03-11 02:21:23,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:21:23,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434878733] [2021-03-11 02:21:23,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:21:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:21:23,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:23,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:23,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:23,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:21:23,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:23,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:21:23,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:23,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 02:21:23,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:23,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 02:21:23,252 INFO L142 QuantifierPusher]: treesize reduction 100, result has 35.9 percent of original size [2021-03-11 02:21:23,258 INFO L147 QuantifierPusher]: treesize reduction 14, result has 75.0 percent of original size 42 [2021-03-11 02:21:23,291 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:21:23,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:21:23,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:23,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:21:23,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:23,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:21:23,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:23,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:21:23,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434878733] [2021-03-11 02:21:23,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:21:23,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-11 02:21:23,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861436696] [2021-03-11 02:21:23,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-11 02:21:23,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:21:23,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-11 02:21:23,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-11 02:21:23,333 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 102 [2021-03-11 02:21:23,334 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 91 transitions, 275 flow. Second operand has 10 states, 10 states have (on average 82.2) internal successors, (822), 10 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:23,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:21:23,337 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 102 [2021-03-11 02:21:23,337 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:21:23,687 INFO L129 PetriNetUnfolder]: 264/613 cut-off events. [2021-03-11 02:21:23,688 INFO L130 PetriNetUnfolder]: For 1678/1773 co-relation queries the response was YES. [2021-03-11 02:21:23,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2140 conditions, 613 events. 264/613 cut-off events. For 1678/1773 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3168 event pairs, 137 based on Foata normal form. 20/618 useless extension candidates. Maximal degree in co-relation 2074. Up to 313 conditions per place. [2021-03-11 02:21:23,695 INFO L132 encePairwiseOnDemand]: 90/102 looper letters, 21 selfloop transitions, 13 changer transitions 28/130 dead transitions. [2021-03-11 02:21:23,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 130 transitions, 662 flow [2021-03-11 02:21:23,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-11 02:21:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-11 02:21:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1026 transitions. [2021-03-11 02:21:23,698 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8382352941176471 [2021-03-11 02:21:23,698 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1026 transitions. [2021-03-11 02:21:23,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1026 transitions. [2021-03-11 02:21:23,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:21:23,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1026 transitions. [2021-03-11 02:21:23,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 85.5) internal successors, (1026), 12 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:23,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 102.0) internal successors, (1326), 13 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:23,703 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 102.0) internal successors, (1326), 13 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:23,703 INFO L185 Difference]: Start difference. First operand has 116 places, 91 transitions, 275 flow. Second operand 12 states and 1026 transitions. [2021-03-11 02:21:23,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 130 transitions, 662 flow [2021-03-11 02:21:23,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 130 transitions, 646 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-03-11 02:21:23,710 INFO L241 Difference]: Finished difference. Result has 122 places, 101 transitions, 413 flow [2021-03-11 02:21:23,711 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=413, PETRI_PLACES=122, PETRI_TRANSITIONS=101} [2021-03-11 02:21:23,711 INFO L335 CegarLoopForPetriNet]: 107 programPoint places, 15 predicate places. [2021-03-11 02:21:23,711 INFO L480 AbstractCegarLoop]: Abstraction has has 122 places, 101 transitions, 413 flow [2021-03-11 02:21:23,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 82.2) internal successors, (822), 10 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:23,713 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:21:23,713 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:21:23,713 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 02:21:23,713 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:21:23,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:21:23,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2016399524, now seen corresponding path program 2 times [2021-03-11 02:21:23,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:21:23,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239591831] [2021-03-11 02:21:23,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:21:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:21:23,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:23,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:23,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:23,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:21:23,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:23,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:21:23,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:23,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 02:21:23,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:23,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 02:21:23,859 INFO L142 QuantifierPusher]: treesize reduction 17, result has 71.7 percent of original size [2021-03-11 02:21:23,860 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.1 percent of original size 34 [2021-03-11 02:21:23,886 INFO L142 QuantifierPusher]: treesize reduction 17, result has 71.7 percent of original size [2021-03-11 02:21:23,892 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.1 percent of original size 34 [2021-03-11 02:21:23,918 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:21:23,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:21:23,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:23,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:21:23,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:23,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:21:23,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:23,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:21:23,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239591831] [2021-03-11 02:21:23,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:21:23,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-11 02:21:23,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488941925] [2021-03-11 02:21:23,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-11 02:21:23,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:21:23,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-11 02:21:23,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-03-11 02:21:23,961 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 102 [2021-03-11 02:21:23,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 101 transitions, 413 flow. Second operand has 11 states, 11 states have (on average 81.18181818181819) internal successors, (893), 11 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:23,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:21:23,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 102 [2021-03-11 02:21:23,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:21:24,389 INFO L129 PetriNetUnfolder]: 258/597 cut-off events. [2021-03-11 02:21:24,389 INFO L130 PetriNetUnfolder]: For 3934/4196 co-relation queries the response was YES. [2021-03-11 02:21:24,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2738 conditions, 597 events. 258/597 cut-off events. For 3934/4196 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3026 event pairs, 135 based on Foata normal form. 34/617 useless extension candidates. Maximal degree in co-relation 2663. Up to 286 conditions per place. [2021-03-11 02:21:24,396 INFO L132 encePairwiseOnDemand]: 89/102 looper letters, 17 selfloop transitions, 20 changer transitions 29/133 dead transitions. [2021-03-11 02:21:24,396 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 133 transitions, 905 flow [2021-03-11 02:21:24,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-11 02:21:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-03-11 02:21:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1175 transitions. [2021-03-11 02:21:24,400 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.822829131652661 [2021-03-11 02:21:24,400 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1175 transitions. [2021-03-11 02:21:24,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1175 transitions. [2021-03-11 02:21:24,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:21:24,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1175 transitions. [2021-03-11 02:21:24,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 83.92857142857143) internal successors, (1175), 14 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:24,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 102.0) internal successors, (1530), 15 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:24,406 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 102.0) internal successors, (1530), 15 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:24,406 INFO L185 Difference]: Start difference. First operand has 122 places, 101 transitions, 413 flow. Second operand 14 states and 1175 transitions. [2021-03-11 02:21:24,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 133 transitions, 905 flow [2021-03-11 02:21:24,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 133 transitions, 869 flow, removed 16 selfloop flow, removed 5 redundant places. [2021-03-11 02:21:24,415 INFO L241 Difference]: Finished difference. Result has 131 places, 102 transitions, 497 flow [2021-03-11 02:21:24,416 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=497, PETRI_PLACES=131, PETRI_TRANSITIONS=102} [2021-03-11 02:21:24,416 INFO L335 CegarLoopForPetriNet]: 107 programPoint places, 24 predicate places. [2021-03-11 02:21:24,416 INFO L480 AbstractCegarLoop]: Abstraction has has 131 places, 102 transitions, 497 flow [2021-03-11 02:21:24,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 81.18181818181819) internal successors, (893), 11 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:24,417 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:21:24,417 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:21:24,418 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 02:21:24,418 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:21:24,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:21:24,418 INFO L82 PathProgramCache]: Analyzing trace with hash -229814625, now seen corresponding path program 1 times [2021-03-11 02:21:24,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:21:24,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513595968] [2021-03-11 02:21:24,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:21:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:21:24,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:24,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:24,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:24,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:21:24,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:24,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:21:24,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:24,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 02:21:24,556 INFO L142 QuantifierPusher]: treesize reduction 17, result has 71.7 percent of original size [2021-03-11 02:21:24,557 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.1 percent of original size 34 [2021-03-11 02:21:24,581 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:21:24,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:21:24,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:24,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:21:24,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:24,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:21:24,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:24,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:24,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:21:24,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513595968] [2021-03-11 02:21:24,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:21:24,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-11 02:21:24,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499783756] [2021-03-11 02:21:24,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 02:21:24,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:21:24,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 02:21:24,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-11 02:21:24,622 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 102 [2021-03-11 02:21:24,623 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 102 transitions, 497 flow. Second operand has 9 states, 9 states have (on average 84.22222222222223) internal successors, (758), 9 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:24,623 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:21:24,623 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 102 [2021-03-11 02:21:24,623 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:21:25,030 INFO L129 PetriNetUnfolder]: 280/699 cut-off events. [2021-03-11 02:21:25,030 INFO L130 PetriNetUnfolder]: For 6864/7256 co-relation queries the response was YES. [2021-03-11 02:21:25,034 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3533 conditions, 699 events. 280/699 cut-off events. For 6864/7256 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3826 event pairs, 66 based on Foata normal form. 27/713 useless extension candidates. Maximal degree in co-relation 3452. Up to 257 conditions per place. [2021-03-11 02:21:25,038 INFO L132 encePairwiseOnDemand]: 92/102 looper letters, 30 selfloop transitions, 12 changer transitions 31/142 dead transitions. [2021-03-11 02:21:25,038 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 142 transitions, 1143 flow [2021-03-11 02:21:25,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 02:21:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-11 02:21:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 970 transitions. [2021-03-11 02:21:25,041 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8645276292335116 [2021-03-11 02:21:25,041 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 970 transitions. [2021-03-11 02:21:25,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 970 transitions. [2021-03-11 02:21:25,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:21:25,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 970 transitions. [2021-03-11 02:21:25,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 88.18181818181819) internal successors, (970), 11 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:25,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 102.0) internal successors, (1224), 12 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:25,047 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 102.0) internal successors, (1224), 12 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:25,047 INFO L185 Difference]: Start difference. First operand has 131 places, 102 transitions, 497 flow. Second operand 11 states and 970 transitions. [2021-03-11 02:21:25,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 142 transitions, 1143 flow [2021-03-11 02:21:25,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 142 transitions, 1056 flow, removed 30 selfloop flow, removed 9 redundant places. [2021-03-11 02:21:25,059 INFO L241 Difference]: Finished difference. Result has 133 places, 105 transitions, 556 flow [2021-03-11 02:21:25,059 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=556, PETRI_PLACES=133, PETRI_TRANSITIONS=105} [2021-03-11 02:21:25,059 INFO L335 CegarLoopForPetriNet]: 107 programPoint places, 26 predicate places. [2021-03-11 02:21:25,059 INFO L480 AbstractCegarLoop]: Abstraction has has 133 places, 105 transitions, 556 flow [2021-03-11 02:21:25,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 84.22222222222223) internal successors, (758), 9 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:25,060 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:21:25,060 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:21:25,060 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 02:21:25,060 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:21:25,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:21:25,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1192009010, now seen corresponding path program 1 times [2021-03-11 02:21:25,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:21:25,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655037653] [2021-03-11 02:21:25,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:21:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:21:25,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:25,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:25,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:25,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:21:25,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:25,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:21:25,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:25,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 02:21:25,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:25,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 02:21:25,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:25,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 02:21:25,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:25,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:21:25,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:25,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 02:21:25,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:25,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:21:25,262 INFO L142 QuantifierPusher]: treesize reduction 17, result has 72.1 percent of original size [2021-03-11 02:21:25,263 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.5 percent of original size 35 [2021-03-11 02:21:25,292 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:21:25,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:21:25,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:25,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:21:25,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:25,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:21:25,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:25,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:21:25,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655037653] [2021-03-11 02:21:25,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:21:25,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-03-11 02:21:25,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635682575] [2021-03-11 02:21:25,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-11 02:21:25,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:21:25,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-11 02:21:25,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-03-11 02:21:25,337 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 102 [2021-03-11 02:21:25,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 105 transitions, 556 flow. Second operand has 14 states, 14 states have (on average 79.14285714285714) internal successors, (1108), 14 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:25,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:21:25,339 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 102 [2021-03-11 02:21:25,339 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:21:26,049 INFO L129 PetriNetUnfolder]: 216/564 cut-off events. [2021-03-11 02:21:26,049 INFO L130 PetriNetUnfolder]: For 9703/10275 co-relation queries the response was YES. [2021-03-11 02:21:26,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3526 conditions, 564 events. 216/564 cut-off events. For 9703/10275 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2795 event pairs, 53 based on Foata normal form. 31/584 useless extension candidates. Maximal degree in co-relation 3440. Up to 252 conditions per place. [2021-03-11 02:21:26,056 INFO L132 encePairwiseOnDemand]: 88/102 looper letters, 37 selfloop transitions, 15 changer transitions 35/152 dead transitions. [2021-03-11 02:21:26,056 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 152 transitions, 1462 flow [2021-03-11 02:21:26,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-11 02:21:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-03-11 02:21:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1550 transitions. [2021-03-11 02:21:26,061 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7997936016511867 [2021-03-11 02:21:26,061 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1550 transitions. [2021-03-11 02:21:26,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1550 transitions. [2021-03-11 02:21:26,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:21:26,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1550 transitions. [2021-03-11 02:21:26,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 81.57894736842105) internal successors, (1550), 19 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:26,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 102.0) internal successors, (2040), 20 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:26,069 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 102.0) internal successors, (2040), 20 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:26,069 INFO L185 Difference]: Start difference. First operand has 133 places, 105 transitions, 556 flow. Second operand 19 states and 1550 transitions. [2021-03-11 02:21:26,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 152 transitions, 1462 flow [2021-03-11 02:21:26,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 152 transitions, 1204 flow, removed 120 selfloop flow, removed 12 redundant places. [2021-03-11 02:21:26,080 INFO L241 Difference]: Finished difference. Result has 144 places, 109 transitions, 596 flow [2021-03-11 02:21:26,080 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=596, PETRI_PLACES=144, PETRI_TRANSITIONS=109} [2021-03-11 02:21:26,080 INFO L335 CegarLoopForPetriNet]: 107 programPoint places, 37 predicate places. [2021-03-11 02:21:26,080 INFO L480 AbstractCegarLoop]: Abstraction has has 144 places, 109 transitions, 596 flow [2021-03-11 02:21:26,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 79.14285714285714) internal successors, (1108), 14 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:26,081 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:21:26,081 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:21:26,081 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 02:21:26,082 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:21:26,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:21:26,083 INFO L82 PathProgramCache]: Analyzing trace with hash 395251779, now seen corresponding path program 1 times [2021-03-11 02:21:26,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:21:26,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934130409] [2021-03-11 02:21:26,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:21:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:21:26,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:26,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:26,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:26,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:21:26,152 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-03-11 02:21:26,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:21:26,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:26,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:21:26,175 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 02:21:26,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:21:26,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:26,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:26,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:21:26,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934130409] [2021-03-11 02:21:26,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:21:26,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 02:21:26,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082771931] [2021-03-11 02:21:26,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 02:21:26,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:21:26,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 02:21:26,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 02:21:26,190 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 102 [2021-03-11 02:21:26,191 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 109 transitions, 596 flow. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:26,191 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:21:26,191 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 102 [2021-03-11 02:21:26,191 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:21:26,412 INFO L129 PetriNetUnfolder]: 360/1091 cut-off events. [2021-03-11 02:21:26,412 INFO L130 PetriNetUnfolder]: For 5926/6200 co-relation queries the response was YES. [2021-03-11 02:21:26,420 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3597 conditions, 1091 events. 360/1091 cut-off events. For 5926/6200 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8196 event pairs, 110 based on Foata normal form. 27/1050 useless extension candidates. Maximal degree in co-relation 3511. Up to 221 conditions per place. [2021-03-11 02:21:26,427 INFO L132 encePairwiseOnDemand]: 93/102 looper letters, 19 selfloop transitions, 16 changer transitions 0/129 dead transitions. [2021-03-11 02:21:26,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 129 transitions, 671 flow [2021-03-11 02:21:26,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 02:21:26,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 02:21:26,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 829 transitions. [2021-03-11 02:21:26,429 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9030501089324618 [2021-03-11 02:21:26,429 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 829 transitions. [2021-03-11 02:21:26,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 829 transitions. [2021-03-11 02:21:26,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:21:26,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 829 transitions. [2021-03-11 02:21:26,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.11111111111111) internal successors, (829), 9 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:26,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 102.0) internal successors, (1020), 10 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:26,434 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 102.0) internal successors, (1020), 10 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:26,434 INFO L185 Difference]: Start difference. First operand has 144 places, 109 transitions, 596 flow. Second operand 9 states and 829 transitions. [2021-03-11 02:21:26,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 129 transitions, 671 flow [2021-03-11 02:21:26,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 129 transitions, 581 flow, removed 35 selfloop flow, removed 19 redundant places. [2021-03-11 02:21:26,445 INFO L241 Difference]: Finished difference. Result has 129 places, 118 transitions, 572 flow [2021-03-11 02:21:26,445 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=572, PETRI_PLACES=129, PETRI_TRANSITIONS=118} [2021-03-11 02:21:26,445 INFO L335 CegarLoopForPetriNet]: 107 programPoint places, 22 predicate places. [2021-03-11 02:21:26,445 INFO L480 AbstractCegarLoop]: Abstraction has has 129 places, 118 transitions, 572 flow [2021-03-11 02:21:26,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:26,446 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:21:26,446 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:21:26,446 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 02:21:26,446 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:21:26,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:21:26,446 INFO L82 PathProgramCache]: Analyzing trace with hash -291433147, now seen corresponding path program 1 times [2021-03-11 02:21:26,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:21:26,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180108668] [2021-03-11 02:21:26,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:21:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:21:26,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:26,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:26,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:26,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:21:26,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:26,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:21:26,506 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:21:26,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:21:26,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:26,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:21:26,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:26,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:21:26,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:26,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:21:26,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180108668] [2021-03-11 02:21:26,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:21:26,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 02:21:26,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490102514] [2021-03-11 02:21:26,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 02:21:26,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:21:26,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 02:21:26,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-03-11 02:21:26,564 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 102 [2021-03-11 02:21:26,565 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 118 transitions, 572 flow. Second operand has 7 states, 7 states have (on average 89.42857142857143) internal successors, (626), 7 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:26,565 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:21:26,565 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 102 [2021-03-11 02:21:26,565 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:21:26,898 INFO L129 PetriNetUnfolder]: 447/1659 cut-off events. [2021-03-11 02:21:26,899 INFO L130 PetriNetUnfolder]: For 7786/8024 co-relation queries the response was YES. [2021-03-11 02:21:26,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6168 conditions, 1659 events. 447/1659 cut-off events. For 7786/8024 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14626 event pairs, 161 based on Foata normal form. 50/1641 useless extension candidates. Maximal degree in co-relation 6092. Up to 314 conditions per place. [2021-03-11 02:21:26,919 INFO L132 encePairwiseOnDemand]: 96/102 looper letters, 14 selfloop transitions, 5 changer transitions 0/127 dead transitions. [2021-03-11 02:21:26,919 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 127 transitions, 662 flow [2021-03-11 02:21:26,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 02:21:26,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 02:21:26,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 636 transitions. [2021-03-11 02:21:26,921 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8907563025210085 [2021-03-11 02:21:26,922 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 636 transitions. [2021-03-11 02:21:26,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 636 transitions. [2021-03-11 02:21:26,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:21:26,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 636 transitions. [2021-03-11 02:21:26,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.85714285714286) internal successors, (636), 7 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:26,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:26,926 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:26,926 INFO L185 Difference]: Start difference. First operand has 129 places, 118 transitions, 572 flow. Second operand 7 states and 636 transitions. [2021-03-11 02:21:26,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 127 transitions, 662 flow [2021-03-11 02:21:26,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 127 transitions, 660 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 02:21:26,938 INFO L241 Difference]: Finished difference. Result has 139 places, 122 transitions, 629 flow [2021-03-11 02:21:26,938 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=629, PETRI_PLACES=139, PETRI_TRANSITIONS=122} [2021-03-11 02:21:26,939 INFO L335 CegarLoopForPetriNet]: 107 programPoint places, 32 predicate places. [2021-03-11 02:21:26,939 INFO L480 AbstractCegarLoop]: Abstraction has has 139 places, 122 transitions, 629 flow [2021-03-11 02:21:26,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 89.42857142857143) internal successors, (626), 7 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:26,939 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:21:26,939 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:21:26,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 02:21:26,939 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:21:26,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:21:26,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1837180739, now seen corresponding path program 2 times [2021-03-11 02:21:26,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:21:26,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652387934] [2021-03-11 02:21:26,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:21:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:21:27,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:27,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:27,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:27,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:21:27,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:27,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:21:27,020 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-03-11 02:21:27,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:21:27,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:27,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:21:27,043 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 02:21:27,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:21:27,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:27,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:21:27,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652387934] [2021-03-11 02:21:27,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:21:27,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 02:21:27,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544343472] [2021-03-11 02:21:27,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 02:21:27,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:21:27,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 02:21:27,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-11 02:21:27,055 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 102 [2021-03-11 02:21:27,056 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 122 transitions, 629 flow. Second operand has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:27,056 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:21:27,056 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 102 [2021-03-11 02:21:27,056 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:21:27,375 INFO L129 PetriNetUnfolder]: 425/1474 cut-off events. [2021-03-11 02:21:27,375 INFO L130 PetriNetUnfolder]: For 4282/5438 co-relation queries the response was YES. [2021-03-11 02:21:27,386 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4914 conditions, 1474 events. 425/1474 cut-off events. For 4282/5438 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 12901 event pairs, 28 based on Foata normal form. 309/1674 useless extension candidates. Maximal degree in co-relation 4834. Up to 387 conditions per place. [2021-03-11 02:21:27,392 INFO L132 encePairwiseOnDemand]: 93/102 looper letters, 15 selfloop transitions, 31 changer transitions 9/147 dead transitions. [2021-03-11 02:21:27,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 147 transitions, 891 flow [2021-03-11 02:21:27,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-11 02:21:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-11 02:21:27,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1106 transitions. [2021-03-11 02:21:27,397 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9035947712418301 [2021-03-11 02:21:27,397 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1106 transitions. [2021-03-11 02:21:27,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1106 transitions. [2021-03-11 02:21:27,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:21:27,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1106 transitions. [2021-03-11 02:21:27,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 92.16666666666667) internal successors, (1106), 12 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:27,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 102.0) internal successors, (1326), 13 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:27,403 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 102.0) internal successors, (1326), 13 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:27,403 INFO L185 Difference]: Start difference. First operand has 139 places, 122 transitions, 629 flow. Second operand 12 states and 1106 transitions. [2021-03-11 02:21:27,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 147 transitions, 891 flow [2021-03-11 02:21:27,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 147 transitions, 868 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-11 02:21:27,417 INFO L241 Difference]: Finished difference. Result has 150 places, 135 transitions, 777 flow [2021-03-11 02:21:27,417 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=777, PETRI_PLACES=150, PETRI_TRANSITIONS=135} [2021-03-11 02:21:27,417 INFO L335 CegarLoopForPetriNet]: 107 programPoint places, 43 predicate places. [2021-03-11 02:21:27,418 INFO L480 AbstractCegarLoop]: Abstraction has has 150 places, 135 transitions, 777 flow [2021-03-11 02:21:27,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:27,418 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:21:27,418 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:21:27,418 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 02:21:27,418 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:21:27,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:21:27,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1534909661, now seen corresponding path program 1 times [2021-03-11 02:21:27,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:21:27,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431559578] [2021-03-11 02:21:27,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:21:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:21:27,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:27,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:27,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:27,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:21:27,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:27,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:21:27,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:27,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:21:27,505 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-03-11 02:21:27,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:21:27,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:27,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:21:27,534 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 02:21:27,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:21:27,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:27,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:27,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:21:27,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431559578] [2021-03-11 02:21:27,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:21:27,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 02:21:27,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849367566] [2021-03-11 02:21:27,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 02:21:27,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:21:27,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 02:21:27,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-11 02:21:27,546 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 102 [2021-03-11 02:21:27,546 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 135 transitions, 777 flow. Second operand has 8 states, 8 states have (on average 89.125) internal successors, (713), 8 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:27,547 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:21:27,547 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 102 [2021-03-11 02:21:27,547 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:21:27,899 INFO L129 PetriNetUnfolder]: 342/1286 cut-off events. [2021-03-11 02:21:27,899 INFO L130 PetriNetUnfolder]: For 5842/8308 co-relation queries the response was YES. [2021-03-11 02:21:27,909 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4629 conditions, 1286 events. 342/1286 cut-off events. For 5842/8308 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 11601 event pairs, 2 based on Foata normal form. 377/1556 useless extension candidates. Maximal degree in co-relation 4591. Up to 342 conditions per place. [2021-03-11 02:21:27,915 INFO L132 encePairwiseOnDemand]: 93/102 looper letters, 10 selfloop transitions, 36 changer transitions 16/153 dead transitions. [2021-03-11 02:21:27,915 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 153 transitions, 1025 flow [2021-03-11 02:21:27,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-11 02:21:27,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-03-11 02:21:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1371 transitions. [2021-03-11 02:21:27,917 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8960784313725491 [2021-03-11 02:21:27,917 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1371 transitions. [2021-03-11 02:21:27,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1371 transitions. [2021-03-11 02:21:27,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:21:27,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1371 transitions. [2021-03-11 02:21:27,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 91.4) internal successors, (1371), 15 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:27,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 102.0) internal successors, (1632), 16 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:27,922 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 102.0) internal successors, (1632), 16 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:27,922 INFO L185 Difference]: Start difference. First operand has 150 places, 135 transitions, 777 flow. Second operand 15 states and 1371 transitions. [2021-03-11 02:21:27,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 153 transitions, 1025 flow [2021-03-11 02:21:27,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 153 transitions, 824 flow, removed 85 selfloop flow, removed 11 redundant places. [2021-03-11 02:21:27,955 INFO L241 Difference]: Finished difference. Result has 156 places, 134 transitions, 714 flow [2021-03-11 02:21:27,955 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=714, PETRI_PLACES=156, PETRI_TRANSITIONS=134} [2021-03-11 02:21:27,955 INFO L335 CegarLoopForPetriNet]: 107 programPoint places, 49 predicate places. [2021-03-11 02:21:27,955 INFO L480 AbstractCegarLoop]: Abstraction has has 156 places, 134 transitions, 714 flow [2021-03-11 02:21:27,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 89.125) internal successors, (713), 8 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:27,956 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:21:27,956 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:21:27,956 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 02:21:27,957 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:21:27,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:21:27,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1737464531, now seen corresponding path program 1 times [2021-03-11 02:21:27,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:21:27,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732131535] [2021-03-11 02:21:27,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:21:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:21:28,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:28,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:28,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:28,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:21:28,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:28,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:21:28,052 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:21:28,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:21:28,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:28,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:21:28,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:28,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:21:28,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:21:28,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:21:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:21:28,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732131535] [2021-03-11 02:21:28,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:21:28,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 02:21:28,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230446650] [2021-03-11 02:21:28,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 02:21:28,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:21:28,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 02:21:28,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-03-11 02:21:28,087 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 102 [2021-03-11 02:21:28,088 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 134 transitions, 714 flow. Second operand has 7 states, 7 states have (on average 89.42857142857143) internal successors, (626), 7 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:28,088 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:21:28,088 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 102 [2021-03-11 02:21:28,088 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:21:28,425 INFO L129 PetriNetUnfolder]: 480/2032 cut-off events. [2021-03-11 02:21:28,425 INFO L130 PetriNetUnfolder]: For 4800/4978 co-relation queries the response was YES. [2021-03-11 02:21:28,437 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5946 conditions, 2032 events. 480/2032 cut-off events. For 4800/4978 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 21470 event pairs, 4 based on Foata normal form. 4/1911 useless extension candidates. Maximal degree in co-relation 5862. Up to 278 conditions per place. [2021-03-11 02:21:28,440 INFO L132 encePairwiseOnDemand]: 96/102 looper letters, 9 selfloop transitions, 2 changer transitions 15/139 dead transitions. [2021-03-11 02:21:28,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 139 transitions, 756 flow [2021-03-11 02:21:28,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 02:21:28,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 02:21:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 632 transitions. [2021-03-11 02:21:28,442 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8851540616246498 [2021-03-11 02:21:28,442 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 632 transitions. [2021-03-11 02:21:28,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 632 transitions. [2021-03-11 02:21:28,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:21:28,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 632 transitions. [2021-03-11 02:21:28,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:28,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:28,447 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:28,447 INFO L185 Difference]: Start difference. First operand has 156 places, 134 transitions, 714 flow. Second operand 7 states and 632 transitions. [2021-03-11 02:21:28,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 139 transitions, 756 flow [2021-03-11 02:21:28,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 139 transitions, 663 flow, removed 22 selfloop flow, removed 17 redundant places. [2021-03-11 02:21:28,493 INFO L241 Difference]: Finished difference. Result has 148 places, 124 transitions, 559 flow [2021-03-11 02:21:28,493 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=559, PETRI_PLACES=148, PETRI_TRANSITIONS=124} [2021-03-11 02:21:28,493 INFO L335 CegarLoopForPetriNet]: 107 programPoint places, 41 predicate places. [2021-03-11 02:21:28,493 INFO L480 AbstractCegarLoop]: Abstraction has has 148 places, 124 transitions, 559 flow [2021-03-11 02:21:28,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 89.42857142857143) internal successors, (626), 7 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:21:28,493 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:21:28,494 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:21:28,495 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 02:21:28,495 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:21:28,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:21:28,496 INFO L82 PathProgramCache]: Analyzing trace with hash 335408305, now seen corresponding path program 2 times [2021-03-11 02:21:28,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:21:28,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171471609] [2021-03-11 02:21:28,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:21:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 02:21:28,536 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 02:21:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 02:21:28,579 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 02:21:28,623 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 02:21:28,624 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 02:21:28,624 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 02:21:28,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 02:21:28 BasicIcfg [2021-03-11 02:21:28,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 02:21:28,767 INFO L168 Benchmark]: Toolchain (without parser) took 9894.96 ms. Allocated memory was 337.6 MB in the beginning and 520.1 MB in the end (delta: 182.5 MB). Free memory was 300.3 MB in the beginning and 399.2 MB in the end (delta: -98.9 MB). Peak memory consumption was 85.5 MB. Max. memory is 16.0 GB. [2021-03-11 02:21:28,769 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 337.6 MB. Free memory was 318.8 MB in the beginning and 318.8 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 02:21:28,769 INFO L168 Benchmark]: CACSL2BoogieTranslator took 495.02 ms. Allocated memory is still 337.6 MB. Free memory was 299.6 MB in the beginning and 296.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.0 GB. [2021-03-11 02:21:28,769 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.91 ms. Allocated memory is still 337.6 MB. Free memory was 296.6 MB in the beginning and 293.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 02:21:28,769 INFO L168 Benchmark]: Boogie Preprocessor took 47.49 ms. Allocated memory is still 337.6 MB. Free memory was 293.5 MB in the beginning and 290.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 02:21:28,769 INFO L168 Benchmark]: RCFGBuilder took 1825.80 ms. Allocated memory is still 337.6 MB. Free memory was 290.3 MB in the beginning and 253.4 MB in the end (delta: 36.9 MB). Peak memory consumption was 168.0 MB. Max. memory is 16.0 GB. [2021-03-11 02:21:28,769 INFO L168 Benchmark]: TraceAbstraction took 7445.86 ms. Allocated memory was 337.6 MB in the beginning and 520.1 MB in the end (delta: 182.5 MB). Free memory was 252.4 MB in the beginning and 399.2 MB in the end (delta: -146.9 MB). Peak memory consumption was 34.5 MB. Max. memory is 16.0 GB. [2021-03-11 02:21:28,773 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 337.6 MB. Free memory was 318.8 MB in the beginning and 318.8 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 495.02 ms. Allocated memory is still 337.6 MB. Free memory was 299.6 MB in the beginning and 296.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 71.91 ms. Allocated memory is still 337.6 MB. Free memory was 296.6 MB in the beginning and 293.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 47.49 ms. Allocated memory is still 337.6 MB. Free memory was 293.5 MB in the beginning and 290.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1825.80 ms. Allocated memory is still 337.6 MB. Free memory was 290.3 MB in the beginning and 253.4 MB in the end (delta: 36.9 MB). Peak memory consumption was 168.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 7445.86 ms. Allocated memory was 337.6 MB in the beginning and 520.1 MB in the end (delta: 182.5 MB). Free memory was 252.4 MB in the beginning and 399.2 MB in the end (delta: -146.9 MB). Peak memory consumption was 34.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L723] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L724] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L725] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L726] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L727] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L728] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L729] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L730] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L731] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L732] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L733] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L734] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L735] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L736] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L737] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L739] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L741] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L743] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] 0 pthread_t t1019; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] 0 pthread_t t1020; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] 0 pthread_t t1021; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L753] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L841] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L841] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L845] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L853] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L853] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L854] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L854] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L855] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L855] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L856] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L856] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L857] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L857] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L858] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L858] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 101 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 8.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 7192.4ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 4608.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 46.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 118 SDtfs, 390 SDslu, 376 SDs, 0 SdLazy, 820 SolverSat, 236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 872.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1953.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=777occurred in iteration=10, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 51.0ms SsaConstructionTime, 535.0ms SatisfiabilityAnalysisTime, 1648.0ms InterpolantComputationTime, 881 NumberOfCodeBlocks, 881 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 791 ConstructedInterpolants, 0 QuantifiedInterpolants, 3986 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...