/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 --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -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/mix035_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:10:58,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:10:58,219 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 15:10:58,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:10:58,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:10:58,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:10:58,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:10:58,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:10:58,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:10:58,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:10:58,266 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:10:58,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:10:58,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:10:58,267 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:10:58,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:10:58,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:10:58,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:10:58,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:10:58,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:10:58,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:10:58,269 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:10:58,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:10:58,269 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:10:58,270 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:10:58,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:10:58,270 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:10:58,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:10:58,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:10:58,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:10:58,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:10:58,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:10:58,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:10:58,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:10:58,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:10:58,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:10:58,273 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.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST 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 15:10:58,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:10:58,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:10:58,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:10:58,634 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:10:58,634 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:10:58,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i [2023-08-26 15:10:59,803 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:11:00,120 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:11:00,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i [2023-08-26 15:11:00,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91b9e21fd/1ed88957c1194e99a0ef18882d5a2915/FLAG3ca5fd24d [2023-08-26 15:11:00,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91b9e21fd/1ed88957c1194e99a0ef18882d5a2915 [2023-08-26 15:11:00,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:11:00,164 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:11:00,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:11:00,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:11:00,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:11:00,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:11:00" (1/1) ... [2023-08-26 15:11:00,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70d6ffa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:00, skipping insertion in model container [2023-08-26 15:11:00,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:11:00" (1/1) ... [2023-08-26 15:11:00,228 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:11:00,599 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:11:00,612 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:11:00,627 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 15:11:00,628 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 15:11:00,654 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:11:00,684 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:11:00,685 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:11:00,691 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:11:00,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:00 WrapperNode [2023-08-26 15:11:00,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:11:00,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:11:00,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:11:00,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:11:00,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:00" (1/1) ... [2023-08-26 15:11:00,719 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:00" (1/1) ... [2023-08-26 15:11:00,753 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2023-08-26 15:11:00,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:11:00,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:11:00,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:11:00,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:11:00,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:00" (1/1) ... [2023-08-26 15:11:00,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:00" (1/1) ... [2023-08-26 15:11:00,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:00" (1/1) ... [2023-08-26 15:11:00,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:00" (1/1) ... [2023-08-26 15:11:00,774 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:00" (1/1) ... [2023-08-26 15:11:00,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:00" (1/1) ... [2023-08-26 15:11:00,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:00" (1/1) ... [2023-08-26 15:11:00,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:00" (1/1) ... [2023-08-26 15:11:00,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:11:00,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:11:00,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:11:00,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:11:00,784 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:00" (1/1) ... [2023-08-26 15:11:00,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:11:00,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:11:00,813 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 15:11:00,850 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 15:11:00,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:11:00,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:11:00,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:11:00,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:11:00,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:11:00,871 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:11:00,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:11:00,871 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:11:00,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:11:00,871 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 15:11:00,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 15:11:00,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:11:00,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:11:00,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:11:00,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:11:00,875 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 15:11:01,016 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:11:01,018 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:11:01,390 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:11:01,520 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:11:01,520 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:11:01,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:11:01 BoogieIcfgContainer [2023-08-26 15:11:01,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:11:01,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:11:01,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:11:01,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:11:01,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:11:00" (1/3) ... [2023-08-26 15:11:01,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d80d37f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:11:01, skipping insertion in model container [2023-08-26 15:11:01,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:00" (2/3) ... [2023-08-26 15:11:01,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d80d37f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:11:01, skipping insertion in model container [2023-08-26 15:11:01,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:11:01" (3/3) ... [2023-08-26 15:11:01,530 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i [2023-08-26 15:11:01,545 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:11:01,545 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 15:11:01,545 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:11:01,592 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:11:01,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 122 transitions, 259 flow [2023-08-26 15:11:01,668 INFO L124 PetriNetUnfolderBase]: 3/119 cut-off events. [2023-08-26 15:11:01,668 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:11:01,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 3/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-26 15:11:01,673 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 122 transitions, 259 flow [2023-08-26 15:11:01,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 119 transitions, 247 flow [2023-08-26 15:11:01,680 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:11:01,688 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 119 transitions, 247 flow [2023-08-26 15:11:01,690 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 119 transitions, 247 flow [2023-08-26 15:11:01,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 119 transitions, 247 flow [2023-08-26 15:11:01,712 INFO L124 PetriNetUnfolderBase]: 3/119 cut-off events. [2023-08-26 15:11:01,713 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:11:01,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 3/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-26 15:11:01,715 INFO L119 LiptonReduction]: Number of co-enabled transitions 2226 [2023-08-26 15:11:05,644 INFO L134 LiptonReduction]: Checked pairs total: 5692 [2023-08-26 15:11:05,644 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-26 15:11:05,656 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:11:05,662 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;@6845eef4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:11:05,662 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-26 15:11:05,663 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:11:05,664 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 15:11:05,664 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:11:05,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:05,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:11:05,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:11:05,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:05,669 INFO L85 PathProgramCache]: Analyzing trace with hash 538, now seen corresponding path program 1 times [2023-08-26 15:11:05,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:05,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813440494] [2023-08-26 15:11:05,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:05,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:11:05,770 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 15:11:05,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:11:05,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813440494] [2023-08-26 15:11:05,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813440494] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:11:05,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:11:05,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:11:05,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383091393] [2023-08-26 15:11:05,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:11:05,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:11:05,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:11:05,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:11:05,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:11:05,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 238 [2023-08-26 15:11:05,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 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 15:11:05,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:11:05,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 238 [2023-08-26 15:11:05,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:11:06,192 INFO L124 PetriNetUnfolderBase]: 1277/1988 cut-off events. [2023-08-26 15:11:06,192 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-26 15:11:06,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3929 conditions, 1988 events. 1277/1988 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9788 event pairs, 1277 based on Foata normal form. 80/1735 useless extension candidates. Maximal degree in co-relation 3918. Up to 1887 conditions per place. [2023-08-26 15:11:06,210 INFO L140 encePairwiseOnDemand]: 231/238 looper letters, 22 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-26 15:11:06,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 103 flow [2023-08-26 15:11:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:11:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:11:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 247 transitions. [2023-08-26 15:11:06,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5189075630252101 [2023-08-26 15:11:06,226 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 247 transitions. [2023-08-26 15:11:06,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 247 transitions. [2023-08-26 15:11:06,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:11:06,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 247 transitions. [2023-08-26 15:11:06,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 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 15:11:06,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 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 15:11:06,240 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 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 15:11:06,242 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 247 transitions. [2023-08-26 15:11:06,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 103 flow [2023-08-26 15:11:06,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 15:11:06,246 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-26 15:11:06,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-26 15:11:06,252 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-26 15:11:06,252 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-26 15:11:06,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 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 15:11:06,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:06,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 15:11:06,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:11:06,254 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:11:06,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:06,262 INFO L85 PathProgramCache]: Analyzing trace with hash 510834924, now seen corresponding path program 1 times [2023-08-26 15:11:06,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:06,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071482372] [2023-08-26 15:11:06,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:06,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:11:06,556 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 15:11:06,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:11:06,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071482372] [2023-08-26 15:11:06,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071482372] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:11:06,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:11:06,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:11:06,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980270077] [2023-08-26 15:11:06,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:11:06,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:11:06,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:11:06,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:11:06,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:11:06,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 238 [2023-08-26 15:11:06,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 15:11:06,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:11:06,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 238 [2023-08-26 15:11:06,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:11:06,761 INFO L124 PetriNetUnfolderBase]: 999/1632 cut-off events. [2023-08-26 15:11:06,761 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:11:06,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3165 conditions, 1632 events. 999/1632 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8548 event pairs, 165 based on Foata normal form. 0/1492 useless extension candidates. Maximal degree in co-relation 3162. Up to 1195 conditions per place. [2023-08-26 15:11:06,770 INFO L140 encePairwiseOnDemand]: 235/238 looper letters, 29 selfloop transitions, 2 changer transitions 4/38 dead transitions. [2023-08-26 15:11:06,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 154 flow [2023-08-26 15:11:06,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:11:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:11:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-08-26 15:11:06,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042016806722689 [2023-08-26 15:11:06,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-08-26 15:11:06,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-08-26 15:11:06,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:11:06,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-08-26 15:11:06,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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 15:11:06,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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 15:11:06,777 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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 15:11:06,777 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 360 transitions. [2023-08-26 15:11:06,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 154 flow [2023-08-26 15:11:06,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:11:06,778 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 54 flow [2023-08-26 15:11:06,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-08-26 15:11:06,779 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-26 15:11:06,779 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 54 flow [2023-08-26 15:11:06,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 15:11:06,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:06,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:11:06,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:11:06,780 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:11:06,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:06,781 INFO L85 PathProgramCache]: Analyzing trace with hash 348420817, now seen corresponding path program 1 times [2023-08-26 15:11:06,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:06,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204940428] [2023-08-26 15:11:06,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:06,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:11:07,037 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 15:11:07,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:11:07,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204940428] [2023-08-26 15:11:07,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204940428] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:11:07,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:11:07,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:11:07,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228365029] [2023-08-26 15:11:07,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:11:07,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:11:07,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:11:07,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:11:07,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:11:07,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 238 [2023-08-26 15:11:07,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 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 15:11:07,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:11:07,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 238 [2023-08-26 15:11:07,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:11:07,339 INFO L124 PetriNetUnfolderBase]: 1505/2258 cut-off events. [2023-08-26 15:11:07,340 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2023-08-26 15:11:07,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4715 conditions, 2258 events. 1505/2258 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9782 event pairs, 641 based on Foata normal form. 120/2378 useless extension candidates. Maximal degree in co-relation 4711. Up to 1889 conditions per place. [2023-08-26 15:11:07,352 INFO L140 encePairwiseOnDemand]: 232/238 looper letters, 30 selfloop transitions, 4 changer transitions 19/53 dead transitions. [2023-08-26 15:11:07,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 53 transitions, 232 flow [2023-08-26 15:11:07,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:11:07,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:11:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2023-08-26 15:11:07,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453781512605042 [2023-08-26 15:11:07,355 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 540 transitions. [2023-08-26 15:11:07,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 540 transitions. [2023-08-26 15:11:07,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:11:07,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 540 transitions. [2023-08-26 15:11:07,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 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 15:11:07,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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 15:11:07,359 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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 15:11:07,360 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 54 flow. Second operand 5 states and 540 transitions. [2023-08-26 15:11:07,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 53 transitions, 232 flow [2023-08-26 15:11:07,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 53 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:11:07,362 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 86 flow [2023-08-26 15:11:07,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-26 15:11:07,362 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2023-08-26 15:11:07,362 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 86 flow [2023-08-26 15:11:07,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 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 15:11:07,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:07,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:11:07,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:11:07,363 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:11:07,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:07,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1018906654, now seen corresponding path program 1 times [2023-08-26 15:11:07,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:07,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751876764] [2023-08-26 15:11:07,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:07,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:11:07,535 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 15:11:07,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:11:07,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751876764] [2023-08-26 15:11:07,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751876764] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:11:07,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:11:07,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:11:07,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576067562] [2023-08-26 15:11:07,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:11:07,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:11:07,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:11:07,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:11:07,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:11:07,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 238 [2023-08-26 15:11:07,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 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 15:11:07,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:11:07,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 238 [2023-08-26 15:11:07,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:11:07,864 INFO L124 PetriNetUnfolderBase]: 1329/1994 cut-off events. [2023-08-26 15:11:07,864 INFO L125 PetriNetUnfolderBase]: For 1046/1046 co-relation queries the response was YES. [2023-08-26 15:11:07,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5038 conditions, 1994 events. 1329/1994 cut-off events. For 1046/1046 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8249 event pairs, 371 based on Foata normal form. 96/2090 useless extension candidates. Maximal degree in co-relation 5031. Up to 1301 conditions per place. [2023-08-26 15:11:07,874 INFO L140 encePairwiseOnDemand]: 234/238 looper letters, 31 selfloop transitions, 3 changer transitions 20/54 dead transitions. [2023-08-26 15:11:07,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 54 transitions, 282 flow [2023-08-26 15:11:07,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:11:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:11:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2023-08-26 15:11:07,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45210084033613446 [2023-08-26 15:11:07,876 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2023-08-26 15:11:07,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2023-08-26 15:11:07,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:11:07,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2023-08-26 15:11:07,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 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 15:11:07,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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 15:11:07,880 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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 15:11:07,880 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 86 flow. Second operand 5 states and 538 transitions. [2023-08-26 15:11:07,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 54 transitions, 282 flow [2023-08-26 15:11:07,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 276 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 15:11:07,886 INFO L231 Difference]: Finished difference. Result has 40 places, 25 transitions, 95 flow [2023-08-26 15:11:07,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2023-08-26 15:11:07,887 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-26 15:11:07,887 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 95 flow [2023-08-26 15:11:07,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 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 15:11:07,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:07,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:11:07,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:11:07,888 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:11:07,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:07,888 INFO L85 PathProgramCache]: Analyzing trace with hash -165375910, now seen corresponding path program 1 times [2023-08-26 15:11:07,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:07,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255797365] [2023-08-26 15:11:07,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:07,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:11:08,013 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 15:11:08,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:11:08,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255797365] [2023-08-26 15:11:08,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255797365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:11:08,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:11:08,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:11:08,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662600114] [2023-08-26 15:11:08,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:11:08,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:11:08,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:11:08,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:11:08,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:11:08,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 238 [2023-08-26 15:11:08,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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 15:11:08,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:11:08,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 238 [2023-08-26 15:11:08,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:11:08,156 INFO L124 PetriNetUnfolderBase]: 440/754 cut-off events. [2023-08-26 15:11:08,157 INFO L125 PetriNetUnfolderBase]: For 404/415 co-relation queries the response was YES. [2023-08-26 15:11:08,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1919 conditions, 754 events. 440/754 cut-off events. For 404/415 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3263 event pairs, 109 based on Foata normal form. 33/769 useless extension candidates. Maximal degree in co-relation 1910. Up to 587 conditions per place. [2023-08-26 15:11:08,161 INFO L140 encePairwiseOnDemand]: 233/238 looper letters, 29 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2023-08-26 15:11:08,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 195 flow [2023-08-26 15:11:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:11:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:11:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-08-26 15:11:08,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4831932773109244 [2023-08-26 15:11:08,163 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-08-26 15:11:08,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-08-26 15:11:08,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:11:08,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-08-26 15:11:08,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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 15:11:08,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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 15:11:08,166 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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 15:11:08,166 INFO L175 Difference]: Start difference. First operand has 40 places, 25 transitions, 95 flow. Second operand 3 states and 345 transitions. [2023-08-26 15:11:08,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 195 flow [2023-08-26 15:11:08,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 185 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 15:11:08,170 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 111 flow [2023-08-26 15:11:08,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2023-08-26 15:11:08,173 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2023-08-26 15:11:08,173 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 111 flow [2023-08-26 15:11:08,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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 15:11:08,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:08,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:11:08,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:11:08,174 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:11:08,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:08,175 INFO L85 PathProgramCache]: Analyzing trace with hash -557930630, now seen corresponding path program 1 times [2023-08-26 15:11:08,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:08,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877777529] [2023-08-26 15:11:08,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:08,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:11:08,312 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 15:11:08,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:11:08,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877777529] [2023-08-26 15:11:08,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877777529] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:11:08,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:11:08,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:11:08,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273476614] [2023-08-26 15:11:08,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:11:08,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:11:08,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:11:08,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:11:08,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:11:08,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 238 [2023-08-26 15:11:08,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 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 15:11:08,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:11:08,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 238 [2023-08-26 15:11:08,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:11:08,411 INFO L124 PetriNetUnfolderBase]: 202/394 cut-off events. [2023-08-26 15:11:08,411 INFO L125 PetriNetUnfolderBase]: For 154/156 co-relation queries the response was YES. [2023-08-26 15:11:08,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 394 events. 202/394 cut-off events. For 154/156 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1530 event pairs, 59 based on Foata normal form. 35/423 useless extension candidates. Maximal degree in co-relation 1106. Up to 125 conditions per place. [2023-08-26 15:11:08,413 INFO L140 encePairwiseOnDemand]: 233/238 looper letters, 37 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2023-08-26 15:11:08,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 261 flow [2023-08-26 15:11:08,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:11:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:11:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2023-08-26 15:11:08,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4831932773109244 [2023-08-26 15:11:08,415 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 460 transitions. [2023-08-26 15:11:08,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 460 transitions. [2023-08-26 15:11:08,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:11:08,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 460 transitions. [2023-08-26 15:11:08,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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 15:11:08,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 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 15:11:08,419 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 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 15:11:08,420 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 111 flow. Second operand 4 states and 460 transitions. [2023-08-26 15:11:08,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 261 flow [2023-08-26 15:11:08,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:11:08,422 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 147 flow [2023-08-26 15:11:08,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2023-08-26 15:11:08,425 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-26 15:11:08,427 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 147 flow [2023-08-26 15:11:08,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 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 15:11:08,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:08,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:11:08,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:11:08,428 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:11:08,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:08,429 INFO L85 PathProgramCache]: Analyzing trace with hash 878222444, now seen corresponding path program 1 times [2023-08-26 15:11:08,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:08,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221693077] [2023-08-26 15:11:08,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:08,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:11:08,623 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 15:11:08,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:11:08,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221693077] [2023-08-26 15:11:08,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221693077] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:11:08,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:11:08,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:11:08,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348436432] [2023-08-26 15:11:08,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:11:08,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:11:08,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:11:08,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:11:08,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:11:08,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 238 [2023-08-26 15:11:08,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 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 15:11:08,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:11:08,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 238 [2023-08-26 15:11:08,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:11:08,842 INFO L124 PetriNetUnfolderBase]: 354/653 cut-off events. [2023-08-26 15:11:08,842 INFO L125 PetriNetUnfolderBase]: For 764/764 co-relation queries the response was YES. [2023-08-26 15:11:08,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2094 conditions, 653 events. 354/653 cut-off events. For 764/764 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2685 event pairs, 44 based on Foata normal form. 13/666 useless extension candidates. Maximal degree in co-relation 2085. Up to 408 conditions per place. [2023-08-26 15:11:08,846 INFO L140 encePairwiseOnDemand]: 230/238 looper letters, 66 selfloop transitions, 11 changer transitions 14/91 dead transitions. [2023-08-26 15:11:08,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 91 transitions, 591 flow [2023-08-26 15:11:08,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:11:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:11:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 742 transitions. [2023-08-26 15:11:08,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44537815126050423 [2023-08-26 15:11:08,849 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 742 transitions. [2023-08-26 15:11:08,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 742 transitions. [2023-08-26 15:11:08,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:11:08,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 742 transitions. [2023-08-26 15:11:08,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 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 15:11:08,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 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 15:11:08,854 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 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 15:11:08,854 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 147 flow. Second operand 7 states and 742 transitions. [2023-08-26 15:11:08,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 91 transitions, 591 flow [2023-08-26 15:11:08,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 91 transitions, 557 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-26 15:11:08,857 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 210 flow [2023-08-26 15:11:08,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-26 15:11:08,858 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-08-26 15:11:08,858 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 210 flow [2023-08-26 15:11:08,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 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 15:11:08,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:08,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:11:08,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:11:08,859 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:11:08,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:08,860 INFO L85 PathProgramCache]: Analyzing trace with hash -671538504, now seen corresponding path program 2 times [2023-08-26 15:11:08,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:08,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719660700] [2023-08-26 15:11:08,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:08,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:11:09,020 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 15:11:09,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:11:09,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719660700] [2023-08-26 15:11:09,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719660700] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:11:09,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:11:09,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:11:09,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152716738] [2023-08-26 15:11:09,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:11:09,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:11:09,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:11:09,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:11:09,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:11:09,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 238 [2023-08-26 15:11:09,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 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 15:11:09,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:11:09,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 238 [2023-08-26 15:11:09,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:11:09,250 INFO L124 PetriNetUnfolderBase]: 412/764 cut-off events. [2023-08-26 15:11:09,250 INFO L125 PetriNetUnfolderBase]: For 1479/1479 co-relation queries the response was YES. [2023-08-26 15:11:09,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2755 conditions, 764 events. 412/764 cut-off events. For 1479/1479 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3337 event pairs, 70 based on Foata normal form. 9/773 useless extension candidates. Maximal degree in co-relation 2742. Up to 380 conditions per place. [2023-08-26 15:11:09,255 INFO L140 encePairwiseOnDemand]: 230/238 looper letters, 57 selfloop transitions, 9 changer transitions 25/91 dead transitions. [2023-08-26 15:11:09,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 91 transitions, 641 flow [2023-08-26 15:11:09,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:11:09,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:11:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 741 transitions. [2023-08-26 15:11:09,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4447779111644658 [2023-08-26 15:11:09,257 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 741 transitions. [2023-08-26 15:11:09,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 741 transitions. [2023-08-26 15:11:09,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:11:09,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 741 transitions. [2023-08-26 15:11:09,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.85714285714286) internal successors, (741), 7 states have internal predecessors, (741), 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 15:11:09,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 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 15:11:09,262 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 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 15:11:09,262 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 210 flow. Second operand 7 states and 741 transitions. [2023-08-26 15:11:09,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 91 transitions, 641 flow [2023-08-26 15:11:09,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 91 transitions, 615 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-08-26 15:11:09,267 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 205 flow [2023-08-26 15:11:09,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=205, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2023-08-26 15:11:09,268 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2023-08-26 15:11:09,268 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 205 flow [2023-08-26 15:11:09,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 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 15:11:09,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:09,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:11:09,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:11:09,269 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:11:09,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:09,269 INFO L85 PathProgramCache]: Analyzing trace with hash -735467966, now seen corresponding path program 3 times [2023-08-26 15:11:09,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:09,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571442925] [2023-08-26 15:11:09,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:09,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:11:09,412 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 15:11:09,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:11:09,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571442925] [2023-08-26 15:11:09,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571442925] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:11:09,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:11:09,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:11:09,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733237478] [2023-08-26 15:11:09,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:11:09,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:11:09,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:11:09,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:11:09,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:11:09,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 238 [2023-08-26 15:11:09,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 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 15:11:09,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:11:09,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 238 [2023-08-26 15:11:09,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:11:09,530 INFO L124 PetriNetUnfolderBase]: 210/412 cut-off events. [2023-08-26 15:11:09,531 INFO L125 PetriNetUnfolderBase]: For 721/724 co-relation queries the response was YES. [2023-08-26 15:11:09,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 412 events. 210/412 cut-off events. For 721/724 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1722 event pairs, 62 based on Foata normal form. 19/424 useless extension candidates. Maximal degree in co-relation 1365. Up to 161 conditions per place. [2023-08-26 15:11:09,533 INFO L140 encePairwiseOnDemand]: 233/238 looper letters, 28 selfloop transitions, 10 changer transitions 10/53 dead transitions. [2023-08-26 15:11:09,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 359 flow [2023-08-26 15:11:09,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:11:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:11:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2023-08-26 15:11:09,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47394957983193275 [2023-08-26 15:11:09,554 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 564 transitions. [2023-08-26 15:11:09,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 564 transitions. [2023-08-26 15:11:09,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:11:09,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 564 transitions. [2023-08-26 15:11:09,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 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 15:11:09,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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 15:11:09,559 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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 15:11:09,560 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 205 flow. Second operand 5 states and 564 transitions. [2023-08-26 15:11:09,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 359 flow [2023-08-26 15:11:09,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 316 flow, removed 5 selfloop flow, removed 8 redundant places. [2023-08-26 15:11:09,562 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 162 flow [2023-08-26 15:11:09,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2023-08-26 15:11:09,563 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-08-26 15:11:09,563 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 162 flow [2023-08-26 15:11:09,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 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 15:11:09,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:09,564 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] [2023-08-26 15:11:09,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:11:09,564 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:11:09,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:09,565 INFO L85 PathProgramCache]: Analyzing trace with hash 704004914, now seen corresponding path program 1 times [2023-08-26 15:11:09,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:09,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330955216] [2023-08-26 15:11:09,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:09,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:11:10,287 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 15:11:10,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:11:10,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330955216] [2023-08-26 15:11:10,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330955216] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:11:10,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:11:10,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 15:11:10,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563322902] [2023-08-26 15:11:10,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:11:10,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 15:11:10,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:11:10,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 15:11:10,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-26 15:11:10,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 238 [2023-08-26 15:11:10,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 162 flow. Second operand has 8 states, 8 states have (on average 98.375) internal successors, (787), 8 states have internal predecessors, (787), 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 15:11:10,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:11:10,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 238 [2023-08-26 15:11:10,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:11:10,532 INFO L124 PetriNetUnfolderBase]: 187/396 cut-off events. [2023-08-26 15:11:10,532 INFO L125 PetriNetUnfolderBase]: For 818/826 co-relation queries the response was YES. [2023-08-26 15:11:10,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1433 conditions, 396 events. 187/396 cut-off events. For 818/826 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1772 event pairs, 25 based on Foata normal form. 2/392 useless extension candidates. Maximal degree in co-relation 1421. Up to 143 conditions per place. [2023-08-26 15:11:10,535 INFO L140 encePairwiseOnDemand]: 230/238 looper letters, 49 selfloop transitions, 6 changer transitions 24/84 dead transitions. [2023-08-26 15:11:10,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 84 transitions, 629 flow [2023-08-26 15:11:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:11:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:11:10,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 826 transitions. [2023-08-26 15:11:10,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4338235294117647 [2023-08-26 15:11:10,538 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 826 transitions. [2023-08-26 15:11:10,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 826 transitions. [2023-08-26 15:11:10,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:11:10,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 826 transitions. [2023-08-26 15:11:10,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 103.25) internal successors, (826), 8 states have internal predecessors, (826), 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 15:11:10,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 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 15:11:10,543 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 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 15:11:10,543 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 162 flow. Second operand 8 states and 826 transitions. [2023-08-26 15:11:10,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 84 transitions, 629 flow [2023-08-26 15:11:10,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 84 transitions, 527 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-26 15:11:10,547 INFO L231 Difference]: Finished difference. Result has 54 places, 34 transitions, 174 flow [2023-08-26 15:11:10,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=174, PETRI_PLACES=54, PETRI_TRANSITIONS=34} [2023-08-26 15:11:10,548 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2023-08-26 15:11:10,548 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 34 transitions, 174 flow [2023-08-26 15:11:10,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.375) internal successors, (787), 8 states have internal predecessors, (787), 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 15:11:10,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:10,549 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] [2023-08-26 15:11:10,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:11:10,549 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:11:10,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:10,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1238335840, now seen corresponding path program 2 times [2023-08-26 15:11:10,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:10,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080252661] [2023-08-26 15:11:10,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:10,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:11:10,759 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 15:11:10,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:11:10,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080252661] [2023-08-26 15:11:10,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080252661] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:11:10,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:11:10,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:11:10,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150702788] [2023-08-26 15:11:10,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:11:10,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:11:10,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:11:10,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:11:10,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:11:10,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 238 [2023-08-26 15:11:10,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 34 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 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 15:11:10,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:11:10,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 238 [2023-08-26 15:11:10,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:11:10,904 INFO L124 PetriNetUnfolderBase]: 226/486 cut-off events. [2023-08-26 15:11:10,904 INFO L125 PetriNetUnfolderBase]: For 838/838 co-relation queries the response was YES. [2023-08-26 15:11:10,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1784 conditions, 486 events. 226/486 cut-off events. For 838/838 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2354 event pairs, 78 based on Foata normal form. 1/484 useless extension candidates. Maximal degree in co-relation 1768. Up to 195 conditions per place. [2023-08-26 15:11:10,907 INFO L140 encePairwiseOnDemand]: 234/238 looper letters, 27 selfloop transitions, 1 changer transitions 33/63 dead transitions. [2023-08-26 15:11:10,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 461 flow [2023-08-26 15:11:10,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:11:10,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:11:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2023-08-26 15:11:10,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45210084033613446 [2023-08-26 15:11:10,909 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2023-08-26 15:11:10,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2023-08-26 15:11:10,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:11:10,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2023-08-26 15:11:10,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 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 15:11:10,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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 15:11:10,912 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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 15:11:10,912 INFO L175 Difference]: Start difference. First operand has 54 places, 34 transitions, 174 flow. Second operand 5 states and 538 transitions. [2023-08-26 15:11:10,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 461 flow [2023-08-26 15:11:10,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 429 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-08-26 15:11:10,917 INFO L231 Difference]: Finished difference. Result has 52 places, 30 transitions, 146 flow [2023-08-26 15:11:10,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=52, PETRI_TRANSITIONS=30} [2023-08-26 15:11:10,918 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2023-08-26 15:11:10,918 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 30 transitions, 146 flow [2023-08-26 15:11:10,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 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 15:11:10,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:10,918 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] [2023-08-26 15:11:10,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 15:11:10,919 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:11:10,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:10,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1425994906, now seen corresponding path program 3 times [2023-08-26 15:11:10,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:10,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99039748] [2023-08-26 15:11:10,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:10,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:11:10,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:11:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:11:11,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:11:11,034 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:11:11,035 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (11 of 12 remaining) [2023-08-26 15:11:11,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (10 of 12 remaining) [2023-08-26 15:11:11,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-26 15:11:11,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-26 15:11:11,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-08-26 15:11:11,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-26 15:11:11,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-26 15:11:11,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-26 15:11:11,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-08-26 15:11:11,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-26 15:11:11,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-08-26 15:11:11,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (0 of 12 remaining) [2023-08-26 15:11:11,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 15:11:11,038 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1] [2023-08-26 15:11:11,043 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:11:11,043 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:11:11,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:11:11 BasicIcfg [2023-08-26 15:11:11,124 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:11:11,125 INFO L158 Benchmark]: Toolchain (without parser) took 10961.11ms. Allocated memory was 346.0MB in the beginning and 524.3MB in the end (delta: 178.3MB). Free memory was 320.8MB in the beginning and 389.8MB in the end (delta: -69.0MB). Peak memory consumption was 110.3MB. Max. memory is 16.0GB. [2023-08-26 15:11:11,125 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 346.0MB. Free memory is still 322.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:11:11,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.80ms. Allocated memory is still 346.0MB. Free memory was 320.8MB in the beginning and 297.8MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 15:11:11,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.48ms. Allocated memory is still 346.0MB. Free memory was 297.8MB in the beginning and 295.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:11:11,126 INFO L158 Benchmark]: Boogie Preprocessor took 28.32ms. Allocated memory is still 346.0MB. Free memory was 295.2MB in the beginning and 293.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:11:11,126 INFO L158 Benchmark]: RCFGBuilder took 739.62ms. Allocated memory is still 346.0MB. Free memory was 293.6MB in the beginning and 309.6MB in the end (delta: -16.0MB). Peak memory consumption was 29.3MB. Max. memory is 16.0GB. [2023-08-26 15:11:11,126 INFO L158 Benchmark]: TraceAbstraction took 9600.12ms. Allocated memory was 346.0MB in the beginning and 524.3MB in the end (delta: 178.3MB). Free memory was 308.4MB in the beginning and 389.8MB in the end (delta: -81.4MB). Peak memory consumption was 95.7MB. Max. memory is 16.0GB. [2023-08-26 15:11:11,127 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.15ms. Allocated memory is still 346.0MB. Free memory is still 322.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 525.80ms. Allocated memory is still 346.0MB. Free memory was 320.8MB in the beginning and 297.8MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 60.48ms. Allocated memory is still 346.0MB. Free memory was 297.8MB in the beginning and 295.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 28.32ms. Allocated memory is still 346.0MB. Free memory was 295.2MB in the beginning and 293.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 739.62ms. Allocated memory is still 346.0MB. Free memory was 293.6MB in the beginning and 309.6MB in the end (delta: -16.0MB). Peak memory consumption was 29.3MB. Max. memory is 16.0GB. * TraceAbstraction took 9600.12ms. Allocated memory was 346.0MB in the beginning and 524.3MB in the end (delta: 178.3MB). Free memory was 308.4MB in the beginning and 389.8MB in the end (delta: -81.4MB). Peak memory consumption was 95.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 126 PlacesBefore, 41 PlacesAfterwards, 119 TransitionsBefore, 32 TransitionsAfterwards, 2226 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 116 TotalNumberOfCompositions, 5692 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2526, independent: 2339, independent conditional: 0, independent unconditional: 2339, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1195, independent: 1163, independent conditional: 0, independent unconditional: 1163, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2526, independent: 1176, independent conditional: 0, independent unconditional: 1176, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 1195, unknown conditional: 0, unknown unconditional: 1195] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 88, Positive conditional cache size: 0, Positive unconditional cache size: 88, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff1_thd0; [L732] 0 _Bool x$r_buff1_thd1; [L733] 0 _Bool x$r_buff1_thd2; [L734] 0 _Bool x$r_buff1_thd3; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L841] 0 pthread_t t916; [L842] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t916, ((void *)0), P0, ((void *)0))=-1, t916={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L843] 0 pthread_t t917; [L844] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t917, ((void *)0), P1, ((void *)0))=0, t916={5:0}, t917={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L778] 2 x$w_buff1 = x$w_buff0 [L779] 2 x$w_buff0 = 1 [L780] 2 x$w_buff1_used = x$w_buff0_used [L781] 2 x$w_buff0_used = (_Bool)1 [L782] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L782] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L783] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L784] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L785] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L786] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L787] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L845] 0 pthread_t t918; [L790] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t918, ((void *)0), P2, ((void *)0))=1, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L807] 3 y = 1 [L810] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L813] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L816] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L753] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 1 x$flush_delayed = weak$$choice2 [L756] 1 x$mem_tmp = x [L757] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L758] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L759] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L760] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L761] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L763] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 __unbuffered_p0_EAX = x [L765] 1 x = x$flush_delayed ? x$mem_tmp : x [L766] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L819] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L820] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L821] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L822] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L823] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L793] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L853] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L854] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L855] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L856] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix035_power.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: 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: 842]: 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: 844]: 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: 846]: 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 7 procedures, 149 locations, 12 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: 9.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 256 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 996 IncrementalHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 26 mSDtfsCounter, 996 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=7, InterpolantAutomatonStates: 54, 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, 2.0s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 15:11:11,156 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...