/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/mix034_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:10:52,890 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:10:52,947 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 15:10:52,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:10:52,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:10:52,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:10:52,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:10:52,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:10:52,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:10:52,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:10:52,971 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:10:52,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:10:52,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:10:52,973 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:10:52,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:10:52,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:10:52,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:10:52,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:10:52,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:10:52,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:10:52,974 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:10:52,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:10:52,974 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:10:52,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:10:52,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:10:52,975 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:10:52,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:10:52,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:10:52,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:10:52,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:10:52,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:10:52,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:10:52,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:10:52,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:10:52,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:10:52,977 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 15:10:53,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:10:53,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:10:53,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:10:53,269 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:10:53,269 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:10:53,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i [2023-08-26 15:10:54,219 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:10:54,466 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:10:54,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i [2023-08-26 15:10:54,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/082d8db3f/e630452e0a384eeeb077a4ef1dcfc3d0/FLAG7b9acb6b4 [2023-08-26 15:10:54,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/082d8db3f/e630452e0a384eeeb077a4ef1dcfc3d0 [2023-08-26 15:10:54,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:10:54,499 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:10:54,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:10:54,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:10:54,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:10:54,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:10:54" (1/1) ... [2023-08-26 15:10:54,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69428413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:54, skipping insertion in model container [2023-08-26 15:10:54,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:10:54" (1/1) ... [2023-08-26 15:10:54,541 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:10:54,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:10:54,820 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:10:54,846 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 15:10:54,847 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 15:10:54,881 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:10:54,908 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:10:54,909 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:10:54,913 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:10:54,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:54 WrapperNode [2023-08-26 15:10:54,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:10:54,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:10:54,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:10:54,916 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:10:54,921 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:10:54" (1/1) ... [2023-08-26 15:10:54,948 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:10:54" (1/1) ... [2023-08-26 15:10:54,974 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 127 [2023-08-26 15:10:54,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:10:54,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:10:54,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:10:54,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:10:54,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:54" (1/1) ... [2023-08-26 15:10:54,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:54" (1/1) ... [2023-08-26 15:10:54,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:54" (1/1) ... [2023-08-26 15:10:54,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:54" (1/1) ... [2023-08-26 15:10:55,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:54" (1/1) ... [2023-08-26 15:10:55,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:54" (1/1) ... [2023-08-26 15:10:55,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:54" (1/1) ... [2023-08-26 15:10:55,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:54" (1/1) ... [2023-08-26 15:10:55,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:10:55,014 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:10:55,014 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:10:55,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:10:55,015 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:54" (1/1) ... [2023-08-26 15:10:55,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:10:55,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:10:55,091 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:10:55,097 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:10:55,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:10:55,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:10:55,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:10:55,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:10:55,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:10:55,124 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:10:55,124 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:10:55,124 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:10:55,124 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:10:55,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:10:55,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:10:55,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:10:55,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:10:55,126 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:10:55,215 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:10:55,217 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:10:55,496 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:10:55,599 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:10:55,600 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:10:55,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:10:55 BoogieIcfgContainer [2023-08-26 15:10:55,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:10:55,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:10:55,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:10:55,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:10:55,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:10:54" (1/3) ... [2023-08-26 15:10:55,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aece1c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:10:55, skipping insertion in model container [2023-08-26 15:10:55,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:10:54" (2/3) ... [2023-08-26 15:10:55,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aece1c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:10:55, skipping insertion in model container [2023-08-26 15:10:55,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:10:55" (3/3) ... [2023-08-26 15:10:55,607 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt_tso.opt.i [2023-08-26 15:10:55,619 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:10:55,619 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-26 15:10:55,619 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:10:55,646 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:10:55,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 99 transitions, 208 flow [2023-08-26 15:10:55,695 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-08-26 15:10:55,696 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:10:55,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-26 15:10:55,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 99 transitions, 208 flow [2023-08-26 15:10:55,702 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 97 transitions, 200 flow [2023-08-26 15:10:55,704 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:10:55,710 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 97 transitions, 200 flow [2023-08-26 15:10:55,715 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 97 transitions, 200 flow [2023-08-26 15:10:55,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 97 transitions, 200 flow [2023-08-26 15:10:55,743 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-08-26 15:10:55,743 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:10:55,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-26 15:10:55,745 INFO L119 LiptonReduction]: Number of co-enabled transitions 1220 [2023-08-26 15:10:58,739 INFO L134 LiptonReduction]: Checked pairs total: 3073 [2023-08-26 15:10:58,739 INFO L136 LiptonReduction]: Total number of compositions: 101 [2023-08-26 15:10:58,748 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:10:58,752 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;@123341ec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:10:58,752 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-26 15:10:58,753 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:10:58,753 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 15:10:58,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:10:58,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:58,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:10:58,753 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:10:58,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:58,756 INFO L85 PathProgramCache]: Analyzing trace with hash 460, now seen corresponding path program 1 times [2023-08-26 15:10:58,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:58,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200648098] [2023-08-26 15:10:58,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:58,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:58,824 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:10:58,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:58,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200648098] [2023-08-26 15:10:58,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200648098] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:58,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:58,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:10:58,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717646752] [2023-08-26 15:10:58,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:58,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:10:58,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:58,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:10:58,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:10:58,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 200 [2023-08-26 15:10:58,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 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:10:58,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:58,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 200 [2023-08-26 15:10:58,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:58,914 INFO L124 PetriNetUnfolderBase]: 173/310 cut-off events. [2023-08-26 15:10:58,914 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 15:10:58,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 310 events. 173/310 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1124 event pairs, 173 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 616. Up to 303 conditions per place. [2023-08-26 15:10:58,917 INFO L140 encePairwiseOnDemand]: 195/200 looper letters, 16 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2023-08-26 15:10:58,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 17 transitions, 72 flow [2023-08-26 15:10:58,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:10:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:10:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 197 transitions. [2023-08-26 15:10:58,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925 [2023-08-26 15:10:58,926 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 197 transitions. [2023-08-26 15:10:58,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 197 transitions. [2023-08-26 15:10:58,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:58,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 197 transitions. [2023-08-26 15:10:58,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 98.5) internal successors, (197), 2 states have internal predecessors, (197), 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:10:58,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 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:10:58,934 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 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:10:58,935 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 2 states and 197 transitions. [2023-08-26 15:10:58,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 17 transitions, 72 flow [2023-08-26 15:10:58,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 17 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:10:58,938 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 38 flow [2023-08-26 15:10:58,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2023-08-26 15:10:58,941 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, -5 predicate places. [2023-08-26 15:10:58,941 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 38 flow [2023-08-26 15:10:58,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 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:10:58,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:58,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 15:10:58,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:10:58,942 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:10:58,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:58,942 INFO L85 PathProgramCache]: Analyzing trace with hash 436908996, now seen corresponding path program 1 times [2023-08-26 15:10:58,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:58,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331317863] [2023-08-26 15:10:58,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:58,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:59,125 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:10:59,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:59,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331317863] [2023-08-26 15:10:59,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331317863] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:59,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:59,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:10:59,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447109409] [2023-08-26 15:10:59,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:59,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:10:59,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:59,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:10:59,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:10:59,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-26 15:10:59,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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:10:59,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:59,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-26 15:10:59,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:59,195 INFO L124 PetriNetUnfolderBase]: 142/271 cut-off events. [2023-08-26 15:10:59,196 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:10:59,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 271 events. 142/271 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 996 event pairs, 18 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 532. Up to 205 conditions per place. [2023-08-26 15:10:59,200 INFO L140 encePairwiseOnDemand]: 197/200 looper letters, 18 selfloop transitions, 2 changer transitions 2/23 dead transitions. [2023-08-26 15:10:59,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 23 transitions, 94 flow [2023-08-26 15:10:59,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:10:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:10:59,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2023-08-26 15:10:59,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2023-08-26 15:10:59,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 284 transitions. [2023-08-26 15:10:59,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 284 transitions. [2023-08-26 15:10:59,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:59,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 284 transitions. [2023-08-26 15:10:59,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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:10:59,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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:10:59,211 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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:10:59,211 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 38 flow. Second operand 3 states and 284 transitions. [2023-08-26 15:10:59,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 23 transitions, 94 flow [2023-08-26 15:10:59,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:10:59,212 INFO L231 Difference]: Finished difference. Result has 24 places, 15 transitions, 38 flow [2023-08-26 15:10:59,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=24, PETRI_TRANSITIONS=15} [2023-08-26 15:10:59,215 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, -4 predicate places. [2023-08-26 15:10:59,216 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 15 transitions, 38 flow [2023-08-26 15:10:59,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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:10:59,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:59,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:10:59,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:10:59,218 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:10:59,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:59,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1037193546, now seen corresponding path program 1 times [2023-08-26 15:10:59,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:59,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216232500] [2023-08-26 15:10:59,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:59,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:59,473 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:10:59,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:59,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216232500] [2023-08-26 15:10:59,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216232500] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:59,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:59,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:10:59,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909522516] [2023-08-26 15:10:59,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:59,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:10:59,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:59,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:10:59,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:10:59,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-08-26 15:10:59,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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:10:59,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:59,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-08-26 15:10:59,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:59,516 INFO L124 PetriNetUnfolderBase]: 97/190 cut-off events. [2023-08-26 15:10:59,516 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 15:10:59,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 190 events. 97/190 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 611 event pairs, 37 based on Foata normal form. 8/198 useless extension candidates. Maximal degree in co-relation 391. Up to 117 conditions per place. [2023-08-26 15:10:59,517 INFO L140 encePairwiseOnDemand]: 197/200 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2023-08-26 15:10:59,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 20 transitions, 86 flow [2023-08-26 15:10:59,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:10:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:10:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2023-08-26 15:10:59,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2023-08-26 15:10:59,521 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2023-08-26 15:10:59,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2023-08-26 15:10:59,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:59,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2023-08-26 15:10:59,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:59,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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:10:59,523 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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:10:59,523 INFO L175 Difference]: Start difference. First operand has 24 places, 15 transitions, 38 flow. Second operand 3 states and 275 transitions. [2023-08-26 15:10:59,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 20 transitions, 86 flow [2023-08-26 15:10:59,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 20 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:10:59,524 INFO L231 Difference]: Finished difference. Result has 24 places, 15 transitions, 42 flow [2023-08-26 15:10:59,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=24, PETRI_TRANSITIONS=15} [2023-08-26 15:10:59,525 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, -4 predicate places. [2023-08-26 15:10:59,525 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 15 transitions, 42 flow [2023-08-26 15:10:59,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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:10:59,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:59,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:10:59,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:10:59,528 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:10:59,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:59,529 INFO L85 PathProgramCache]: Analyzing trace with hash -351332292, now seen corresponding path program 1 times [2023-08-26 15:10:59,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:59,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131728757] [2023-08-26 15:10:59,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:59,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:59,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:10:59,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:59,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131728757] [2023-08-26 15:10:59,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131728757] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:59,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:59,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:10:59,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369013334] [2023-08-26 15:10:59,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:59,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:10:59,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:59,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:10:59,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:10:59,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 200 [2023-08-26 15:10:59,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:59,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:59,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 200 [2023-08-26 15:10:59,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:59,796 INFO L124 PetriNetUnfolderBase]: 60/134 cut-off events. [2023-08-26 15:10:59,796 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-26 15:10:59,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 134 events. 60/134 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 426 event pairs, 13 based on Foata normal form. 20/154 useless extension candidates. Maximal degree in co-relation 302. Up to 60 conditions per place. [2023-08-26 15:10:59,797 INFO L140 encePairwiseOnDemand]: 195/200 looper letters, 20 selfloop transitions, 3 changer transitions 15/39 dead transitions. [2023-08-26 15:10:59,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 39 transitions, 177 flow [2023-08-26 15:10:59,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:10:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:10:59,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2023-08-26 15:10:59,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2023-08-26 15:10:59,798 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 440 transitions. [2023-08-26 15:10:59,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 440 transitions. [2023-08-26 15:10:59,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:59,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 440 transitions. [2023-08-26 15:10:59,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 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:10:59,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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:10:59,801 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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:10:59,801 INFO L175 Difference]: Start difference. First operand has 24 places, 15 transitions, 42 flow. Second operand 5 states and 440 transitions. [2023-08-26 15:10:59,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 39 transitions, 177 flow [2023-08-26 15:10:59,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 39 transitions, 167 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:10:59,802 INFO L231 Difference]: Finished difference. Result has 29 places, 17 transitions, 65 flow [2023-08-26 15:10:59,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=65, PETRI_PLACES=29, PETRI_TRANSITIONS=17} [2023-08-26 15:10:59,803 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2023-08-26 15:10:59,803 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 17 transitions, 65 flow [2023-08-26 15:10:59,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:59,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:59,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:10:59,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:10:59,804 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:10:59,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1525884074, now seen corresponding path program 1 times [2023-08-26 15:10:59,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:59,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874510037] [2023-08-26 15:10:59,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:59,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:59,953 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:10:59,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:59,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874510037] [2023-08-26 15:10:59,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874510037] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:59,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:59,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:10:59,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051791103] [2023-08-26 15:10:59,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:59,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:10:59,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:59,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:10:59,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:10:59,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 200 [2023-08-26 15:10:59,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 17 transitions, 65 flow. Second operand has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 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:10:59,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:59,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 200 [2023-08-26 15:10:59,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:11:00,018 INFO L124 PetriNetUnfolderBase]: 24/67 cut-off events. [2023-08-26 15:11:00,019 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-08-26 15:11:00,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 67 events. 24/67 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 147 event pairs, 10 based on Foata normal form. 8/75 useless extension candidates. Maximal degree in co-relation 184. Up to 29 conditions per place. [2023-08-26 15:11:00,019 INFO L140 encePairwiseOnDemand]: 195/200 looper letters, 18 selfloop transitions, 5 changer transitions 8/32 dead transitions. [2023-08-26 15:11:00,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 171 flow [2023-08-26 15:11:00,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:11:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:11:00,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 513 transitions. [2023-08-26 15:11:00,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4275 [2023-08-26 15:11:00,021 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 513 transitions. [2023-08-26 15:11:00,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 513 transitions. [2023-08-26 15:11:00,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:11:00,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 513 transitions. [2023-08-26 15:11:00,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:11:00,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:11:00,025 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:11:00,026 INFO L175 Difference]: Start difference. First operand has 29 places, 17 transitions, 65 flow. Second operand 6 states and 513 transitions. [2023-08-26 15:11:00,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 171 flow [2023-08-26 15:11:00,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 152 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-26 15:11:00,027 INFO L231 Difference]: Finished difference. Result has 32 places, 17 transitions, 72 flow [2023-08-26 15:11:00,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=72, PETRI_PLACES=32, PETRI_TRANSITIONS=17} [2023-08-26 15:11:00,029 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2023-08-26 15:11:00,029 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 17 transitions, 72 flow [2023-08-26 15:11:00,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:11:00,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:00,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:11:00,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:11:00,030 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:11:00,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:00,030 INFO L85 PathProgramCache]: Analyzing trace with hash -829170200, now seen corresponding path program 1 times [2023-08-26 15:11:00,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:00,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278713522] [2023-08-26 15:11:00,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:00,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:11:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:11:00,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:11:00,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278713522] [2023-08-26 15:11:00,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278713522] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:11:00,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:11:00,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:11:00,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918517838] [2023-08-26 15:11:00,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:11:00,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:11:00,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:11:00,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:11:00,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:11:00,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 200 [2023-08-26 15:11:00,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 17 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:11:00,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:11:00,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 200 [2023-08-26 15:11:00,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:11:00,276 INFO L124 PetriNetUnfolderBase]: 24/71 cut-off events. [2023-08-26 15:11:00,276 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-08-26 15:11:00,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 71 events. 24/71 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 185 event pairs, 1 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 204. Up to 41 conditions per place. [2023-08-26 15:11:00,276 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 21 selfloop transitions, 7 changer transitions 9/37 dead transitions. [2023-08-26 15:11:00,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 225 flow [2023-08-26 15:11:00,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:11:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:11:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2023-08-26 15:11:00,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434 [2023-08-26 15:11:00,278 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 434 transitions. [2023-08-26 15:11:00,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 434 transitions. [2023-08-26 15:11:00,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:11:00,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 434 transitions. [2023-08-26 15:11:00,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:11:00,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:11:00,281 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:11:00,281 INFO L175 Difference]: Start difference. First operand has 32 places, 17 transitions, 72 flow. Second operand 5 states and 434 transitions. [2023-08-26 15:11:00,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 225 flow [2023-08-26 15:11:00,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 37 transitions, 194 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-26 15:11:00,283 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 92 flow [2023-08-26 15:11:00,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-26 15:11:00,286 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2023-08-26 15:11:00,286 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 92 flow [2023-08-26 15:11:00,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:11:00,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:00,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:11:00,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:11:00,286 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:11:00,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:00,287 INFO L85 PathProgramCache]: Analyzing trace with hash 276321032, now seen corresponding path program 2 times [2023-08-26 15:11:00,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:00,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437029143] [2023-08-26 15:11:00,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:00,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:11:00,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:11:00,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:11:00,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437029143] [2023-08-26 15:11:00,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437029143] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:11:00,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:11:00,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:11:00,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479631246] [2023-08-26 15:11:00,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:11:00,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:11:00,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:11:00,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:11:00,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:11:00,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 200 [2023-08-26 15:11:00,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 92 flow. Second operand has 5 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:11:00,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:11:00,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 200 [2023-08-26 15:11:00,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:11:00,500 INFO L124 PetriNetUnfolderBase]: 23/78 cut-off events. [2023-08-26 15:11:00,500 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-08-26 15:11:00,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 78 events. 23/78 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 220 event pairs, 3 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 251. Up to 36 conditions per place. [2023-08-26 15:11:00,501 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 16 selfloop transitions, 3 changer transitions 18/37 dead transitions. [2023-08-26 15:11:00,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 226 flow [2023-08-26 15:11:00,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:11:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:11:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2023-08-26 15:11:00,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42833333333333334 [2023-08-26 15:11:00,503 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 514 transitions. [2023-08-26 15:11:00,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 514 transitions. [2023-08-26 15:11:00,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:11:00,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 514 transitions. [2023-08-26 15:11:00,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:11:00,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:11:00,505 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:11:00,505 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 92 flow. Second operand 6 states and 514 transitions. [2023-08-26 15:11:00,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 226 flow [2023-08-26 15:11:00,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 226 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:11:00,508 INFO L231 Difference]: Finished difference. Result has 37 places, 17 transitions, 77 flow [2023-08-26 15:11:00,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=17} [2023-08-26 15:11:00,509 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 9 predicate places. [2023-08-26 15:11:00,509 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 17 transitions, 77 flow [2023-08-26 15:11:00,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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:11:00,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:00,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:11:00,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:11:00,509 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:11:00,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:00,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1737381960, now seen corresponding path program 3 times [2023-08-26 15:11:00,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:00,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087674476] [2023-08-26 15:11:00,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:00,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:11:00,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:11:00,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:11:00,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087674476] [2023-08-26 15:11:00,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087674476] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:11:00,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:11:00,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:11:00,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663580052] [2023-08-26 15:11:00,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:11:00,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:11:00,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:11:00,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:11:00,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:11:00,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 200 [2023-08-26 15:11:00,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 17 transitions, 77 flow. Second operand has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:11:00,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:11:00,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 200 [2023-08-26 15:11:00,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:11:00,981 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2023-08-26 15:11:00,982 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-08-26 15:11:00,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 36 events. 6/36 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 65 event pairs, 0 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 120. Up to 13 conditions per place. [2023-08-26 15:11:00,982 INFO L140 encePairwiseOnDemand]: 193/200 looper letters, 13 selfloop transitions, 5 changer transitions 8/26 dead transitions. [2023-08-26 15:11:00,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 26 transitions, 174 flow [2023-08-26 15:11:00,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:11:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:11:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 631 transitions. [2023-08-26 15:11:00,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.394375 [2023-08-26 15:11:00,984 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 631 transitions. [2023-08-26 15:11:00,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 631 transitions. [2023-08-26 15:11:00,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:11:00,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 631 transitions. [2023-08-26 15:11:00,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 78.875) internal successors, (631), 8 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:11:00,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:11:00,988 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:11:00,988 INFO L175 Difference]: Start difference. First operand has 37 places, 17 transitions, 77 flow. Second operand 8 states and 631 transitions. [2023-08-26 15:11:00,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 26 transitions, 174 flow [2023-08-26 15:11:00,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 158 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-26 15:11:00,989 INFO L231 Difference]: Finished difference. Result has 38 places, 17 transitions, 80 flow [2023-08-26 15:11:00,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=17} [2023-08-26 15:11:00,989 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 10 predicate places. [2023-08-26 15:11:00,989 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 17 transitions, 80 flow [2023-08-26 15:11:00,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:11:00,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:00,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:11:00,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:11:00,990 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:11:00,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:00,990 INFO L85 PathProgramCache]: Analyzing trace with hash -131714866, now seen corresponding path program 4 times [2023-08-26 15:11:00,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:00,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316957834] [2023-08-26 15:11:00,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:00,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:11:01,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:11:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:11:01,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:11:01,044 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:11:01,044 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONASSERT (8 of 9 remaining) [2023-08-26 15:11:01,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (7 of 9 remaining) [2023-08-26 15:11:01,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2023-08-26 15:11:01,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-08-26 15:11:01,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2023-08-26 15:11:01,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2023-08-26 15:11:01,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-08-26 15:11:01,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2023-08-26 15:11:01,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (0 of 9 remaining) [2023-08-26 15:11:01,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:11:01,047 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2023-08-26 15:11:01,050 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:11:01,050 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:11:01,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:11:01 BasicIcfg [2023-08-26 15:11:01,078 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:11:01,078 INFO L158 Benchmark]: Toolchain (without parser) took 6579.69ms. Allocated memory was 325.1MB in the beginning and 536.9MB in the end (delta: 211.8MB). Free memory was 299.1MB in the beginning and 464.0MB in the end (delta: -164.9MB). Peak memory consumption was 49.5MB. Max. memory is 16.0GB. [2023-08-26 15:11:01,078 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 325.1MB. Free memory is still 301.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:11:01,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.80ms. Allocated memory is still 325.1MB. Free memory was 298.5MB in the beginning and 276.4MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 15:11:01,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.92ms. Allocated memory is still 325.1MB. Free memory was 276.4MB in the beginning and 273.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:11:01,079 INFO L158 Benchmark]: Boogie Preprocessor took 39.45ms. Allocated memory is still 325.1MB. Free memory was 273.9MB in the beginning and 272.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:11:01,079 INFO L158 Benchmark]: RCFGBuilder took 587.04ms. Allocated memory is still 325.1MB. Free memory was 272.3MB in the beginning and 291.4MB in the end (delta: -19.1MB). Peak memory consumption was 29.2MB. Max. memory is 16.0GB. [2023-08-26 15:11:01,080 INFO L158 Benchmark]: TraceAbstraction took 5475.28ms. Allocated memory was 325.1MB in the beginning and 536.9MB in the end (delta: 211.8MB). Free memory was 291.4MB in the beginning and 464.0MB in the end (delta: -172.6MB). Peak memory consumption was 39.1MB. Max. memory is 16.0GB. [2023-08-26 15:11:01,081 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 325.1MB. Free memory is still 301.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 413.80ms. Allocated memory is still 325.1MB. Free memory was 298.5MB in the beginning and 276.4MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.92ms. Allocated memory is still 325.1MB. Free memory was 276.4MB in the beginning and 273.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.45ms. Allocated memory is still 325.1MB. Free memory was 273.9MB in the beginning and 272.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 587.04ms. Allocated memory is still 325.1MB. Free memory was 272.3MB in the beginning and 291.4MB in the end (delta: -19.1MB). Peak memory consumption was 29.2MB. Max. memory is 16.0GB. * TraceAbstraction took 5475.28ms. Allocated memory was 325.1MB in the beginning and 536.9MB in the end (delta: 211.8MB). Free memory was 291.4MB in the beginning and 464.0MB in the end (delta: -172.6MB). Peak memory consumption was 39.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 101 PlacesBefore, 28 PlacesAfterwards, 97 TransitionsBefore, 22 TransitionsAfterwards, 1220 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 101 TotalNumberOfCompositions, 3073 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1570, independent: 1430, independent conditional: 0, independent unconditional: 1430, 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: 722, independent: 694, independent conditional: 0, independent unconditional: 694, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1570, independent: 736, independent conditional: 0, independent unconditional: 736, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 722, unknown conditional: 0, unknown unconditional: 722] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L813] 0 pthread_t t903; [L814] FCALL, FORK 0 pthread_create(&t903, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t903, ((void *)0), P0, ((void *)0))=-2, t903={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, z=0] [L815] 0 pthread_t t904; [L816] FCALL, FORK 0 pthread_create(&t904, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t904, ((void *)0), P1, ((void *)0))=-1, t903={5:0}, t904={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, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L782] 2 y = 1 [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L788] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L791] 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) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 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 [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 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) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 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 [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903={5:0}, t904={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix034_pso.opt_tso.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 814]: 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: 816]: 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, 117 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: 5.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 359 IncrementalHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 3 mSDtfsCounter, 359 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=6, InterpolantAutomatonStates: 38, 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.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 15:11:01,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...