/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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:13:32,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:13:32,101 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:13:32,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:13:32,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:13:32,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:13:32,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:13:32,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:13:32,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:13:32,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:13:32,155 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:13:32,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:13:32,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:13:32,157 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:13:32,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:13:32,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:13:32,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:13:32,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:13:32,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:13:32,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:13:32,158 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:13:32,159 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:13:32,159 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:13:32,160 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:13:32,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:13:32,160 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:13:32,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:13:32,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:13:32,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:13:32,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:13:32,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:13:32,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:13:32,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:13:32,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:13:32,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:13:32,163 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:13:32,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:13:32,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:13:32,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:13:32,528 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:13:32,528 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:13:32,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-26 15:13:33,779 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:13:34,105 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:13:34,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-26 15:13:34,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c2b0d2d8/4f3fb7a50ea8427bb0d85c201c0288f1/FLAGbf2e9ad63 [2023-08-26 15:13:34,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c2b0d2d8/4f3fb7a50ea8427bb0d85c201c0288f1 [2023-08-26 15:13:34,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:13:34,149 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:13:34,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:13:34,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:13:34,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:13:34,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:13:34" (1/1) ... [2023-08-26 15:13:34,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ee75c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:34, skipping insertion in model container [2023-08-26 15:13:34,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:13:34" (1/1) ... [2023-08-26 15:13:34,201 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:13:34,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:13:34,542 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:13:34,557 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:13:34,561 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:13:34,592 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:13:34,621 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:13:34,621 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:13:34,627 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:13:34,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:34 WrapperNode [2023-08-26 15:13:34,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:13:34,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:13:34,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:13:34,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:13:34,642 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:13:34" (1/1) ... [2023-08-26 15:13:34,659 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:13:34" (1/1) ... [2023-08-26 15:13:34,686 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2023-08-26 15:13:34,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:13:34,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:13:34,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:13:34,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:13:34,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:34" (1/1) ... [2023-08-26 15:13:34,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:34" (1/1) ... [2023-08-26 15:13:34,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:34" (1/1) ... [2023-08-26 15:13:34,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:34" (1/1) ... [2023-08-26 15:13:34,706 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:34" (1/1) ... [2023-08-26 15:13:34,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:34" (1/1) ... [2023-08-26 15:13:34,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:34" (1/1) ... [2023-08-26 15:13:34,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:34" (1/1) ... [2023-08-26 15:13:34,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:13:34,715 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:13:34,715 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:13:34,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:13:34,716 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:34" (1/1) ... [2023-08-26 15:13:34,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:13:34,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:13:34,750 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:13:34,757 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:13:34,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:13:34,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:13:34,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:13:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:13:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:13:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:13:34,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:13:34,791 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:13:34,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:13:34,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:13:34,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:13:34,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:13:34,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:13:34,793 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:13:34,913 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:13:34,915 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:13:35,263 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:13:35,375 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:13:35,375 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:13:35,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:13:35 BoogieIcfgContainer [2023-08-26 15:13:35,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:13:35,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:13:35,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:13:35,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:13:35,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:13:34" (1/3) ... [2023-08-26 15:13:35,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ee6634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:13:35, skipping insertion in model container [2023-08-26 15:13:35,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:13:34" (2/3) ... [2023-08-26 15:13:35,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ee6634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:13:35, skipping insertion in model container [2023-08-26 15:13:35,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:13:35" (3/3) ... [2023-08-26 15:13:35,389 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-26 15:13:35,406 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:13:35,406 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-26 15:13:35,407 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:13:35,470 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:13:35,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 95 transitions, 200 flow [2023-08-26 15:13:35,557 INFO L124 PetriNetUnfolderBase]: 3/93 cut-off events. [2023-08-26 15:13:35,558 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:13:35,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 3/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-26 15:13:35,562 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 95 transitions, 200 flow [2023-08-26 15:13:35,566 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 93 transitions, 192 flow [2023-08-26 15:13:35,569 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:13:35,576 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 93 transitions, 192 flow [2023-08-26 15:13:35,579 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 93 transitions, 192 flow [2023-08-26 15:13:35,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 93 transitions, 192 flow [2023-08-26 15:13:35,601 INFO L124 PetriNetUnfolderBase]: 3/93 cut-off events. [2023-08-26 15:13:35,601 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:13:35,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 3/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-26 15:13:35,603 INFO L119 LiptonReduction]: Number of co-enabled transitions 1168 [2023-08-26 15:13:38,913 INFO L134 LiptonReduction]: Checked pairs total: 3118 [2023-08-26 15:13:38,913 INFO L136 LiptonReduction]: Total number of compositions: 100 [2023-08-26 15:13:38,934 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:13:38,940 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;@4030f362, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:13:38,941 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-26 15:13:38,942 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:13:38,943 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 15:13:38,943 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:13:38,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:38,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:13:38,944 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:13:38,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:38,948 INFO L85 PathProgramCache]: Analyzing trace with hash 457, now seen corresponding path program 1 times [2023-08-26 15:13:38,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:38,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140904298] [2023-08-26 15:13:38,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:38,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:39,042 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:13:39,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:39,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140904298] [2023-08-26 15:13:39,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140904298] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:39,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:39,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:13:39,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306307457] [2023-08-26 15:13:39,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:39,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:13:39,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:39,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:13:39,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:13:39,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 195 [2023-08-26 15:13:39,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 54 flow. Second operand has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 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:13:39,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:39,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 195 [2023-08-26 15:13:39,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:39,209 INFO L124 PetriNetUnfolderBase]: 204/358 cut-off events. [2023-08-26 15:13:39,209 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 15:13:39,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 358 events. 204/358 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1460 event pairs, 204 based on Foata normal form. 20/303 useless extension candidates. Maximal degree in co-relation 715. Up to 354 conditions per place. [2023-08-26 15:13:39,216 INFO L140 encePairwiseOnDemand]: 190/195 looper letters, 17 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2023-08-26 15:13:39,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 19 transitions, 78 flow [2023-08-26 15:13:39,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:13:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:13:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 188 transitions. [2023-08-26 15:13:39,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48205128205128206 [2023-08-26 15:13:39,233 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 188 transitions. [2023-08-26 15:13:39,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 188 transitions. [2023-08-26 15:13:39,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:39,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 188 transitions. [2023-08-26 15:13:39,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 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:13:39,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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:13:39,248 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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:13:39,250 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 54 flow. Second operand 2 states and 188 transitions. [2023-08-26 15:13:39,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 19 transitions, 78 flow [2023-08-26 15:13:39,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 19 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:13:39,254 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 42 flow [2023-08-26 15:13:39,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-08-26 15:13:39,261 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -5 predicate places. [2023-08-26 15:13:39,261 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 42 flow [2023-08-26 15:13:39,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 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:13:39,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:39,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 15:13:39,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:13:39,263 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:13:39,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:39,263 INFO L85 PathProgramCache]: Analyzing trace with hash 433149493, now seen corresponding path program 1 times [2023-08-26 15:13:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:39,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777529544] [2023-08-26 15:13:39,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:39,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:39,615 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:13:39,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:39,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777529544] [2023-08-26 15:13:39,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777529544] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:39,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:39,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:13:39,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999626733] [2023-08-26 15:13:39,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:39,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:13:39,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:39,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:13:39,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:13:39,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 195 [2023-08-26 15:13:39,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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:13:39,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:39,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 195 [2023-08-26 15:13:39,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:39,707 INFO L124 PetriNetUnfolderBase]: 159/310 cut-off events. [2023-08-26 15:13:39,707 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:13:39,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 310 events. 159/310 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1349 event pairs, 24 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 600. Up to 220 conditions per place. [2023-08-26 15:13:39,712 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 19 selfloop transitions, 2 changer transitions 4/27 dead transitions. [2023-08-26 15:13:39,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 108 flow [2023-08-26 15:13:39,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:13:39,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:13:39,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2023-08-26 15:13:39,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46495726495726497 [2023-08-26 15:13:39,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 272 transitions. [2023-08-26 15:13:39,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 272 transitions. [2023-08-26 15:13:39,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:39,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 272 transitions. [2023-08-26 15:13:39,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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:13:39,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 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:13:39,724 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 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:13:39,724 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 42 flow. Second operand 3 states and 272 transitions. [2023-08-26 15:13:39,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 108 flow [2023-08-26 15:13:39,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:13:39,725 INFO L231 Difference]: Finished difference. Result has 26 places, 16 transitions, 40 flow [2023-08-26 15:13:39,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=26, PETRI_TRANSITIONS=16} [2023-08-26 15:13:39,726 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -4 predicate places. [2023-08-26 15:13:39,726 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 16 transitions, 40 flow [2023-08-26 15:13:39,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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:13:39,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:39,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:39,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:13:39,727 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:13:39,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:39,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1876764718, now seen corresponding path program 1 times [2023-08-26 15:13:39,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:39,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319372028] [2023-08-26 15:13:39,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:39,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:40,341 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:13:40,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:40,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319372028] [2023-08-26 15:13:40,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319372028] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:40,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:40,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:13:40,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139599601] [2023-08-26 15:13:40,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:40,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:13:40,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:40,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:13:40,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:13:40,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 195 [2023-08-26 15:13:40,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 16 transitions, 40 flow. Second operand has 5 states, 5 states have (on average 77.6) internal successors, (388), 5 states have internal predecessors, (388), 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:13:40,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:40,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 195 [2023-08-26 15:13:40,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:40,501 INFO L124 PetriNetUnfolderBase]: 149/293 cut-off events. [2023-08-26 15:13:40,501 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-08-26 15:13:40,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 293 events. 149/293 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1170 event pairs, 70 based on Foata normal form. 20/313 useless extension candidates. Maximal degree in co-relation 608. Up to 229 conditions per place. [2023-08-26 15:13:40,504 INFO L140 encePairwiseOnDemand]: 190/195 looper letters, 19 selfloop transitions, 3 changer transitions 11/34 dead transitions. [2023-08-26 15:13:40,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 34 transitions, 150 flow [2023-08-26 15:13:40,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:13:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:13:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 415 transitions. [2023-08-26 15:13:40,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4256410256410256 [2023-08-26 15:13:40,507 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 415 transitions. [2023-08-26 15:13:40,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 415 transitions. [2023-08-26 15:13:40,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:40,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 415 transitions. [2023-08-26 15:13:40,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:40,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 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:13:40,512 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 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:13:40,512 INFO L175 Difference]: Start difference. First operand has 26 places, 16 transitions, 40 flow. Second operand 5 states and 415 transitions. [2023-08-26 15:13:40,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 34 transitions, 150 flow [2023-08-26 15:13:40,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:13:40,514 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 63 flow [2023-08-26 15:13:40,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2023-08-26 15:13:40,516 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-08-26 15:13:40,516 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 63 flow [2023-08-26 15:13:40,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.6) internal successors, (388), 5 states have internal predecessors, (388), 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:13:40,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:40,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:40,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:13:40,520 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:13:40,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:40,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1949819395, now seen corresponding path program 1 times [2023-08-26 15:13:40,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:40,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637049558] [2023-08-26 15:13:40,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:40,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:41,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:13:41,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:41,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637049558] [2023-08-26 15:13:41,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637049558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:41,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:41,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:13:41,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873786063] [2023-08-26 15:13:41,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:41,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:13:41,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:41,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:13:41,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:13:41,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 195 [2023-08-26 15:13:41,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 63 flow. Second operand has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 states have internal predecessors, (465), 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:13:41,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:41,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 195 [2023-08-26 15:13:41,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:41,135 INFO L124 PetriNetUnfolderBase]: 137/270 cut-off events. [2023-08-26 15:13:41,135 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2023-08-26 15:13:41,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 270 events. 137/270 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1033 event pairs, 63 based on Foata normal form. 15/285 useless extension candidates. Maximal degree in co-relation 672. Up to 204 conditions per place. [2023-08-26 15:13:41,138 INFO L140 encePairwiseOnDemand]: 189/195 looper letters, 22 selfloop transitions, 5 changer transitions 10/38 dead transitions. [2023-08-26 15:13:41,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 193 flow [2023-08-26 15:13:41,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:13:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:13:41,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 495 transitions. [2023-08-26 15:13:41,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2023-08-26 15:13:41,141 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 495 transitions. [2023-08-26 15:13:41,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 495 transitions. [2023-08-26 15:13:41,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:41,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 495 transitions. [2023-08-26 15:13:41,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 82.5) internal successors, (495), 6 states have internal predecessors, (495), 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:13:41,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 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:13:41,145 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 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:13:41,145 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 63 flow. Second operand 6 states and 495 transitions. [2023-08-26 15:13:41,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 193 flow [2023-08-26 15:13:41,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 38 transitions, 188 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 15:13:41,148 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 93 flow [2023-08-26 15:13:41,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=93, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2023-08-26 15:13:41,150 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2023-08-26 15:13:41,150 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 93 flow [2023-08-26 15:13:41,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 states have internal predecessors, (465), 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:13:41,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:41,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:41,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:13:41,151 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:13:41,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:41,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1286038061, now seen corresponding path program 1 times [2023-08-26 15:13:41,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:41,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012080619] [2023-08-26 15:13:41,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:41,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:41,403 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:13:41,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:41,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012080619] [2023-08-26 15:13:41,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012080619] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:41,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:41,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:13:41,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295830238] [2023-08-26 15:13:41,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:41,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:13:41,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:41,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:13:41,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:13:41,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 195 [2023-08-26 15:13:41,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 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:13:41,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:41,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 195 [2023-08-26 15:13:41,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:41,550 INFO L124 PetriNetUnfolderBase]: 135/273 cut-off events. [2023-08-26 15:13:41,550 INFO L125 PetriNetUnfolderBase]: For 331/331 co-relation queries the response was YES. [2023-08-26 15:13:41,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 273 events. 135/273 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1064 event pairs, 22 based on Foata normal form. 12/285 useless extension candidates. Maximal degree in co-relation 780. Up to 181 conditions per place. [2023-08-26 15:13:41,552 INFO L140 encePairwiseOnDemand]: 188/195 looper letters, 25 selfloop transitions, 7 changer transitions 9/42 dead transitions. [2023-08-26 15:13:41,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 251 flow [2023-08-26 15:13:41,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:13:41,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:13:41,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 587 transitions. [2023-08-26 15:13:41,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43003663003663006 [2023-08-26 15:13:41,555 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 587 transitions. [2023-08-26 15:13:41,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 587 transitions. [2023-08-26 15:13:41,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:41,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 587 transitions. [2023-08-26 15:13:41,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 83.85714285714286) internal successors, (587), 7 states have internal predecessors, (587), 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:13:41,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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:13:41,560 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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:13:41,560 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 93 flow. Second operand 7 states and 587 transitions. [2023-08-26 15:13:41,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 251 flow [2023-08-26 15:13:41,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 236 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-26 15:13:41,563 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 122 flow [2023-08-26 15:13:41,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=122, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2023-08-26 15:13:41,563 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2023-08-26 15:13:41,564 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 122 flow [2023-08-26 15:13:41,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 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:13:41,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:41,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:41,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:13:41,564 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:13:41,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:41,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1284337091, now seen corresponding path program 2 times [2023-08-26 15:13:41,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:41,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218875609] [2023-08-26 15:13:41,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:41,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:41,983 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:13:41,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:41,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218875609] [2023-08-26 15:13:41,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218875609] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:41,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:41,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:13:41,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265992392] [2023-08-26 15:13:41,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:41,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:13:41,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:41,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:13:41,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:13:41,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 195 [2023-08-26 15:13:41,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 122 flow. Second operand has 7 states, 7 states have (on average 71.42857142857143) internal successors, (500), 7 states have internal predecessors, (500), 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:13:41,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:41,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 195 [2023-08-26 15:13:41,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:42,168 INFO L124 PetriNetUnfolderBase]: 102/201 cut-off events. [2023-08-26 15:13:42,168 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2023-08-26 15:13:42,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 201 events. 102/201 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 694 event pairs, 38 based on Foata normal form. 8/209 useless extension candidates. Maximal degree in co-relation 681. Up to 166 conditions per place. [2023-08-26 15:13:42,170 INFO L140 encePairwiseOnDemand]: 188/195 looper letters, 23 selfloop transitions, 7 changer transitions 4/35 dead transitions. [2023-08-26 15:13:42,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 239 flow [2023-08-26 15:13:42,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:13:42,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:13:42,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 525 transitions. [2023-08-26 15:13:42,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2023-08-26 15:13:42,173 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 525 transitions. [2023-08-26 15:13:42,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 525 transitions. [2023-08-26 15:13:42,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:42,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 525 transitions. [2023-08-26 15:13:42,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:42,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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:13:42,177 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 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:13:42,177 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 122 flow. Second operand 7 states and 525 transitions. [2023-08-26 15:13:42,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 239 flow [2023-08-26 15:13:42,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 219 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-26 15:13:42,181 INFO L231 Difference]: Finished difference. Result has 43 places, 24 transitions, 145 flow [2023-08-26 15:13:42,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=145, PETRI_PLACES=43, PETRI_TRANSITIONS=24} [2023-08-26 15:13:42,181 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2023-08-26 15:13:42,182 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 24 transitions, 145 flow [2023-08-26 15:13:42,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 71.42857142857143) internal successors, (500), 7 states have internal predecessors, (500), 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:13:42,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:42,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:42,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:13:42,183 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:13:42,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:42,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1437101602, now seen corresponding path program 1 times [2023-08-26 15:13:42,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:42,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726041898] [2023-08-26 15:13:42,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:42,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:42,709 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:13:42,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:42,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726041898] [2023-08-26 15:13:42,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726041898] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:42,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:42,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:13:42,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217715569] [2023-08-26 15:13:42,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:42,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:13:42,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:42,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:13:42,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:13:42,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 195 [2023-08-26 15:13:42,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 24 transitions, 145 flow. Second operand has 7 states, 7 states have (on average 75.57142857142857) internal successors, (529), 7 states have internal predecessors, (529), 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:13:42,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:42,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 195 [2023-08-26 15:13:42,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:42,875 INFO L124 PetriNetUnfolderBase]: 102/203 cut-off events. [2023-08-26 15:13:42,875 INFO L125 PetriNetUnfolderBase]: For 567/567 co-relation queries the response was YES. [2023-08-26 15:13:42,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 203 events. 102/203 cut-off events. For 567/567 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 695 event pairs, 26 based on Foata normal form. 9/212 useless extension candidates. Maximal degree in co-relation 754. Up to 145 conditions per place. [2023-08-26 15:13:42,876 INFO L140 encePairwiseOnDemand]: 188/195 looper letters, 25 selfloop transitions, 10 changer transitions 7/43 dead transitions. [2023-08-26 15:13:42,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 317 flow [2023-08-26 15:13:42,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:13:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:13:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 634 transitions. [2023-08-26 15:13:42,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064102564102564 [2023-08-26 15:13:42,879 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 634 transitions. [2023-08-26 15:13:42,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 634 transitions. [2023-08-26 15:13:42,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:42,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 634 transitions. [2023-08-26 15:13:42,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 79.25) internal successors, (634), 8 states have internal predecessors, (634), 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:13:42,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 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:13:42,884 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 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:13:42,884 INFO L175 Difference]: Start difference. First operand has 43 places, 24 transitions, 145 flow. Second operand 8 states and 634 transitions. [2023-08-26 15:13:42,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 317 flow [2023-08-26 15:13:42,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 297 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-26 15:13:42,890 INFO L231 Difference]: Finished difference. Result has 46 places, 26 transitions, 176 flow [2023-08-26 15:13:42,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=176, PETRI_PLACES=46, PETRI_TRANSITIONS=26} [2023-08-26 15:13:42,892 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 16 predicate places. [2023-08-26 15:13:42,892 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 26 transitions, 176 flow [2023-08-26 15:13:42,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.57142857142857) internal successors, (529), 7 states have internal predecessors, (529), 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:13:42,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:42,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:42,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:13:42,894 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:13:42,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:42,895 INFO L85 PathProgramCache]: Analyzing trace with hash -944612, now seen corresponding path program 1 times [2023-08-26 15:13:42,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:42,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677820577] [2023-08-26 15:13:42,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:42,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:43,028 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:13:43,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:43,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677820577] [2023-08-26 15:13:43,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677820577] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:43,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:43,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:13:43,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447573912] [2023-08-26 15:13:43,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:43,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:13:43,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:43,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:13:43,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:13:43,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 195 [2023-08-26 15:13:43,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 26 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 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:13:43,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:43,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 195 [2023-08-26 15:13:43,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:43,082 INFO L124 PetriNetUnfolderBase]: 41/106 cut-off events. [2023-08-26 15:13:43,082 INFO L125 PetriNetUnfolderBase]: For 311/312 co-relation queries the response was YES. [2023-08-26 15:13:43,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 106 events. 41/106 cut-off events. For 311/312 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 302 event pairs, 16 based on Foata normal form. 8/113 useless extension candidates. Maximal degree in co-relation 424. Up to 70 conditions per place. [2023-08-26 15:13:43,083 INFO L140 encePairwiseOnDemand]: 191/195 looper letters, 25 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2023-08-26 15:13:43,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 33 transitions, 268 flow [2023-08-26 15:13:43,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:13:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:13:43,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2023-08-26 15:13:43,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-08-26 15:13:43,085 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 260 transitions. [2023-08-26 15:13:43,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 260 transitions. [2023-08-26 15:13:43,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:43,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 260 transitions. [2023-08-26 15:13:43,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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:13:43,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 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:13:43,087 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 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:13:43,087 INFO L175 Difference]: Start difference. First operand has 46 places, 26 transitions, 176 flow. Second operand 3 states and 260 transitions. [2023-08-26 15:13:43,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 33 transitions, 268 flow [2023-08-26 15:13:43,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 33 transitions, 242 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-26 15:13:43,090 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 174 flow [2023-08-26 15:13:43,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-26 15:13:43,092 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2023-08-26 15:13:43,093 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 174 flow [2023-08-26 15:13:43,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 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:13:43,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:43,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:43,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:13:43,094 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:13:43,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:43,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1363669394, now seen corresponding path program 1 times [2023-08-26 15:13:43,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:43,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333763563] [2023-08-26 15:13:43,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:43,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:43,265 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:13:43,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:43,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333763563] [2023-08-26 15:13:43,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333763563] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:43,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:43,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:13:43,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693307920] [2023-08-26 15:13:43,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:43,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:13:43,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:43,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:13:43,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:13:43,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 195 [2023-08-26 15:13:43,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 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:13:43,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:43,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 195 [2023-08-26 15:13:43,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:43,320 INFO L124 PetriNetUnfolderBase]: 17/56 cut-off events. [2023-08-26 15:13:43,320 INFO L125 PetriNetUnfolderBase]: For 119/120 co-relation queries the response was YES. [2023-08-26 15:13:43,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 56 events. 17/56 cut-off events. For 119/120 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 122 event pairs, 6 based on Foata normal form. 7/62 useless extension candidates. Maximal degree in co-relation 210. Up to 26 conditions per place. [2023-08-26 15:13:43,321 INFO L140 encePairwiseOnDemand]: 191/195 looper letters, 23 selfloop transitions, 6 changer transitions 0/33 dead transitions. [2023-08-26 15:13:43,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 33 transitions, 260 flow [2023-08-26 15:13:43,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:13:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:13:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 339 transitions. [2023-08-26 15:13:43,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4346153846153846 [2023-08-26 15:13:43,322 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 339 transitions. [2023-08-26 15:13:43,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 339 transitions. [2023-08-26 15:13:43,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:43,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 339 transitions. [2023-08-26 15:13:43,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 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:13:43,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 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:13:43,325 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 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:13:43,325 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 174 flow. Second operand 4 states and 339 transitions. [2023-08-26 15:13:43,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 33 transitions, 260 flow [2023-08-26 15:13:43,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 209 flow, removed 21 selfloop flow, removed 6 redundant places. [2023-08-26 15:13:43,327 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 150 flow [2023-08-26 15:13:43,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-26 15:13:43,328 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2023-08-26 15:13:43,328 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 150 flow [2023-08-26 15:13:43,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 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:13:43,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:43,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:43,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:13:43,329 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:13:43,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:43,329 INFO L85 PathProgramCache]: Analyzing trace with hash -230767750, now seen corresponding path program 1 times [2023-08-26 15:13:43,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:43,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868239142] [2023-08-26 15:13:43,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:43,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:43,634 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:13:43,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:43,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868239142] [2023-08-26 15:13:43,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868239142] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:43,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:43,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 15:13:43,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728988049] [2023-08-26 15:13:43,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:43,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 15:13:43,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:43,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 15:13:43,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-26 15:13:43,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 195 [2023-08-26 15:13:43,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 150 flow. Second operand has 8 states, 8 states have (on average 74.0) internal successors, (592), 8 states have internal predecessors, (592), 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:13:43,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:43,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 195 [2023-08-26 15:13:43,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:43,774 INFO L124 PetriNetUnfolderBase]: 29/84 cut-off events. [2023-08-26 15:13:43,774 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2023-08-26 15:13:43,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 84 events. 29/84 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 214 event pairs, 1 based on Foata normal form. 1/85 useless extension candidates. Maximal degree in co-relation 305. Up to 32 conditions per place. [2023-08-26 15:13:43,775 INFO L140 encePairwiseOnDemand]: 188/195 looper letters, 21 selfloop transitions, 3 changer transitions 27/51 dead transitions. [2023-08-26 15:13:43,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 367 flow [2023-08-26 15:13:43,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:13:43,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:13:43,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 614 transitions. [2023-08-26 15:13:43,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935897435897436 [2023-08-26 15:13:43,778 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 614 transitions. [2023-08-26 15:13:43,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 614 transitions. [2023-08-26 15:13:43,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:43,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 614 transitions. [2023-08-26 15:13:43,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 76.75) internal successors, (614), 8 states have internal predecessors, (614), 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:13:43,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 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:13:43,782 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 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:13:43,782 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 150 flow. Second operand 8 states and 614 transitions. [2023-08-26 15:13:43,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 367 flow [2023-08-26 15:13:43,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 347 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 15:13:43,784 INFO L231 Difference]: Finished difference. Result has 48 places, 22 transitions, 113 flow [2023-08-26 15:13:43,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=113, PETRI_PLACES=48, PETRI_TRANSITIONS=22} [2023-08-26 15:13:43,785 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2023-08-26 15:13:43,785 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 22 transitions, 113 flow [2023-08-26 15:13:43,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 74.0) internal successors, (592), 8 states have internal predecessors, (592), 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:13:43,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:43,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:43,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:13:43,786 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:13:43,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:43,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2062923742, now seen corresponding path program 2 times [2023-08-26 15:13:43,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:43,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563550444] [2023-08-26 15:13:43,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:43,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:13:43,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:13:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:13:43,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:13:43,860 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:13:43,861 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONASSERT (8 of 9 remaining) [2023-08-26 15:13:43,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (7 of 9 remaining) [2023-08-26 15:13:43,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2023-08-26 15:13:43,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-08-26 15:13:43,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2023-08-26 15:13:43,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2023-08-26 15:13:43,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-08-26 15:13:43,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2023-08-26 15:13:43,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (0 of 9 remaining) [2023-08-26 15:13:43,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 15:13:43,864 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:43,869 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:13:43,869 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:13:43,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:13:43 BasicIcfg [2023-08-26 15:13:43,907 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:13:43,907 INFO L158 Benchmark]: Toolchain (without parser) took 9758.67ms. Allocated memory was 375.4MB in the beginning and 625.0MB in the end (delta: 249.6MB). Free memory was 349.0MB in the beginning and 423.1MB in the end (delta: -74.1MB). Peak memory consumption was 176.7MB. Max. memory is 16.0GB. [2023-08-26 15:13:43,907 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 375.4MB. Free memory is still 350.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:13:43,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.11ms. Allocated memory is still 375.4MB. Free memory was 348.7MB in the beginning and 326.3MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-26 15:13:43,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.01ms. Allocated memory is still 375.4MB. Free memory was 326.3MB in the beginning and 323.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 15:13:43,908 INFO L158 Benchmark]: Boogie Preprocessor took 27.55ms. Allocated memory is still 375.4MB. Free memory was 323.6MB in the beginning and 321.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:13:43,908 INFO L158 Benchmark]: RCFGBuilder took 662.59ms. Allocated memory was 375.4MB in the beginning and 520.1MB in the end (delta: 144.7MB). Free memory was 321.7MB in the beginning and 473.4MB in the end (delta: -151.7MB). Peak memory consumption was 16.4MB. Max. memory is 16.0GB. [2023-08-26 15:13:43,908 INFO L158 Benchmark]: TraceAbstraction took 8527.25ms. Allocated memory was 520.1MB in the beginning and 625.0MB in the end (delta: 104.9MB). Free memory was 472.7MB in the beginning and 423.1MB in the end (delta: 49.6MB). Peak memory consumption was 156.2MB. Max. memory is 16.0GB. [2023-08-26 15:13:43,909 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.14ms. Allocated memory is still 375.4MB. Free memory is still 350.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 478.11ms. Allocated memory is still 375.4MB. Free memory was 348.7MB in the beginning and 326.3MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 58.01ms. Allocated memory is still 375.4MB. Free memory was 326.3MB in the beginning and 323.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.55ms. Allocated memory is still 375.4MB. Free memory was 323.6MB in the beginning and 321.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 662.59ms. Allocated memory was 375.4MB in the beginning and 520.1MB in the end (delta: 144.7MB). Free memory was 321.7MB in the beginning and 473.4MB in the end (delta: -151.7MB). Peak memory consumption was 16.4MB. Max. memory is 16.0GB. * TraceAbstraction took 8527.25ms. Allocated memory was 520.1MB in the beginning and 625.0MB in the end (delta: 104.9MB). Free memory was 472.7MB in the beginning and 423.1MB in the end (delta: 49.6MB). Peak memory consumption was 156.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 97 PlacesBefore, 30 PlacesAfterwards, 93 TransitionsBefore, 24 TransitionsAfterwards, 1168 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 100 TotalNumberOfCompositions, 3118 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1740, independent: 1600, independent conditional: 0, independent unconditional: 1600, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 654, independent: 638, independent conditional: 0, independent unconditional: 638, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1740, independent: 962, independent conditional: 0, independent unconditional: 962, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 654, unknown conditional: 0, unknown unconditional: 654] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1447, ((void *)0), P0, ((void *)0))=-2, t1447={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1448, ((void *)0), P1, ((void *)0))=-1, t1447={5:0}, t1448={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=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L770] 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) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 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 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 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) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 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 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=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=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 795]: 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: 793]: 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 5 procedures, 112 locations, 9 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: 8.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 654 IncrementalHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 11 mSDtfsCounter, 654 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=7, InterpolantAutomatonStates: 53, 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.9s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 637 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 15:13:43,931 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...