/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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:07:35,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:07:36,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 12:07:36,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:07:36,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:07:36,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:07:36,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:07:36,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:07:36,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:07:36,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:07:36,095 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:07:36,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:07:36,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:07:36,096 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:07:36,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:07:36,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:07:36,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:07:36,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:07:36,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:07:36,105 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:07:36,105 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:07:36,106 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:07:36,106 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:07:36,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:07:36,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:07:36,107 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:07:36,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:07:36,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:07:36,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:07:36,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:07:36,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:07:36,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:07:36,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:07:36,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:07:36,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:07:36,109 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 12:07:36,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:07:36,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:07:36,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:07:36,581 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:07:36,581 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:07:36,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 12:07:38,153 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:07:38,587 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:07:38,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 12:07:38,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a8503dbc/ea889ed3d2194ea6aae31b60b059179e/FLAGbf4fbd231 [2023-08-26 12:07:38,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a8503dbc/ea889ed3d2194ea6aae31b60b059179e [2023-08-26 12:07:38,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:07:38,651 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:07:38,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:07:38,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:07:38,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:07:38,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:07:38" (1/1) ... [2023-08-26 12:07:38,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51444f98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:38, skipping insertion in model container [2023-08-26 12:07:38,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:07:38" (1/1) ... [2023-08-26 12:07:38,724 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:07:39,151 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:07:39,164 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:07:39,194 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:07:39,196 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:07:39,244 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:07:39,290 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:07:39,290 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:07:39,296 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:07:39,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:39 WrapperNode [2023-08-26 12:07:39,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:07:39,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:07:39,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:07:39,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:07:39,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:39" (1/1) ... [2023-08-26 12:07:39,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:39" (1/1) ... [2023-08-26 12:07:39,382 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-08-26 12:07:39,383 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:07:39,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:07:39,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:07:39,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:07:39,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:39" (1/1) ... [2023-08-26 12:07:39,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:39" (1/1) ... [2023-08-26 12:07:39,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:39" (1/1) ... [2023-08-26 12:07:39,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:39" (1/1) ... [2023-08-26 12:07:39,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:39" (1/1) ... [2023-08-26 12:07:39,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:39" (1/1) ... [2023-08-26 12:07:39,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:39" (1/1) ... [2023-08-26 12:07:39,421 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:39" (1/1) ... [2023-08-26 12:07:39,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:07:39,425 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:07:39,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:07:39,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:07:39,426 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:39" (1/1) ... [2023-08-26 12:07:39,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:07:39,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:07:39,481 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 12:07:39,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 12:07:39,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:07:39,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:07:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:07:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:07:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:07:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:07:39,626 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:07:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:07:39,626 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:07:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:07:39,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:07:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 12:07:39,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 12:07:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:07:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:07:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:07:39,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:07:39,631 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 12:07:39,824 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:07:39,826 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:07:40,220 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:07:40,382 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:07:40,383 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:07:40,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:07:40 BoogieIcfgContainer [2023-08-26 12:07:40,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:07:40,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:07:40,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:07:40,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:07:40,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:07:38" (1/3) ... [2023-08-26 12:07:40,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd8e05f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:07:40, skipping insertion in model container [2023-08-26 12:07:40,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:39" (2/3) ... [2023-08-26 12:07:40,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd8e05f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:07:40, skipping insertion in model container [2023-08-26 12:07:40,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:07:40" (3/3) ... [2023-08-26 12:07:40,395 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 12:07:40,411 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:07:40,411 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 12:07:40,412 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:07:40,488 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:07:40,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 140 transitions, 300 flow [2023-08-26 12:07:40,613 INFO L124 PetriNetUnfolderBase]: 3/136 cut-off events. [2023-08-26 12:07:40,614 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:07:40,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 3/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 12:07:40,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 140 transitions, 300 flow [2023-08-26 12:07:40,628 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 136 transitions, 284 flow [2023-08-26 12:07:40,632 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:07:40,640 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 136 transitions, 284 flow [2023-08-26 12:07:40,648 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 136 transitions, 284 flow [2023-08-26 12:07:40,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 136 transitions, 284 flow [2023-08-26 12:07:40,708 INFO L124 PetriNetUnfolderBase]: 3/136 cut-off events. [2023-08-26 12:07:40,708 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:07:40,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 3/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 12:07:40,711 INFO L119 LiptonReduction]: Number of co-enabled transitions 3470 [2023-08-26 12:07:45,378 INFO L134 LiptonReduction]: Checked pairs total: 10198 [2023-08-26 12:07:45,378 INFO L136 LiptonReduction]: Total number of compositions: 140 [2023-08-26 12:07:45,392 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:07:45,398 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7abc1cb0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:07:45,398 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 12:07:45,399 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:07:45,400 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 12:07:45,400 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:07:45,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:45,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:07:45,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:45,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:45,405 INFO L85 PathProgramCache]: Analyzing trace with hash 622, now seen corresponding path program 1 times [2023-08-26 12:07:45,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:45,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396617488] [2023-08-26 12:07:45,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:45,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:07:45,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:45,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396617488] [2023-08-26 12:07:45,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396617488] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:45,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:45,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:07:45,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971977259] [2023-08-26 12:07:45,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:45,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:07:45,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:45,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:07:45,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:07:45,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 280 [2023-08-26 12:07:45,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 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) [2023-08-26 12:07:45,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:45,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 280 [2023-08-26 12:07:45,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:46,697 INFO L124 PetriNetUnfolderBase]: 6239/8470 cut-off events. [2023-08-26 12:07:46,698 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-08-26 12:07:46,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17138 conditions, 8470 events. 6239/8470 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 41933 event pairs, 6239 based on Foata normal form. 0/7602 useless extension candidates. Maximal degree in co-relation 17126. Up to 8451 conditions per place. [2023-08-26 12:07:46,822 INFO L140 encePairwiseOnDemand]: 271/280 looper letters, 26 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-08-26 12:07:46,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 122 flow [2023-08-26 12:07:46,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:07:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:07:46,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 283 transitions. [2023-08-26 12:07:46,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053571428571428 [2023-08-26 12:07:46,835 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 283 transitions. [2023-08-26 12:07:46,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 283 transitions. [2023-08-26 12:07:46,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:46,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 283 transitions. [2023-08-26 12:07:46,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 141.5) internal successors, (283), 2 states have internal predecessors, (283), 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) [2023-08-26 12:07:46,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 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) [2023-08-26 12:07:46,845 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 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) [2023-08-26 12:07:46,847 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 2 states and 283 transitions. [2023-08-26 12:07:46,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 122 flow [2023-08-26 12:07:46,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 12:07:46,855 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-08-26 12:07:46,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-26 12:07:46,859 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-26 12:07:46,860 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-08-26 12:07:46,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 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) [2023-08-26 12:07:46,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:46,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:07:46,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:07:46,861 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:46,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:46,861 INFO L85 PathProgramCache]: Analyzing trace with hash 610229, now seen corresponding path program 1 times [2023-08-26 12:07:46,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:46,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369665046] [2023-08-26 12:07:46,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:46,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:47,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:07:47,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:47,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369665046] [2023-08-26 12:07:47,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369665046] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:47,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:47,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:07:47,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256150699] [2023-08-26 12:07:47,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:47,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:07:47,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:47,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:07:47,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:07:47,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 280 [2023-08-26 12:07:47,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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) [2023-08-26 12:07:47,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:47,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 280 [2023-08-26 12:07:47,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:48,007 INFO L124 PetriNetUnfolderBase]: 4903/6790 cut-off events. [2023-08-26 12:07:48,007 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:07:48,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13635 conditions, 6790 events. 4903/6790 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 33746 event pairs, 1875 based on Foata normal form. 0/6465 useless extension candidates. Maximal degree in co-relation 13632. Up to 5335 conditions per place. [2023-08-26 12:07:48,047 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 41 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-08-26 12:07:48,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 200 flow [2023-08-26 12:07:48,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:07:48,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:07:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-26 12:07:48,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2023-08-26 12:07:48,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-26 12:07:48,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-26 12:07:48,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:48,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-26 12:07:48,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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) [2023-08-26 12:07:48,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 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) [2023-08-26 12:07:48,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 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) [2023-08-26 12:07:48,061 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 415 transitions. [2023-08-26 12:07:48,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 200 flow [2023-08-26 12:07:48,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:07:48,065 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-08-26 12:07:48,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-26 12:07:48,067 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-26 12:07:48,067 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-08-26 12:07:48,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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) [2023-08-26 12:07:48,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:48,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:07:48,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:07:48,073 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:48,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:48,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1774323097, now seen corresponding path program 1 times [2023-08-26 12:07:48,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:48,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295386529] [2023-08-26 12:07:48,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:48,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:07:48,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:48,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295386529] [2023-08-26 12:07:48,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295386529] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:48,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:48,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:07:48,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889389726] [2023-08-26 12:07:48,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:48,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:07:48,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:48,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:07:48,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:07:48,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 280 [2023-08-26 12:07:48,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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) [2023-08-26 12:07:48,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:48,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 280 [2023-08-26 12:07:48,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:50,153 INFO L124 PetriNetUnfolderBase]: 13482/18419 cut-off events. [2023-08-26 12:07:50,153 INFO L125 PetriNetUnfolderBase]: For 859/859 co-relation queries the response was YES. [2023-08-26 12:07:50,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38195 conditions, 18419 events. 13482/18419 cut-off events. For 859/859 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 96829 event pairs, 4784 based on Foata normal form. 529/18948 useless extension candidates. Maximal degree in co-relation 38191. Up to 10559 conditions per place. [2023-08-26 12:07:50,250 INFO L140 encePairwiseOnDemand]: 272/280 looper letters, 42 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2023-08-26 12:07:50,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 214 flow [2023-08-26 12:07:50,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:07:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:07:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-08-26 12:07:50,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-08-26 12:07:50,252 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-08-26 12:07:50,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-08-26 12:07:50,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:50,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-08-26 12:07:50,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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) [2023-08-26 12:07:50,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 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) [2023-08-26 12:07:50,256 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 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) [2023-08-26 12:07:50,257 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 3 states and 392 transitions. [2023-08-26 12:07:50,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 214 flow [2023-08-26 12:07:50,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:07:50,259 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 116 flow [2023-08-26 12:07:50,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-08-26 12:07:50,260 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2023-08-26 12:07:50,260 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 116 flow [2023-08-26 12:07:50,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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) [2023-08-26 12:07:50,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:50,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:07:50,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:07:50,264 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:50,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:50,265 INFO L85 PathProgramCache]: Analyzing trace with hash -830560506, now seen corresponding path program 1 times [2023-08-26 12:07:50,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:50,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648762968] [2023-08-26 12:07:50,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:50,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:07:50,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:50,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648762968] [2023-08-26 12:07:50,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648762968] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:50,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:50,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:07:50,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342599245] [2023-08-26 12:07:50,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:50,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:07:50,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:50,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:07:50,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:07:50,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 280 [2023-08-26 12:07:50,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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) [2023-08-26 12:07:50,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:50,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 280 [2023-08-26 12:07:50,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:51,857 INFO L124 PetriNetUnfolderBase]: 11273/15952 cut-off events. [2023-08-26 12:07:51,858 INFO L125 PetriNetUnfolderBase]: For 5972/5972 co-relation queries the response was YES. [2023-08-26 12:07:51,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38365 conditions, 15952 events. 11273/15952 cut-off events. For 5972/5972 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 92599 event pairs, 2626 based on Foata normal form. 40/15857 useless extension candidates. Maximal degree in co-relation 38360. Up to 14290 conditions per place. [2023-08-26 12:07:51,946 INFO L140 encePairwiseOnDemand]: 276/280 looper letters, 44 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2023-08-26 12:07:51,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 282 flow [2023-08-26 12:07:51,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:07:51,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:07:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-08-26 12:07:51,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2023-08-26 12:07:51,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-08-26 12:07:51,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-08-26 12:07:51,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:51,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-08-26 12:07:51,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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) [2023-08-26 12:07:51,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 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) [2023-08-26 12:07:51,952 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 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) [2023-08-26 12:07:51,952 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 116 flow. Second operand 3 states and 402 transitions. [2023-08-26 12:07:51,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 282 flow [2023-08-26 12:07:51,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:07:51,978 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 143 flow [2023-08-26 12:07:51,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2023-08-26 12:07:51,980 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -8 predicate places. [2023-08-26 12:07:51,980 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 143 flow [2023-08-26 12:07:51,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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) [2023-08-26 12:07:51,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:51,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:07:51,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:07:51,981 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:51,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:51,981 INFO L85 PathProgramCache]: Analyzing trace with hash -830560754, now seen corresponding path program 1 times [2023-08-26 12:07:51,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:51,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903207900] [2023-08-26 12:07:51,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:51,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:07:52,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:52,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903207900] [2023-08-26 12:07:52,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903207900] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:52,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:52,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:07:52,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876364887] [2023-08-26 12:07:52,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:52,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:07:52,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:52,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:07:52,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:07:52,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 280 [2023-08-26 12:07:52,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 143 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 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) [2023-08-26 12:07:52,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:52,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 280 [2023-08-26 12:07:52,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:53,413 INFO L124 PetriNetUnfolderBase]: 12891/17616 cut-off events. [2023-08-26 12:07:53,414 INFO L125 PetriNetUnfolderBase]: For 6190/6190 co-relation queries the response was YES. [2023-08-26 12:07:53,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43604 conditions, 17616 events. 12891/17616 cut-off events. For 6190/6190 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 92900 event pairs, 2369 based on Foata normal form. 40/17656 useless extension candidates. Maximal degree in co-relation 43598. Up to 9627 conditions per place. [2023-08-26 12:07:53,487 INFO L140 encePairwiseOnDemand]: 272/280 looper letters, 63 selfloop transitions, 13 changer transitions 0/76 dead transitions. [2023-08-26 12:07:53,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 76 transitions, 407 flow [2023-08-26 12:07:53,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:07:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:07:53,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 525 transitions. [2023-08-26 12:07:53,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2023-08-26 12:07:53,490 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 525 transitions. [2023-08-26 12:07:53,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 525 transitions. [2023-08-26 12:07:53,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:53,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 525 transitions. [2023-08-26 12:07:53,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 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) [2023-08-26 12:07:53,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 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) [2023-08-26 12:07:53,494 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 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) [2023-08-26 12:07:53,494 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 143 flow. Second operand 4 states and 525 transitions. [2023-08-26 12:07:53,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 76 transitions, 407 flow [2023-08-26 12:07:53,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 76 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:07:53,497 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 215 flow [2023-08-26 12:07:53,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2023-08-26 12:07:53,498 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-26 12:07:53,498 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 215 flow [2023-08-26 12:07:53,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 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) [2023-08-26 12:07:53,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:53,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:07:53,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:07:53,499 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:53,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:53,499 INFO L85 PathProgramCache]: Analyzing trace with hash 22426177, now seen corresponding path program 1 times [2023-08-26 12:07:53,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:53,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83680773] [2023-08-26 12:07:53,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:53,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:07:53,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:53,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83680773] [2023-08-26 12:07:53,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83680773] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:53,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:53,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:07:53,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918513298] [2023-08-26 12:07:53,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:53,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:07:53,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:53,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:07:53,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:07:53,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 280 [2023-08-26 12:07:53,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 215 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 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) [2023-08-26 12:07:53,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:53,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 280 [2023-08-26 12:07:53,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:54,863 INFO L124 PetriNetUnfolderBase]: 8395/12320 cut-off events. [2023-08-26 12:07:54,863 INFO L125 PetriNetUnfolderBase]: For 8671/9395 co-relation queries the response was YES. [2023-08-26 12:07:54,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32033 conditions, 12320 events. 8395/12320 cut-off events. For 8671/9395 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 75639 event pairs, 1364 based on Foata normal form. 1317/13309 useless extension candidates. Maximal degree in co-relation 32025. Up to 7734 conditions per place. [2023-08-26 12:07:54,938 INFO L140 encePairwiseOnDemand]: 273/280 looper letters, 90 selfloop transitions, 10 changer transitions 0/110 dead transitions. [2023-08-26 12:07:54,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 110 transitions, 699 flow [2023-08-26 12:07:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:07:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:07:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2023-08-26 12:07:54,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657142857142857 [2023-08-26 12:07:54,943 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2023-08-26 12:07:54,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2023-08-26 12:07:54,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:54,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2023-08-26 12:07:54,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 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) [2023-08-26 12:07:54,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 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) [2023-08-26 12:07:54,948 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 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) [2023-08-26 12:07:54,948 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 215 flow. Second operand 5 states and 652 transitions. [2023-08-26 12:07:54,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 110 transitions, 699 flow [2023-08-26 12:07:54,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 110 transitions, 699 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:07:54,959 INFO L231 Difference]: Finished difference. Result has 53 places, 52 transitions, 290 flow [2023-08-26 12:07:54,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2023-08-26 12:07:54,959 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2023-08-26 12:07:54,960 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 290 flow [2023-08-26 12:07:54,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 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) [2023-08-26 12:07:54,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:54,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:07:54,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:07:54,960 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:54,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:54,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1096720859, now seen corresponding path program 1 times [2023-08-26 12:07:54,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:54,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205050755] [2023-08-26 12:07:54,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:54,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:07:55,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:55,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205050755] [2023-08-26 12:07:55,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205050755] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:55,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:55,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:07:55,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244122153] [2023-08-26 12:07:55,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:55,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:07:55,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:55,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:07:55,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:07:55,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 280 [2023-08-26 12:07:55,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 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) [2023-08-26 12:07:55,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:55,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 280 [2023-08-26 12:07:55,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:56,728 INFO L124 PetriNetUnfolderBase]: 12979/19065 cut-off events. [2023-08-26 12:07:56,728 INFO L125 PetriNetUnfolderBase]: For 22355/22728 co-relation queries the response was YES. [2023-08-26 12:07:56,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62536 conditions, 19065 events. 12979/19065 cut-off events. For 22355/22728 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 122853 event pairs, 5502 based on Foata normal form. 516/19206 useless extension candidates. Maximal degree in co-relation 62524. Up to 9891 conditions per place. [2023-08-26 12:07:56,836 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 64 selfloop transitions, 6 changer transitions 8/83 dead transitions. [2023-08-26 12:07:56,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 83 transitions, 588 flow [2023-08-26 12:07:56,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:07:56,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:07:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-08-26 12:07:56,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2023-08-26 12:07:56,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-08-26 12:07:56,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-08-26 12:07:56,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:56,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-08-26 12:07:56,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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) [2023-08-26 12:07:56,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 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) [2023-08-26 12:07:56,842 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 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) [2023-08-26 12:07:56,842 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 290 flow. Second operand 3 states and 406 transitions. [2023-08-26 12:07:56,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 83 transitions, 588 flow [2023-08-26 12:07:56,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 83 transitions, 579 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:07:56,900 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 287 flow [2023-08-26 12:07:56,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2023-08-26 12:07:56,901 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2023-08-26 12:07:56,901 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 287 flow [2023-08-26 12:07:56,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 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) [2023-08-26 12:07:56,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:56,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:07:56,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:07:56,901 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:56,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:56,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1446038219, now seen corresponding path program 1 times [2023-08-26 12:07:56,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:56,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819742507] [2023-08-26 12:07:56,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:56,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:07:57,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:57,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819742507] [2023-08-26 12:07:57,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819742507] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:57,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:57,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:07:57,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983788478] [2023-08-26 12:07:57,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:57,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:07:57,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:57,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:07:57,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:07:57,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 280 [2023-08-26 12:07:57,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 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) [2023-08-26 12:07:57,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:57,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 280 [2023-08-26 12:07:57,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:58,267 INFO L124 PetriNetUnfolderBase]: 9130/13846 cut-off events. [2023-08-26 12:07:58,268 INFO L125 PetriNetUnfolderBase]: For 15211/15898 co-relation queries the response was YES. [2023-08-26 12:07:58,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44747 conditions, 13846 events. 9130/13846 cut-off events. For 15211/15898 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 92374 event pairs, 979 based on Foata normal form. 1303/14776 useless extension candidates. Maximal degree in co-relation 44734. Up to 4553 conditions per place. [2023-08-26 12:07:58,338 INFO L140 encePairwiseOnDemand]: 273/280 looper letters, 118 selfloop transitions, 17 changer transitions 6/150 dead transitions. [2023-08-26 12:07:58,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 150 transitions, 1091 flow [2023-08-26 12:07:58,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:07:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:07:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 913 transitions. [2023-08-26 12:07:58,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4658163265306122 [2023-08-26 12:07:58,341 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 913 transitions. [2023-08-26 12:07:58,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 913 transitions. [2023-08-26 12:07:58,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:58,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 913 transitions. [2023-08-26 12:07:58,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.42857142857142) internal successors, (913), 7 states have internal predecessors, (913), 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) [2023-08-26 12:07:58,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 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) [2023-08-26 12:07:58,347 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 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) [2023-08-26 12:07:58,347 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 287 flow. Second operand 7 states and 913 transitions. [2023-08-26 12:07:58,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 150 transitions, 1091 flow [2023-08-26 12:07:58,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 150 transitions, 1063 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 12:07:58,423 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 407 flow [2023-08-26 12:07:58,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=407, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2023-08-26 12:07:58,424 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2023-08-26 12:07:58,424 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 407 flow [2023-08-26 12:07:58,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 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) [2023-08-26 12:07:58,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:58,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:07:58,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:07:58,425 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:58,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:58,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1453505604, now seen corresponding path program 1 times [2023-08-26 12:07:58,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:58,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876315303] [2023-08-26 12:07:58,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:58,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:58,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:07:58,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:58,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876315303] [2023-08-26 12:07:58,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876315303] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:58,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:58,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:07:58,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569082473] [2023-08-26 12:07:58,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:58,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:07:58,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:58,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:07:58,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:07:58,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 280 [2023-08-26 12:07:58,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 407 flow. Second operand has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 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) [2023-08-26 12:07:58,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:58,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 280 [2023-08-26 12:07:58,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:01,163 INFO L124 PetriNetUnfolderBase]: 8409/12748 cut-off events. [2023-08-26 12:08:01,163 INFO L125 PetriNetUnfolderBase]: For 22326/22986 co-relation queries the response was YES. [2023-08-26 12:08:01,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47754 conditions, 12748 events. 8409/12748 cut-off events. For 22326/22986 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 84682 event pairs, 808 based on Foata normal form. 738/13129 useless extension candidates. Maximal degree in co-relation 47738. Up to 4314 conditions per place. [2023-08-26 12:08:01,319 INFO L140 encePairwiseOnDemand]: 273/280 looper letters, 129 selfloop transitions, 26 changer transitions 21/185 dead transitions. [2023-08-26 12:08:01,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 185 transitions, 1423 flow [2023-08-26 12:08:01,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 12:08:01,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 12:08:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1174 transitions. [2023-08-26 12:08:01,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4658730158730159 [2023-08-26 12:08:01,324 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1174 transitions. [2023-08-26 12:08:01,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1174 transitions. [2023-08-26 12:08:01,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:01,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1174 transitions. [2023-08-26 12:08:01,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 130.44444444444446) internal successors, (1174), 9 states have internal predecessors, (1174), 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) [2023-08-26 12:08:01,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 280.0) internal successors, (2800), 10 states have internal predecessors, (2800), 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) [2023-08-26 12:08:01,333 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 280.0) internal successors, (2800), 10 states have internal predecessors, (2800), 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) [2023-08-26 12:08:01,333 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 407 flow. Second operand 9 states and 1174 transitions. [2023-08-26 12:08:01,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 185 transitions, 1423 flow [2023-08-26 12:08:02,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 185 transitions, 1375 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-26 12:08:02,413 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 533 flow [2023-08-26 12:08:02,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=533, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2023-08-26 12:08:02,414 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2023-08-26 12:08:02,414 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 533 flow [2023-08-26 12:08:02,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 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) [2023-08-26 12:08:02,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:02,415 INFO L208 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] [2023-08-26 12:08:02,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:08:02,415 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:02,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:02,415 INFO L85 PathProgramCache]: Analyzing trace with hash -164652485, now seen corresponding path program 1 times [2023-08-26 12:08:02,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:02,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639512279] [2023-08-26 12:08:02,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:02,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:08:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:08:02,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:08:02,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639512279] [2023-08-26 12:08:02,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639512279] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:08:02,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:08:02,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:08:02,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895837194] [2023-08-26 12:08:02,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:08:02,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:08:02,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:08:02,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:08:02,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:08:02,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 280 [2023-08-26 12:08:02,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 533 flow. Second operand has 7 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 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) [2023-08-26 12:08:02,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:08:02,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 280 [2023-08-26 12:08:02,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:05,520 INFO L124 PetriNetUnfolderBase]: 8304/12558 cut-off events. [2023-08-26 12:08:05,520 INFO L125 PetriNetUnfolderBase]: For 25993/26652 co-relation queries the response was YES. [2023-08-26 12:08:05,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47626 conditions, 12558 events. 8304/12558 cut-off events. For 25993/26652 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 83200 event pairs, 798 based on Foata normal form. 462/12664 useless extension candidates. Maximal degree in co-relation 47607. Up to 2618 conditions per place. [2023-08-26 12:08:05,674 INFO L140 encePairwiseOnDemand]: 273/280 looper letters, 106 selfloop transitions, 29 changer transitions 45/186 dead transitions. [2023-08-26 12:08:05,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 186 transitions, 1481 flow [2023-08-26 12:08:05,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 12:08:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 12:08:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1407 transitions. [2023-08-26 12:08:05,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45681818181818185 [2023-08-26 12:08:05,704 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1407 transitions. [2023-08-26 12:08:05,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1407 transitions. [2023-08-26 12:08:05,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:05,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1407 transitions. [2023-08-26 12:08:05,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 127.9090909090909) internal successors, (1407), 11 states have internal predecessors, (1407), 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) [2023-08-26 12:08:05,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 280.0) internal successors, (3360), 12 states have internal predecessors, (3360), 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) [2023-08-26 12:08:05,714 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 280.0) internal successors, (3360), 12 states have internal predecessors, (3360), 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) [2023-08-26 12:08:05,714 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 533 flow. Second operand 11 states and 1407 transitions. [2023-08-26 12:08:05,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 186 transitions, 1481 flow [2023-08-26 12:08:07,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 186 transitions, 1384 flow, removed 36 selfloop flow, removed 4 redundant places. [2023-08-26 12:08:07,315 INFO L231 Difference]: Finished difference. Result has 80 places, 61 transitions, 470 flow [2023-08-26 12:08:07,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=470, PETRI_PLACES=80, PETRI_TRANSITIONS=61} [2023-08-26 12:08:07,316 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 30 predicate places. [2023-08-26 12:08:07,316 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 61 transitions, 470 flow [2023-08-26 12:08:07,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 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) [2023-08-26 12:08:07,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:07,317 INFO L208 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] [2023-08-26 12:08:07,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:08:07,317 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:07,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:07,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2097168354, now seen corresponding path program 1 times [2023-08-26 12:08:07,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:07,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710712114] [2023-08-26 12:08:07,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:07,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:08:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:08:07,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:08:07,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710712114] [2023-08-26 12:08:07,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710712114] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:08:07,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:08:07,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:08:07,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62140842] [2023-08-26 12:08:07,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:08:07,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:08:07,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:08:07,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:08:07,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:08:07,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 280 [2023-08-26 12:08:07,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 61 transitions, 470 flow. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 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) [2023-08-26 12:08:07,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:08:07,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 280 [2023-08-26 12:08:07,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:08,764 INFO L124 PetriNetUnfolderBase]: 5317/8002 cut-off events. [2023-08-26 12:08:08,764 INFO L125 PetriNetUnfolderBase]: For 21751/21751 co-relation queries the response was YES. [2023-08-26 12:08:08,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30837 conditions, 8002 events. 5317/8002 cut-off events. For 21751/21751 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 45596 event pairs, 301 based on Foata normal form. 1/8003 useless extension candidates. Maximal degree in co-relation 30814. Up to 3288 conditions per place. [2023-08-26 12:08:08,840 INFO L140 encePairwiseOnDemand]: 271/280 looper letters, 85 selfloop transitions, 22 changer transitions 56/163 dead transitions. [2023-08-26 12:08:08,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 163 transitions, 1590 flow [2023-08-26 12:08:08,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:08:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:08:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 635 transitions. [2023-08-26 12:08:08,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45357142857142857 [2023-08-26 12:08:08,842 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 635 transitions. [2023-08-26 12:08:08,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 635 transitions. [2023-08-26 12:08:08,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:08,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 635 transitions. [2023-08-26 12:08:08,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 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) [2023-08-26 12:08:08,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 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) [2023-08-26 12:08:08,847 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 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) [2023-08-26 12:08:08,847 INFO L175 Difference]: Start difference. First operand has 80 places, 61 transitions, 470 flow. Second operand 5 states and 635 transitions. [2023-08-26 12:08:08,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 163 transitions, 1590 flow [2023-08-26 12:08:09,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 163 transitions, 1264 flow, removed 57 selfloop flow, removed 14 redundant places. [2023-08-26 12:08:09,022 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 432 flow [2023-08-26 12:08:09,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=432, PETRI_PLACES=72, PETRI_TRANSITIONS=61} [2023-08-26 12:08:09,023 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2023-08-26 12:08:09,023 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 61 transitions, 432 flow [2023-08-26 12:08:09,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 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) [2023-08-26 12:08:09,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:09,024 INFO L208 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] [2023-08-26 12:08:09,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:08:09,024 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:09,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:09,024 INFO L85 PathProgramCache]: Analyzing trace with hash -973295654, now seen corresponding path program 2 times [2023-08-26 12:08:09,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:09,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648304638] [2023-08-26 12:08:09,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:09,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:08:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:08:10,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:08:10,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648304638] [2023-08-26 12:08:10,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648304638] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:08:10,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:08:10,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:08:10,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877855677] [2023-08-26 12:08:10,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:08:10,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:08:10,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:08:10,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:08:10,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:08:10,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 280 [2023-08-26 12:08:10,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 432 flow. Second operand has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 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) [2023-08-26 12:08:10,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:08:10,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 280 [2023-08-26 12:08:10,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:11,278 INFO L124 PetriNetUnfolderBase]: 2710/4330 cut-off events. [2023-08-26 12:08:11,279 INFO L125 PetriNetUnfolderBase]: For 9008/9100 co-relation queries the response was YES. [2023-08-26 12:08:11,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15254 conditions, 4330 events. 2710/4330 cut-off events. For 9008/9100 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 25829 event pairs, 266 based on Foata normal form. 41/4324 useless extension candidates. Maximal degree in co-relation 15234. Up to 1736 conditions per place. [2023-08-26 12:08:11,305 INFO L140 encePairwiseOnDemand]: 273/280 looper letters, 109 selfloop transitions, 5 changer transitions 36/163 dead transitions. [2023-08-26 12:08:11,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 163 transitions, 1338 flow [2023-08-26 12:08:11,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:08:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:08:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 857 transitions. [2023-08-26 12:08:11,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4372448979591837 [2023-08-26 12:08:11,308 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 857 transitions. [2023-08-26 12:08:11,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 857 transitions. [2023-08-26 12:08:11,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:11,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 857 transitions. [2023-08-26 12:08:11,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 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) [2023-08-26 12:08:11,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 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) [2023-08-26 12:08:11,313 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 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) [2023-08-26 12:08:11,313 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 432 flow. Second operand 7 states and 857 transitions. [2023-08-26 12:08:11,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 163 transitions, 1338 flow [2023-08-26 12:08:11,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 163 transitions, 1302 flow, removed 18 selfloop flow, removed 6 redundant places. [2023-08-26 12:08:11,410 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 457 flow [2023-08-26 12:08:11,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=457, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2023-08-26 12:08:11,411 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2023-08-26 12:08:11,411 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 457 flow [2023-08-26 12:08:11,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 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) [2023-08-26 12:08:11,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:11,412 INFO L208 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] [2023-08-26 12:08:11,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:08:11,412 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:11,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash 909947970, now seen corresponding path program 3 times [2023-08-26 12:08:11,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:11,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29844981] [2023-08-26 12:08:11,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:11,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:08:11,477 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:08:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:08:11,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:08:11,568 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:08:11,569 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 12:08:11,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 12:08:11,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 12:08:11,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 12:08:11,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 12:08:11,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 12:08:11,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 12:08:11,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 12:08:11,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 12:08:11,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 12:08:11,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 12:08:11,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 12:08:11,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 12:08:11,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 12:08:11,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 12:08:11,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:08:11,573 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:08:11,579 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:08:11,580 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:08:11,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:08:11 BasicIcfg [2023-08-26 12:08:11,683 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:08:11,683 INFO L158 Benchmark]: Toolchain (without parser) took 33033.06ms. Allocated memory was 308.3MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 282.0MB in the beginning and 1.2GB in the end (delta: -910.3MB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2023-08-26 12:08:11,684 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 308.3MB. Free memory is still 283.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:08:11,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 646.36ms. Allocated memory is still 308.3MB. Free memory was 282.0MB in the beginning and 257.9MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 12:08:11,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.05ms. Allocated memory is still 308.3MB. Free memory was 257.9MB in the beginning and 255.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:08:11,684 INFO L158 Benchmark]: Boogie Preprocessor took 41.26ms. Allocated memory is still 308.3MB. Free memory was 255.4MB in the beginning and 253.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:08:11,685 INFO L158 Benchmark]: RCFGBuilder took 960.18ms. Allocated memory is still 308.3MB. Free memory was 253.3MB in the beginning and 260.8MB in the end (delta: -7.5MB). Peak memory consumption was 24.9MB. Max. memory is 16.0GB. [2023-08-26 12:08:11,685 INFO L158 Benchmark]: TraceAbstraction took 31295.19ms. Allocated memory was 308.3MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 259.7MB in the beginning and 1.2GB in the end (delta: -932.5MB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2023-08-26 12:08:11,686 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 308.3MB. Free memory is still 283.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 646.36ms. Allocated memory is still 308.3MB. Free memory was 282.0MB in the beginning and 257.9MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 84.05ms. Allocated memory is still 308.3MB. Free memory was 257.9MB in the beginning and 255.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.26ms. Allocated memory is still 308.3MB. Free memory was 255.4MB in the beginning and 253.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 960.18ms. Allocated memory is still 308.3MB. Free memory was 253.3MB in the beginning and 260.8MB in the end (delta: -7.5MB). Peak memory consumption was 24.9MB. Max. memory is 16.0GB. * TraceAbstraction took 31295.19ms. Allocated memory was 308.3MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 259.7MB in the beginning and 1.2GB in the end (delta: -932.5MB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 146 PlacesBefore, 50 PlacesAfterwards, 136 TransitionsBefore, 38 TransitionsAfterwards, 3470 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 140 TotalNumberOfCompositions, 10198 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4709, independent: 4470, independent conditional: 0, independent unconditional: 4470, dependent: 239, dependent conditional: 0, dependent unconditional: 239, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1975, independent: 1922, independent conditional: 0, independent unconditional: 1922, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4709, independent: 2548, independent conditional: 0, independent unconditional: 2548, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 1975, unknown conditional: 0, unknown unconditional: 1975] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 169, Positive conditional cache size: 0, Positive unconditional cache size: 169, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1409; [L860] FCALL, FORK 0 pthread_create(&t1409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1409, ((void *)0), P0, ((void *)0))=-4, t1409={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1410; [L862] FCALL, FORK 0 pthread_create(&t1410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1410, ((void *)0), P1, ((void *)0))=-3, t1409={5:0}, t1410={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1411; [L864] FCALL, FORK 0 pthread_create(&t1411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1411, ((void *)0), P2, ((void *)0))=-2, t1409={5:0}, t1410={6:0}, t1411={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1412; [L866] FCALL, FORK 0 pthread_create(&t1412, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1412, ((void *)0), P3, ((void *)0))=-1, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L798] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L801] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L818] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice2=0, x=2, y=2, z=1] [L879] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix053_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 175 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 31.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 456 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 456 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1257 IncrementalHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 18 mSDtfsCounter, 1257 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=533occurred in iteration=9, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 1162 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! [2023-08-26 12:08:11,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...