/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 PROGRAM_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/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:07:53,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:07:53,822 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 18:07:53,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:07:53,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:07:53,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:07:53,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:07:53,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:07:53,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:07:53,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:07:53,869 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:07:53,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:07:53,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:07:53,870 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:07:53,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:07:53,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:07:53,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:07:53,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:07:53,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:07:53,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:07:53,871 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:07:53,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:07:53,872 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:07:53,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:07:53,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:07:53,873 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:07:53,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:07:53,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:07:53,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:07:53,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:07:53,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:07:53,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:07:53,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:07:53,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:07:53,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:07:53,875 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 -> PROGRAM_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 18:07:54,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:07:54,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:07:54,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:07:54,192 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:07:54,193 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:07:54,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2023-08-26 18:07:55,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:07:55,530 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:07:55,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2023-08-26 18:07:55,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1caad810/691ec8c9c3a7417187801215f03a2d30/FLAG0f73d9b38 [2023-08-26 18:07:55,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1caad810/691ec8c9c3a7417187801215f03a2d30 [2023-08-26 18:07:55,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:07:55,554 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:07:55,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:07:55,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:07:55,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:07:55,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:07:55" (1/1) ... [2023-08-26 18:07:55,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7546cf61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:07:55, skipping insertion in model container [2023-08-26 18:07:55,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:07:55" (1/1) ... [2023-08-26 18:07:55,592 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:07:55,872 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:07:55,886 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:07:55,911 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:07:55,912 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:07:55,948 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:07:55,977 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:07:55,978 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:07:55,983 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:07:55,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:07:55 WrapperNode [2023-08-26 18:07:55,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:07:55,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:07:55,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:07:55,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:07:55,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:07:55" (1/1) ... [2023-08-26 18:07:56,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:07:55" (1/1) ... [2023-08-26 18:07:56,048 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 157 [2023-08-26 18:07:56,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:07:56,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:07:56,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:07:56,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:07:56,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:07:55" (1/1) ... [2023-08-26 18:07:56,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:07:55" (1/1) ... [2023-08-26 18:07:56,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:07:55" (1/1) ... [2023-08-26 18:07:56,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:07:55" (1/1) ... [2023-08-26 18:07:56,081 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:07:55" (1/1) ... [2023-08-26 18:07:56,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:07:55" (1/1) ... [2023-08-26 18:07:56,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:07:55" (1/1) ... [2023-08-26 18:07:56,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:07:55" (1/1) ... [2023-08-26 18:07:56,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:07:56,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:07:56,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:07:56,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:07:56,100 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:07:55" (1/1) ... [2023-08-26 18:07:56,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:07:56,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:07:56,123 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 18:07:56,141 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 18:07:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:07:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:07:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:07:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:07:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:07:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:07:56,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:07:56,153 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:07:56,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:07:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:07:56,154 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:07:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:07:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:07:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:07:56,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:07:56,156 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 18:07:56,265 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:07:56,267 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:07:56,504 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:07:56,603 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:07:56,603 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:07:56,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:07:56 BoogieIcfgContainer [2023-08-26 18:07:56,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:07:56,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:07:56,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:07:56,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:07:56,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:07:55" (1/3) ... [2023-08-26 18:07:56,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1738a3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:07:56, skipping insertion in model container [2023-08-26 18:07:56,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:07:55" (2/3) ... [2023-08-26 18:07:56,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1738a3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:07:56, skipping insertion in model container [2023-08-26 18:07:56,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:07:56" (3/3) ... [2023-08-26 18:07:56,612 INFO L112 eAbstractionObserver]: Analyzing ICFG mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2023-08-26 18:07:56,624 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:07:56,624 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 18:07:56,624 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:07:56,659 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:07:56,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 121 transitions, 257 flow [2023-08-26 18:07:56,714 INFO L124 PetriNetUnfolderBase]: 3/118 cut-off events. [2023-08-26 18:07:56,714 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:07:56,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 3/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 18:07:56,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 121 transitions, 257 flow [2023-08-26 18:07:56,728 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 118 transitions, 245 flow [2023-08-26 18:07:56,731 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:07:56,737 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 118 transitions, 245 flow [2023-08-26 18:07:56,739 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 118 transitions, 245 flow [2023-08-26 18:07:56,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 118 transitions, 245 flow [2023-08-26 18:07:56,782 INFO L124 PetriNetUnfolderBase]: 3/118 cut-off events. [2023-08-26 18:07:56,782 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:07:56,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 3/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 18:07:56,784 INFO L119 LiptonReduction]: Number of co-enabled transitions 2112 [2023-08-26 18:07:59,853 INFO L134 LiptonReduction]: Checked pairs total: 6112 [2023-08-26 18:07:59,853 INFO L136 LiptonReduction]: Total number of compositions: 118 [2023-08-26 18:07:59,867 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:07:59,886 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;@22fe623, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:07:59,886 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-26 18:07:59,887 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:07:59,887 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:07:59,887 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:07:59,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:07:59,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:07:59,888 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:07:59,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:07:59,893 INFO L85 PathProgramCache]: Analyzing trace with hash 563, now seen corresponding path program 1 times [2023-08-26 18:07:59,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:07:59,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854948365] [2023-08-26 18:07:59,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:07:59,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:07:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:07:59,986 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 18:07:59,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:07:59,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854948365] [2023-08-26 18:07:59,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854948365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:07:59,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:07:59,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:07:59,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698428318] [2023-08-26 18:07:59,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:07:59,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:07:59,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:08:00,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:08:00,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:08:00,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 239 [2023-08-26 18:08:00,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 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 18:08:00,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:08:00,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 239 [2023-08-26 18:08:00,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:08:00,266 INFO L124 PetriNetUnfolderBase]: 1101/1670 cut-off events. [2023-08-26 18:08:00,266 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 18:08:00,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3343 conditions, 1670 events. 1101/1670 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8026 event pairs, 1101 based on Foata normal form. 72/1492 useless extension candidates. Maximal degree in co-relation 3332. Up to 1637 conditions per place. [2023-08-26 18:08:00,276 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 22 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-26 18:08:00,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 103 flow [2023-08-26 18:08:00,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:08:00,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:08:00,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 245 transitions. [2023-08-26 18:08:00,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125523012552301 [2023-08-26 18:08:00,285 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 245 transitions. [2023-08-26 18:08:00,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 245 transitions. [2023-08-26 18:08:00,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:08:00,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 245 transitions. [2023-08-26 18:08:00,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 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 18:08:00,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 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 18:08:00,294 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 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 18:08:00,295 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 245 transitions. [2023-08-26 18:08:00,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 103 flow [2023-08-26 18:08:00,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:08:00,298 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-26 18:08:00,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-26 18:08:00,302 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-26 18:08:00,302 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-26 18:08:00,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 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 18:08:00,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:08:00,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:08:00,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:08:00,303 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:08:00,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:08:00,310 INFO L85 PathProgramCache]: Analyzing trace with hash -99493164, now seen corresponding path program 1 times [2023-08-26 18:08:00,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:08:00,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377725512] [2023-08-26 18:08:00,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:08:00,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:08:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:08:00,642 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 18:08:00,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:08:00,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377725512] [2023-08-26 18:08:00,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377725512] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:08:00,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:08:00,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:08:00,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16820258] [2023-08-26 18:08:00,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:08:00,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:08:00,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:08:00,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:08:00,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:08:00,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 239 [2023-08-26 18:08:00,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 18:08:00,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:08:00,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 239 [2023-08-26 18:08:00,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:08:00,805 INFO L124 PetriNetUnfolderBase]: 910/1452 cut-off events. [2023-08-26 18:08:00,805 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:08:00,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2848 conditions, 1452 events. 910/1452 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7445 event pairs, 146 based on Foata normal form. 0/1328 useless extension candidates. Maximal degree in co-relation 2845. Up to 1101 conditions per place. [2023-08-26 18:08:00,812 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 26 selfloop transitions, 2 changer transitions 4/35 dead transitions. [2023-08-26 18:08:00,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 140 flow [2023-08-26 18:08:00,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:08:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:08:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-08-26 18:08:00,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49372384937238495 [2023-08-26 18:08:00,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-08-26 18:08:00,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-08-26 18:08:00,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:08:00,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-08-26 18:08:00,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 18:08:00,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 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 18:08:00,822 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 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 18:08:00,822 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 354 transitions. [2023-08-26 18:08:00,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 140 flow [2023-08-26 18:08:00,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:08:00,827 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 54 flow [2023-08-26 18:08:00,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-08-26 18:08:00,828 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-26 18:08:00,828 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 54 flow [2023-08-26 18:08:00,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 18:08:00,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:08:00,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:08:00,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:08:00,834 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:08:00,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:08:00,834 INFO L85 PathProgramCache]: Analyzing trace with hash -471015416, now seen corresponding path program 1 times [2023-08-26 18:08:00,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:08:00,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101836748] [2023-08-26 18:08:00,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:08:00,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:08:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:08:01,039 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 18:08:01,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:08:01,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101836748] [2023-08-26 18:08:01,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101836748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:08:01,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:08:01,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:08:01,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219668078] [2023-08-26 18:08:01,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:08:01,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:08:01,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:08:01,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:08:01,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:08:01,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 239 [2023-08-26 18:08:01,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 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 18:08:01,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:08:01,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 239 [2023-08-26 18:08:01,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:08:01,258 INFO L124 PetriNetUnfolderBase]: 1505/2258 cut-off events. [2023-08-26 18:08:01,258 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2023-08-26 18:08:01,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4683 conditions, 2258 events. 1505/2258 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9772 event pairs, 641 based on Foata normal form. 120/2378 useless extension candidates. Maximal degree in co-relation 4679. Up to 1889 conditions per place. [2023-08-26 18:08:01,266 INFO L140 encePairwiseOnDemand]: 233/239 looper letters, 30 selfloop transitions, 4 changer transitions 19/53 dead transitions. [2023-08-26 18:08:01,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 53 transitions, 232 flow [2023-08-26 18:08:01,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:08:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:08:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 530 transitions. [2023-08-26 18:08:01,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4435146443514644 [2023-08-26 18:08:01,268 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 530 transitions. [2023-08-26 18:08:01,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 530 transitions. [2023-08-26 18:08:01,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:08:01,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 530 transitions. [2023-08-26 18:08:01,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 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 18:08:01,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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 18:08:01,272 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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 18:08:01,272 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 54 flow. Second operand 5 states and 530 transitions. [2023-08-26 18:08:01,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 53 transitions, 232 flow [2023-08-26 18:08:01,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 53 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:08:01,273 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 86 flow [2023-08-26 18:08:01,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-26 18:08:01,274 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2023-08-26 18:08:01,274 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 86 flow [2023-08-26 18:08:01,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 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 18:08:01,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:08:01,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:08:01,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:08:01,275 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:08:01,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:08:01,275 INFO L85 PathProgramCache]: Analyzing trace with hash 310375519, now seen corresponding path program 1 times [2023-08-26 18:08:01,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:08:01,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775308402] [2023-08-26 18:08:01,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:08:01,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:08:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:08:01,380 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 18:08:01,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:08:01,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775308402] [2023-08-26 18:08:01,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775308402] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:08:01,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:08:01,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:08:01,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469141580] [2023-08-26 18:08:01,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:08:01,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:08:01,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:08:01,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:08:01,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:08:01,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 239 [2023-08-26 18:08:01,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 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 18:08:01,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:08:01,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 239 [2023-08-26 18:08:01,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:08:01,643 INFO L124 PetriNetUnfolderBase]: 1301/1954 cut-off events. [2023-08-26 18:08:01,644 INFO L125 PetriNetUnfolderBase]: For 998/998 co-relation queries the response was YES. [2023-08-26 18:08:01,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4926 conditions, 1954 events. 1301/1954 cut-off events. For 998/998 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8246 event pairs, 447 based on Foata normal form. 100/2054 useless extension candidates. Maximal degree in co-relation 4919. Up to 1237 conditions per place. [2023-08-26 18:08:01,654 INFO L140 encePairwiseOnDemand]: 235/239 looper letters, 34 selfloop transitions, 3 changer transitions 21/58 dead transitions. [2023-08-26 18:08:01,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 58 transitions, 300 flow [2023-08-26 18:08:01,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:08:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:08:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2023-08-26 18:08:01,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44518828451882847 [2023-08-26 18:08:01,656 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 532 transitions. [2023-08-26 18:08:01,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 532 transitions. [2023-08-26 18:08:01,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:08:01,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 532 transitions. [2023-08-26 18:08:01,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 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 18:08:01,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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 18:08:01,660 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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 18:08:01,660 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 86 flow. Second operand 5 states and 532 transitions. [2023-08-26 18:08:01,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 58 transitions, 300 flow [2023-08-26 18:08:01,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 58 transitions, 294 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 18:08:01,667 INFO L231 Difference]: Finished difference. Result has 40 places, 25 transitions, 95 flow [2023-08-26 18:08:01,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2023-08-26 18:08:01,669 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-26 18:08:01,669 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 95 flow [2023-08-26 18:08:01,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 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 18:08:01,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:08:01,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:08:01,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:08:01,669 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:08:01,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:08:01,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1198090377, now seen corresponding path program 1 times [2023-08-26 18:08:01,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:08:01,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884132156] [2023-08-26 18:08:01,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:08:01,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:08:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:08:01,771 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 18:08:01,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:08:01,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884132156] [2023-08-26 18:08:01,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884132156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:08:01,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:08:01,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:08:01,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265053067] [2023-08-26 18:08:01,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:08:01,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:08:01,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:08:01,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:08:01,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:08:01,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 239 [2023-08-26 18:08:01,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 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 18:08:01,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:08:01,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 239 [2023-08-26 18:08:01,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:08:01,932 INFO L124 PetriNetUnfolderBase]: 738/1232 cut-off events. [2023-08-26 18:08:01,932 INFO L125 PetriNetUnfolderBase]: For 696/725 co-relation queries the response was YES. [2023-08-26 18:08:01,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2905 conditions, 1232 events. 738/1232 cut-off events. For 696/725 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5814 event pairs, 225 based on Foata normal form. 60/1271 useless extension candidates. Maximal degree in co-relation 2896. Up to 670 conditions per place. [2023-08-26 18:08:01,939 INFO L140 encePairwiseOnDemand]: 235/239 looper letters, 24 selfloop transitions, 3 changer transitions 13/45 dead transitions. [2023-08-26 18:08:01,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 223 flow [2023-08-26 18:08:01,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:08:01,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:08:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2023-08-26 18:08:01,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4610878661087866 [2023-08-26 18:08:01,941 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 551 transitions. [2023-08-26 18:08:01,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 551 transitions. [2023-08-26 18:08:01,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:08:01,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 551 transitions. [2023-08-26 18:08:01,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 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 18:08:01,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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 18:08:01,945 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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 18:08:01,945 INFO L175 Difference]: Start difference. First operand has 40 places, 25 transitions, 95 flow. Second operand 5 states and 551 transitions. [2023-08-26 18:08:01,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 223 flow [2023-08-26 18:08:01,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 213 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 18:08:01,951 INFO L231 Difference]: Finished difference. Result has 41 places, 25 transitions, 100 flow [2023-08-26 18:08:01,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2023-08-26 18:08:01,953 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-26 18:08:01,953 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 100 flow [2023-08-26 18:08:01,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 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 18:08:01,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:08:01,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:08:01,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:08:01,954 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:08:01,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:08:01,954 INFO L85 PathProgramCache]: Analyzing trace with hash 957046461, now seen corresponding path program 1 times [2023-08-26 18:08:01,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:08:01,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007053862] [2023-08-26 18:08:01,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:08:01,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:08:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:08:02,102 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 18:08:02,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:08:02,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007053862] [2023-08-26 18:08:02,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007053862] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:08:02,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:08:02,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:08:02,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972715707] [2023-08-26 18:08:02,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:08:02,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:08:02,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:08:02,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:08:02,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:08:02,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 239 [2023-08-26 18:08:02,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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 18:08:02,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:08:02,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 239 [2023-08-26 18:08:02,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:08:02,203 INFO L124 PetriNetUnfolderBase]: 373/659 cut-off events. [2023-08-26 18:08:02,203 INFO L125 PetriNetUnfolderBase]: For 378/391 co-relation queries the response was YES. [2023-08-26 18:08:02,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1677 conditions, 659 events. 373/659 cut-off events. For 378/391 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2840 event pairs, 98 based on Foata normal form. 36/685 useless extension candidates. Maximal degree in co-relation 1667. Up to 518 conditions per place. [2023-08-26 18:08:02,206 INFO L140 encePairwiseOnDemand]: 234/239 looper letters, 29 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2023-08-26 18:08:02,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 203 flow [2023-08-26 18:08:02,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:08:02,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:08:02,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-08-26 18:08:02,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4769874476987448 [2023-08-26 18:08:02,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-08-26 18:08:02,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-08-26 18:08:02,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:08:02,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-08-26 18:08:02,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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 18:08:02,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 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 18:08:02,210 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 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 18:08:02,210 INFO L175 Difference]: Start difference. First operand has 41 places, 25 transitions, 100 flow. Second operand 3 states and 342 transitions. [2023-08-26 18:08:02,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 203 flow [2023-08-26 18:08:02,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 191 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 18:08:02,212 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 116 flow [2023-08-26 18:08:02,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-26 18:08:02,212 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-26 18:08:02,212 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 116 flow [2023-08-26 18:08:02,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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 18:08:02,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:08:02,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:08:02,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:08:02,213 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:08:02,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:08:02,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1005805726, now seen corresponding path program 1 times [2023-08-26 18:08:02,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:08:02,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099591572] [2023-08-26 18:08:02,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:08:02,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:08:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:08:02,364 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 18:08:02,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:08:02,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099591572] [2023-08-26 18:08:02,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099591572] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:08:02,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:08:02,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:08:02,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157959807] [2023-08-26 18:08:02,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:08:02,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:08:02,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:08:02,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:08:02,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:08:02,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 239 [2023-08-26 18:08:02,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 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 18:08:02,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:08:02,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 239 [2023-08-26 18:08:02,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:08:02,437 INFO L124 PetriNetUnfolderBase]: 177/356 cut-off events. [2023-08-26 18:08:02,437 INFO L125 PetriNetUnfolderBase]: For 120/126 co-relation queries the response was YES. [2023-08-26 18:08:02,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1017 conditions, 356 events. 177/356 cut-off events. For 120/126 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1404 event pairs, 53 based on Foata normal form. 37/385 useless extension candidates. Maximal degree in co-relation 1008. Up to 113 conditions per place. [2023-08-26 18:08:02,439 INFO L140 encePairwiseOnDemand]: 234/239 looper letters, 37 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2023-08-26 18:08:02,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 268 flow [2023-08-26 18:08:02,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:08:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:08:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 456 transitions. [2023-08-26 18:08:02,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4769874476987448 [2023-08-26 18:08:02,440 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 456 transitions. [2023-08-26 18:08:02,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 456 transitions. [2023-08-26 18:08:02,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:08:02,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 456 transitions. [2023-08-26 18:08:02,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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 18:08:02,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 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 18:08:02,443 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 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 18:08:02,443 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 116 flow. Second operand 4 states and 456 transitions. [2023-08-26 18:08:02,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 268 flow [2023-08-26 18:08:02,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:08:02,444 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 152 flow [2023-08-26 18:08:02,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-26 18:08:02,445 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-26 18:08:02,445 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 152 flow [2023-08-26 18:08:02,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 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 18:08:02,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:08:02,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:08:02,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:08:02,446 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:08:02,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:08:02,446 INFO L85 PathProgramCache]: Analyzing trace with hash -29795484, now seen corresponding path program 1 times [2023-08-26 18:08:02,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:08:02,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675465764] [2023-08-26 18:08:02,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:08:02,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:08:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:08:02,631 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 18:08:02,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:08:02,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675465764] [2023-08-26 18:08:02,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675465764] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:08:02,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:08:02,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:08:02,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840146707] [2023-08-26 18:08:02,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:08:02,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:08:02,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:08:02,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:08:02,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:08:02,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 239 [2023-08-26 18:08:02,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 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 18:08:02,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:08:02,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 239 [2023-08-26 18:08:02,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:08:02,709 INFO L124 PetriNetUnfolderBase]: 142/285 cut-off events. [2023-08-26 18:08:02,710 INFO L125 PetriNetUnfolderBase]: For 284/289 co-relation queries the response was YES. [2023-08-26 18:08:02,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 285 events. 142/285 cut-off events. For 284/289 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1122 event pairs, 49 based on Foata normal form. 11/288 useless extension candidates. Maximal degree in co-relation 859. Up to 113 conditions per place. [2023-08-26 18:08:02,712 INFO L140 encePairwiseOnDemand]: 234/239 looper letters, 34 selfloop transitions, 10 changer transitions 0/49 dead transitions. [2023-08-26 18:08:02,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 292 flow [2023-08-26 18:08:02,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:08:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:08:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2023-08-26 18:08:02,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46778242677824267 [2023-08-26 18:08:02,713 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 559 transitions. [2023-08-26 18:08:02,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 559 transitions. [2023-08-26 18:08:02,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:08:02,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 559 transitions. [2023-08-26 18:08:02,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 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 18:08:02,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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 18:08:02,716 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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 18:08:02,716 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 152 flow. Second operand 5 states and 559 transitions. [2023-08-26 18:08:02,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 292 flow [2023-08-26 18:08:02,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 262 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-26 18:08:02,718 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 152 flow [2023-08-26 18:08:02,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-08-26 18:08:02,720 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-26 18:08:02,720 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 152 flow [2023-08-26 18:08:02,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 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 18:08:02,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:08:02,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:08:02,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:08:02,720 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:08:02,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:08:02,721 INFO L85 PathProgramCache]: Analyzing trace with hash 47887630, now seen corresponding path program 1 times [2023-08-26 18:08:02,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:08:02,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409947081] [2023-08-26 18:08:02,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:08:02,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:08:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:08:02,873 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 18:08:02,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:08:02,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409947081] [2023-08-26 18:08:02,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409947081] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:08:02,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:08:02,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:08:02,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794320021] [2023-08-26 18:08:02,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:08:02,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:08:02,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:08:02,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:08:02,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:08:02,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 239 [2023-08-26 18:08:02,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 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 18:08:02,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:08:02,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 239 [2023-08-26 18:08:02,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:08:02,975 INFO L124 PetriNetUnfolderBase]: 193/398 cut-off events. [2023-08-26 18:08:02,975 INFO L125 PetriNetUnfolderBase]: For 546/546 co-relation queries the response was YES. [2023-08-26 18:08:02,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1239 conditions, 398 events. 193/398 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1761 event pairs, 38 based on Foata normal form. 1/393 useless extension candidates. Maximal degree in co-relation 1230. Up to 208 conditions per place. [2023-08-26 18:08:02,977 INFO L140 encePairwiseOnDemand]: 235/239 looper letters, 42 selfloop transitions, 2 changer transitions 13/61 dead transitions. [2023-08-26 18:08:02,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 418 flow [2023-08-26 18:08:02,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:08:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:08:02,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 537 transitions. [2023-08-26 18:08:02,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44937238493723847 [2023-08-26 18:08:02,979 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 537 transitions. [2023-08-26 18:08:02,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 537 transitions. [2023-08-26 18:08:02,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:08:02,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 537 transitions. [2023-08-26 18:08:02,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 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 18:08:02,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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 18:08:02,982 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 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 18:08:02,982 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 152 flow. Second operand 5 states and 537 transitions. [2023-08-26 18:08:02,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 418 flow [2023-08-26 18:08:02,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 354 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-26 18:08:02,985 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 135 flow [2023-08-26 18:08:02,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-08-26 18:08:02,985 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-26 18:08:02,985 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 135 flow [2023-08-26 18:08:02,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 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 18:08:02,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:08:02,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:08:02,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:08:02,986 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:08:02,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:08:02,986 INFO L85 PathProgramCache]: Analyzing trace with hash -758291802, now seen corresponding path program 2 times [2023-08-26 18:08:02,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:08:02,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340509513] [2023-08-26 18:08:02,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:08:02,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:08:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:08:03,345 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 18:08:03,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:08:03,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340509513] [2023-08-26 18:08:03,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340509513] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:08:03,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:08:03,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:08:03,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602512698] [2023-08-26 18:08:03,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:08:03,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 18:08:03,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:08:03,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 18:08:03,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-26 18:08:03,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 239 [2023-08-26 18:08:03,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 135 flow. Second operand has 9 states, 9 states have (on average 91.44444444444444) internal successors, (823), 9 states have internal predecessors, (823), 0 states have call successors, (0), 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 18:08:03,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:08:03,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 239 [2023-08-26 18:08:03,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:08:03,647 INFO L124 PetriNetUnfolderBase]: 400/725 cut-off events. [2023-08-26 18:08:03,647 INFO L125 PetriNetUnfolderBase]: For 634/634 co-relation queries the response was YES. [2023-08-26 18:08:03,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2233 conditions, 725 events. 400/725 cut-off events. For 634/634 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3109 event pairs, 38 based on Foata normal form. 1/726 useless extension candidates. Maximal degree in co-relation 2222. Up to 322 conditions per place. [2023-08-26 18:08:03,650 INFO L140 encePairwiseOnDemand]: 230/239 looper letters, 30 selfloop transitions, 3 changer transitions 77/110 dead transitions. [2023-08-26 18:08:03,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 110 transitions, 665 flow [2023-08-26 18:08:03,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 18:08:03,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 18:08:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1252 transitions. [2023-08-26 18:08:03,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40296105568072094 [2023-08-26 18:08:03,652 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1252 transitions. [2023-08-26 18:08:03,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1252 transitions. [2023-08-26 18:08:03,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:08:03,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1252 transitions. [2023-08-26 18:08:03,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.3076923076923) internal successors, (1252), 13 states have internal predecessors, (1252), 0 states have call successors, (0), 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 18:08:03,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 239.0) internal successors, (3346), 14 states have internal predecessors, (3346), 0 states have call successors, (0), 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 18:08:03,658 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 239.0) internal successors, (3346), 14 states have internal predecessors, (3346), 0 states have call successors, (0), 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 18:08:03,658 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 135 flow. Second operand 13 states and 1252 transitions. [2023-08-26 18:08:03,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 110 transitions, 665 flow [2023-08-26 18:08:03,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 110 transitions, 656 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 18:08:03,661 INFO L231 Difference]: Finished difference. Result has 62 places, 28 transitions, 145 flow [2023-08-26 18:08:03,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=145, PETRI_PLACES=62, PETRI_TRANSITIONS=28} [2023-08-26 18:08:03,662 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2023-08-26 18:08:03,662 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 28 transitions, 145 flow [2023-08-26 18:08:03,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.44444444444444) internal successors, (823), 9 states have internal predecessors, (823), 0 states have call successors, (0), 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 18:08:03,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:08:03,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:08:03,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:08:03,663 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:08:03,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:08:03,663 INFO L85 PathProgramCache]: Analyzing trace with hash 936201422, now seen corresponding path program 3 times [2023-08-26 18:08:03,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:08:03,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579284208] [2023-08-26 18:08:03,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:08:03,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:08:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:08:04,258 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 18:08:04,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:08:04,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579284208] [2023-08-26 18:08:04,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579284208] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:08:04,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:08:04,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:08:04,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647443017] [2023-08-26 18:08:04,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:08:04,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:08:04,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:08:04,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:08:04,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:08:04,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 239 [2023-08-26 18:08:04,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 28 transitions, 145 flow. Second operand has 8 states, 8 states have (on average 96.375) internal successors, (771), 8 states have internal predecessors, (771), 0 states have call successors, (0), 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 18:08:04,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:08:04,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 239 [2023-08-26 18:08:04,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:08:04,430 INFO L124 PetriNetUnfolderBase]: 66/166 cut-off events. [2023-08-26 18:08:04,430 INFO L125 PetriNetUnfolderBase]: For 344/344 co-relation queries the response was YES. [2023-08-26 18:08:04,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 166 events. 66/166 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 593 event pairs, 11 based on Foata normal form. 1/161 useless extension candidates. Maximal degree in co-relation 599. Up to 63 conditions per place. [2023-08-26 18:08:04,431 INFO L140 encePairwiseOnDemand]: 231/239 looper letters, 24 selfloop transitions, 5 changer transitions 18/50 dead transitions. [2023-08-26 18:08:04,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 50 transitions, 358 flow [2023-08-26 18:08:04,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:08:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:08:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 880 transitions. [2023-08-26 18:08:04,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40911204091120407 [2023-08-26 18:08:04,433 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 880 transitions. [2023-08-26 18:08:04,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 880 transitions. [2023-08-26 18:08:04,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:08:04,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 880 transitions. [2023-08-26 18:08:04,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.77777777777777) internal successors, (880), 9 states have internal predecessors, (880), 0 states have call successors, (0), 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 18:08:04,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 239.0) internal successors, (2390), 10 states have internal predecessors, (2390), 0 states have call successors, (0), 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 18:08:04,437 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 239.0) internal successors, (2390), 10 states have internal predecessors, (2390), 0 states have call successors, (0), 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 18:08:04,437 INFO L175 Difference]: Start difference. First operand has 62 places, 28 transitions, 145 flow. Second operand 9 states and 880 transitions. [2023-08-26 18:08:04,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 50 transitions, 358 flow [2023-08-26 18:08:04,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 318 flow, removed 18 selfloop flow, removed 9 redundant places. [2023-08-26 18:08:04,439 INFO L231 Difference]: Finished difference. Result has 54 places, 28 transitions, 135 flow [2023-08-26 18:08:04,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=135, PETRI_PLACES=54, PETRI_TRANSITIONS=28} [2023-08-26 18:08:04,439 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2023-08-26 18:08:04,439 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 28 transitions, 135 flow [2023-08-26 18:08:04,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.375) internal successors, (771), 8 states have internal predecessors, (771), 0 states have call successors, (0), 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 18:08:04,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:08:04,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:08:04,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:08:04,440 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:08:04,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:08:04,440 INFO L85 PathProgramCache]: Analyzing trace with hash -970257898, now seen corresponding path program 4 times [2023-08-26 18:08:04,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:08:04,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036068730] [2023-08-26 18:08:04,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:08:04,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:08:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:08:04,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:08:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:08:04,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:08:04,504 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:08:04,505 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (11 of 12 remaining) [2023-08-26 18:08:04,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (10 of 12 remaining) [2023-08-26 18:08:04,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-26 18:08:04,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-26 18:08:04,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-08-26 18:08:04,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-26 18:08:04,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-26 18:08:04,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-26 18:08:04,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-08-26 18:08:04,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-26 18:08:04,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-08-26 18:08:04,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (0 of 12 remaining) [2023-08-26 18:08:04,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:08:04,508 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:08:04,511 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:08:04,511 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:08:04,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:08:04 BasicIcfg [2023-08-26 18:08:04,551 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:08:04,551 INFO L158 Benchmark]: Toolchain (without parser) took 8997.77ms. Allocated memory was 362.8MB in the beginning and 562.0MB in the end (delta: 199.2MB). Free memory was 337.3MB in the beginning and 306.1MB in the end (delta: 31.2MB). Peak memory consumption was 232.6MB. Max. memory is 16.0GB. [2023-08-26 18:08:04,551 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 362.8MB. Free memory is still 338.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:08:04,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.02ms. Allocated memory is still 362.8MB. Free memory was 337.3MB in the beginning and 313.3MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:08:04,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.41ms. Allocated memory is still 362.8MB. Free memory was 313.3MB in the beginning and 310.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 18:08:04,552 INFO L158 Benchmark]: Boogie Preprocessor took 37.27ms. Allocated memory is still 362.8MB. Free memory was 310.7MB in the beginning and 308.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:08:04,552 INFO L158 Benchmark]: RCFGBuilder took 517.56ms. Allocated memory is still 362.8MB. Free memory was 308.6MB in the beginning and 320.7MB in the end (delta: -12.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 18:08:04,552 INFO L158 Benchmark]: TraceAbstraction took 7944.42ms. Allocated memory was 362.8MB in the beginning and 562.0MB in the end (delta: 199.2MB). Free memory was 319.7MB in the beginning and 306.1MB in the end (delta: 13.6MB). Peak memory consumption was 213.8MB. Max. memory is 16.0GB. [2023-08-26 18:08:04,553 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.13ms. Allocated memory is still 362.8MB. Free memory is still 338.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 429.02ms. Allocated memory is still 362.8MB. Free memory was 337.3MB in the beginning and 313.3MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 65.41ms. Allocated memory is still 362.8MB. Free memory was 313.3MB in the beginning and 310.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.27ms. Allocated memory is still 362.8MB. Free memory was 310.7MB in the beginning and 308.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 517.56ms. Allocated memory is still 362.8MB. Free memory was 308.6MB in the beginning and 320.7MB in the end (delta: -12.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 7944.42ms. Allocated memory was 362.8MB in the beginning and 562.0MB in the end (delta: 199.2MB). Free memory was 319.7MB in the beginning and 306.1MB in the end (delta: 13.6MB). Peak memory consumption was 213.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 125 PlacesBefore, 41 PlacesAfterwards, 118 TransitionsBefore, 32 TransitionsAfterwards, 2112 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 118 TotalNumberOfCompositions, 6112 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2821, independent: 2630, independent conditional: 0, independent unconditional: 2630, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1163, independent: 1135, independent conditional: 0, independent unconditional: 1135, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2821, independent: 1495, independent conditional: 0, independent unconditional: 1495, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 1163, unknown conditional: 0, unknown unconditional: 1163] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [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; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t65; [L849] FCALL, FORK 0 pthread_create(&t65, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t65, ((void *)0), P0, ((void *)0))=-2, t65={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t66; [L851] FCALL, FORK 0 pthread_create(&t66, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t66, ((void *)0), P1, ((void *)0))=-1, t65={5:0}, t66={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t67; [L853] FCALL, FORK 0 pthread_create(&t67, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t67, ((void *)0), P2, ((void *)0))=0, t65={5:0}, t66={6:0}, t67={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 y$flush_delayed = weak$$choice2 [L810] 3 y$mem_tmp = y [L811] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EAX = y [L819] 3 y = y$flush_delayed ? y$mem_tmp : y [L820] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L823] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L749] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L764] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L767] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L826] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L828] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L829] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L830] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t65={5:0}, t66={6:0}, t67={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L866] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix003_power.opt_pso.opt_rmo.opt_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 853]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 locations, 12 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 902 IncrementalHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 17 mSDtfsCounter, 902 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=7, InterpolantAutomatonStates: 59, 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, 2.0s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 1104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 18:08:04,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...