/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix046.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:12:34,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:12:34,777 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 15:12:34,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:12:34,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:12:34,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:12:34,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:12:34,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:12:34,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:12:34,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:12:34,808 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:12:34,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:12:34,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:12:34,810 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:12:34,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:12:34,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:12:34,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:12:34,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:12:34,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:12:34,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:12:34,811 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:12:34,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:12:34,811 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:12:34,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:12:34,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:12:34,812 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:12:34,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:12:34,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:12:34,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:12:34,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:12:34,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:12:34,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:12:34,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:12:34,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:12:34,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:12:34,814 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 15:12:35,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:12:35,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:12:35,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:12:35,109 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:12:35,109 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:12:35,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2023-08-26 15:12:36,157 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:12:36,345 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:12:36,345 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2023-08-26 15:12:36,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0308ea0c/0c7dd48478ec40d3a22bef7accae55ab/FLAG09a6e6edd [2023-08-26 15:12:36,364 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0308ea0c/0c7dd48478ec40d3a22bef7accae55ab [2023-08-26 15:12:36,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:12:36,366 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:12:36,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:12:36,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:12:36,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:12:36,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:12:36" (1/1) ... [2023-08-26 15:12:36,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16bd1209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:12:36, skipping insertion in model container [2023-08-26 15:12:36,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:12:36" (1/1) ... [2023-08-26 15:12:36,403 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:12:36,669 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:12:36,678 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:12:36,699 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:12:36,700 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:12:36,730 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:12:36,757 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:12:36,757 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:12:36,762 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:12:36,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:12:36 WrapperNode [2023-08-26 15:12:36,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:12:36,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:12:36,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:12:36,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:12:36,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:12:36" (1/1) ... [2023-08-26 15:12:36,793 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:12:36" (1/1) ... [2023-08-26 15:12:36,820 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 174 [2023-08-26 15:12:36,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:12:36,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:12:36,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:12:36,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:12:36,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:12:36" (1/1) ... [2023-08-26 15:12:36,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:12:36" (1/1) ... [2023-08-26 15:12:36,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:12:36" (1/1) ... [2023-08-26 15:12:36,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:12:36" (1/1) ... [2023-08-26 15:12:36,842 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:12:36" (1/1) ... [2023-08-26 15:12:36,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:12:36" (1/1) ... [2023-08-26 15:12:36,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:12:36" (1/1) ... [2023-08-26 15:12:36,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:12:36" (1/1) ... [2023-08-26 15:12:36,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:12:36,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:12:36,848 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:12:36,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:12:36,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:12:36" (1/1) ... [2023-08-26 15:12:36,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:12:36,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:12:36,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 15:12:36,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 15:12:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:12:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:12:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:12:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:12:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:12:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:12:36,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:12:36,912 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:12:36,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:12:36,912 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 15:12:36,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 15:12:36,912 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 15:12:36,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 15:12:36,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:12:36,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:12:36,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:12:36,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:12:36,914 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 15:12:37,024 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:12:37,025 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:12:37,368 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:12:37,458 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:12:37,458 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:12:37,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:12:37 BoogieIcfgContainer [2023-08-26 15:12:37,460 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:12:37,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:12:37,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:12:37,463 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:12:37,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:12:36" (1/3) ... [2023-08-26 15:12:37,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545f1140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:12:37, skipping insertion in model container [2023-08-26 15:12:37,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:12:36" (2/3) ... [2023-08-26 15:12:37,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545f1140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:12:37, skipping insertion in model container [2023-08-26 15:12:37,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:12:37" (3/3) ... [2023-08-26 15:12:37,467 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.opt.i [2023-08-26 15:12:37,483 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:12:37,483 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 15:12:37,484 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:12:37,541 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:12:37,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 15:12:37,622 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 15:12:37,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:12:37,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 15:12:37,627 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 15:12:37,632 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 138 transitions, 288 flow [2023-08-26 15:12:37,635 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:12:37,645 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 15:12:37,647 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 15:12:37,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 138 transitions, 288 flow [2023-08-26 15:12:37,681 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 15:12:37,681 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:12:37,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 15:12:37,683 INFO L119 LiptonReduction]: Number of co-enabled transitions 3316 [2023-08-26 15:12:41,030 INFO L134 LiptonReduction]: Checked pairs total: 9022 [2023-08-26 15:12:41,030 INFO L136 LiptonReduction]: Total number of compositions: 141 [2023-08-26 15:12:41,046 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:12:41,052 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;@36d530df, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:12:41,052 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 15:12:41,053 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:12:41,054 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 15:12:41,054 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:12:41,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:41,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:12:41,055 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:12:41,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:41,058 INFO L85 PathProgramCache]: Analyzing trace with hash 610, now seen corresponding path program 1 times [2023-08-26 15:12:41,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:41,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057144414] [2023-08-26 15:12:41,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:41,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:12:41,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:41,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057144414] [2023-08-26 15:12:41,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057144414] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:41,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:41,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:12:41,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589829666] [2023-08-26 15:12:41,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:41,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:12:41,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:41,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:12:41,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:12:41,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 283 [2023-08-26 15:12:41,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:41,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:41,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 283 [2023-08-26 15:12:41,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:41,723 INFO L124 PetriNetUnfolderBase]: 4373/6089 cut-off events. [2023-08-26 15:12:41,723 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-08-26 15:12:41,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12175 conditions, 6089 events. 4373/6089 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 31369 event pairs, 4373 based on Foata normal form. 216/5554 useless extension candidates. Maximal degree in co-relation 12163. Up to 5983 conditions per place. [2023-08-26 15:12:41,751 INFO L140 encePairwiseOnDemand]: 274/283 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-26 15:12:41,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-08-26 15:12:41,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:12:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:12:41,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 291 transitions. [2023-08-26 15:12:41,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5141342756183745 [2023-08-26 15:12:41,761 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 291 transitions. [2023-08-26 15:12:41,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 291 transitions. [2023-08-26 15:12:41,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:41,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 291 transitions. [2023-08-26 15:12:41,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:41,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:41,769 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:41,770 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 291 transitions. [2023-08-26 15:12:41,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-08-26 15:12:41,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 15:12:41,774 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-26 15:12:41,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-26 15:12:41,777 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-26 15:12:41,777 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-26 15:12:41,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:41,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:41,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:41,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:12:41,778 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:12:41,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:41,778 INFO L85 PathProgramCache]: Analyzing trace with hash -312659106, now seen corresponding path program 1 times [2023-08-26 15:12:41,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:41,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422988324] [2023-08-26 15:12:41,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:41,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:12:42,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:42,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422988324] [2023-08-26 15:12:42,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422988324] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:42,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:42,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:12:42,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125629586] [2023-08-26 15:12:42,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:42,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:12:42,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:42,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:12:42,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:12:42,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 283 [2023-08-26 15:12:42,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 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 15:12:42,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:42,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 283 [2023-08-26 15:12:42,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:42,460 INFO L124 PetriNetUnfolderBase]: 3632/5267 cut-off events. [2023-08-26 15:12:42,461 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:12:42,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10357 conditions, 5267 events. 3632/5267 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 29189 event pairs, 668 based on Foata normal form. 0/4894 useless extension candidates. Maximal degree in co-relation 10354. Up to 3973 conditions per place. [2023-08-26 15:12:42,478 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 32 selfloop transitions, 2 changer transitions 4/42 dead transitions. [2023-08-26 15:12:42,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 168 flow [2023-08-26 15:12:42,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:12:42,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:12:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-26 15:12:42,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49469964664310956 [2023-08-26 15:12:42,484 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-26 15:12:42,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-26 15:12:42,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:42,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-26 15:12:42,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:42,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:42,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:42,487 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 420 transitions. [2023-08-26 15:12:42,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 168 flow [2023-08-26 15:12:42,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:12:42,488 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 66 flow [2023-08-26 15:12:42,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-26 15:12:42,489 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-26 15:12:42,489 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 66 flow [2023-08-26 15:12:42,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 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 15:12:42,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:42,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:42,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:12:42,490 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:12:42,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:42,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1359022523, now seen corresponding path program 1 times [2023-08-26 15:12:42,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:42,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353046993] [2023-08-26 15:12:42,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:42,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:12:42,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:42,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353046993] [2023-08-26 15:12:42,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353046993] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:42,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:42,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:12:42,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265912903] [2023-08-26 15:12:42,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:42,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:12:42,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:42,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:12:42,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:12:42,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 283 [2023-08-26 15:12:42,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:42,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:42,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 283 [2023-08-26 15:12:42,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:43,037 INFO L124 PetriNetUnfolderBase]: 3861/5544 cut-off events. [2023-08-26 15:12:43,037 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2023-08-26 15:12:43,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11321 conditions, 5544 events. 3861/5544 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 28683 event pairs, 1179 based on Foata normal form. 240/5771 useless extension candidates. Maximal degree in co-relation 11317. Up to 4326 conditions per place. [2023-08-26 15:12:43,060 INFO L140 encePairwiseOnDemand]: 278/283 looper letters, 36 selfloop transitions, 3 changer transitions 22/64 dead transitions. [2023-08-26 15:12:43,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 272 flow [2023-08-26 15:12:43,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:12:43,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:12:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2023-08-26 15:12:43,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791519434628975 [2023-08-26 15:12:43,062 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2023-08-26 15:12:43,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2023-08-26 15:12:43,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:43,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2023-08-26 15:12:43,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:43,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:43,066 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:43,066 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 66 flow. Second operand 5 states and 678 transitions. [2023-08-26 15:12:43,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 64 transitions, 272 flow [2023-08-26 15:12:43,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:12:43,068 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 89 flow [2023-08-26 15:12:43,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2023-08-26 15:12:43,069 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -7 predicate places. [2023-08-26 15:12:43,069 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 89 flow [2023-08-26 15:12:43,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:43,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:43,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:43,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:12:43,069 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:12:43,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:43,070 INFO L85 PathProgramCache]: Analyzing trace with hash -820007658, now seen corresponding path program 1 times [2023-08-26 15:12:43,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:43,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068671087] [2023-08-26 15:12:43,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:43,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:43,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:12:43,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:43,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068671087] [2023-08-26 15:12:43,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068671087] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:43,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:43,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:12:43,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217815233] [2023-08-26 15:12:43,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:43,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:12:43,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:43,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:12:43,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:12:43,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 283 [2023-08-26 15:12:43,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 89 flow. Second operand has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:43,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:43,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 283 [2023-08-26 15:12:43,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:44,623 INFO L124 PetriNetUnfolderBase]: 11189/15398 cut-off events. [2023-08-26 15:12:44,624 INFO L125 PetriNetUnfolderBase]: For 5576/5576 co-relation queries the response was YES. [2023-08-26 15:12:44,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35522 conditions, 15398 events. 11189/15398 cut-off events. For 5576/5576 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 77873 event pairs, 1523 based on Foata normal form. 656/16054 useless extension candidates. Maximal degree in co-relation 35515. Up to 9743 conditions per place. [2023-08-26 15:12:44,677 INFO L140 encePairwiseOnDemand]: 270/283 looper letters, 51 selfloop transitions, 13 changer transitions 41/105 dead transitions. [2023-08-26 15:12:44,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 105 transitions, 509 flow [2023-08-26 15:12:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:12:44,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:12:44,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2023-08-26 15:12:44,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4376577486118122 [2023-08-26 15:12:44,679 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 867 transitions. [2023-08-26 15:12:44,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 867 transitions. [2023-08-26 15:12:44,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:44,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 867 transitions. [2023-08-26 15:12:44,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:44,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:44,684 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:44,684 INFO L175 Difference]: Start difference. First operand has 44 places, 29 transitions, 89 flow. Second operand 7 states and 867 transitions. [2023-08-26 15:12:44,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 105 transitions, 509 flow [2023-08-26 15:12:44,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 105 transitions, 500 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 15:12:44,758 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 218 flow [2023-08-26 15:12:44,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=218, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-26 15:12:44,758 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2023-08-26 15:12:44,759 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 218 flow [2023-08-26 15:12:44,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:44,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:44,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:44,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:12:44,759 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:12:44,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:44,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1786898814, now seen corresponding path program 1 times [2023-08-26 15:12:44,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:44,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104207742] [2023-08-26 15:12:44,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:44,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:12:45,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:45,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104207742] [2023-08-26 15:12:45,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104207742] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:45,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:45,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:12:45,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27929544] [2023-08-26 15:12:45,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:45,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:12:45,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:45,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:12:45,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:12:45,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 283 [2023-08-26 15:12:45,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:45,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:45,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 283 [2023-08-26 15:12:45,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:46,324 INFO L124 PetriNetUnfolderBase]: 11273/15558 cut-off events. [2023-08-26 15:12:46,325 INFO L125 PetriNetUnfolderBase]: For 24394/24394 co-relation queries the response was YES. [2023-08-26 15:12:46,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51504 conditions, 15558 events. 11273/15558 cut-off events. For 24394/24394 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 79171 event pairs, 1211 based on Foata normal form. 652/16210 useless extension candidates. Maximal degree in co-relation 51493. Up to 8683 conditions per place. [2023-08-26 15:12:46,392 INFO L140 encePairwiseOnDemand]: 270/283 looper letters, 64 selfloop transitions, 24 changer transitions 55/143 dead transitions. [2023-08-26 15:12:46,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 143 transitions, 998 flow [2023-08-26 15:12:46,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 15:12:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 15:12:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1099 transitions. [2023-08-26 15:12:46,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4314880251276011 [2023-08-26 15:12:46,395 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1099 transitions. [2023-08-26 15:12:46,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1099 transitions. [2023-08-26 15:12:46,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:46,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1099 transitions. [2023-08-26 15:12:46,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.11111111111111) internal successors, (1099), 9 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:46,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:46,401 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:46,401 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 218 flow. Second operand 9 states and 1099 transitions. [2023-08-26 15:12:46,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 143 transitions, 998 flow [2023-08-26 15:12:46,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 143 transitions, 990 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-26 15:12:46,512 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 442 flow [2023-08-26 15:12:46,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=442, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2023-08-26 15:12:46,513 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2023-08-26 15:12:46,514 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 442 flow [2023-08-26 15:12:46,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:46,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:46,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:46,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:12:46,514 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:12:46,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:46,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1788984184, now seen corresponding path program 1 times [2023-08-26 15:12:46,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:46,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322262195] [2023-08-26 15:12:46,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:46,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:12:46,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:46,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322262195] [2023-08-26 15:12:46,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322262195] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:46,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:46,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:12:46,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666820897] [2023-08-26 15:12:46,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:46,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:12:46,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:46,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:12:46,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:12:46,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 283 [2023-08-26 15:12:46,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 442 flow. Second operand has 5 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 15:12:46,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:46,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 283 [2023-08-26 15:12:46,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:47,892 INFO L124 PetriNetUnfolderBase]: 10319/14264 cut-off events. [2023-08-26 15:12:47,892 INFO L125 PetriNetUnfolderBase]: For 57093/57093 co-relation queries the response was YES. [2023-08-26 15:12:47,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58561 conditions, 14264 events. 10319/14264 cut-off events. For 57093/57093 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 71627 event pairs, 2263 based on Foata normal form. 520/14784 useless extension candidates. Maximal degree in co-relation 58543. Up to 7057 conditions per place. [2023-08-26 15:12:47,955 INFO L140 encePairwiseOnDemand]: 272/283 looper letters, 69 selfloop transitions, 12 changer transitions 38/119 dead transitions. [2023-08-26 15:12:47,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 119 transitions, 1094 flow [2023-08-26 15:12:47,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:12:47,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:12:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2023-08-26 15:12:47,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43109540636042404 [2023-08-26 15:12:47,958 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2023-08-26 15:12:47,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2023-08-26 15:12:47,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:47,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2023-08-26 15:12:47,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:47,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:47,962 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:47,962 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 442 flow. Second operand 7 states and 854 transitions. [2023-08-26 15:12:47,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 119 transitions, 1094 flow [2023-08-26 15:12:48,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 119 transitions, 1080 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-26 15:12:48,064 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 578 flow [2023-08-26 15:12:48,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=578, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2023-08-26 15:12:48,066 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-08-26 15:12:48,068 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 578 flow [2023-08-26 15:12:48,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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 15:12:48,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:48,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:48,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:12:48,068 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:12:48,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:48,069 INFO L85 PathProgramCache]: Analyzing trace with hash -494102128, now seen corresponding path program 1 times [2023-08-26 15:12:48,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:48,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708770362] [2023-08-26 15:12:48,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:48,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:48,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:12:48,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:48,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708770362] [2023-08-26 15:12:48,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708770362] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:48,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:48,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:12:48,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994038121] [2023-08-26 15:12:48,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:48,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:12:48,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:48,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:12:48,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:12:48,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-26 15:12:48,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 578 flow. Second operand has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:48,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:48,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-26 15:12:48,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:49,492 INFO L124 PetriNetUnfolderBase]: 8661/12422 cut-off events. [2023-08-26 15:12:49,493 INFO L125 PetriNetUnfolderBase]: For 69736/70288 co-relation queries the response was YES. [2023-08-26 15:12:49,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54618 conditions, 12422 events. 8661/12422 cut-off events. For 69736/70288 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 68503 event pairs, 1903 based on Foata normal form. 536/12676 useless extension candidates. Maximal degree in co-relation 54597. Up to 7691 conditions per place. [2023-08-26 15:12:49,552 INFO L140 encePairwiseOnDemand]: 276/283 looper letters, 69 selfloop transitions, 9 changer transitions 23/116 dead transitions. [2023-08-26 15:12:49,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 116 transitions, 1184 flow [2023-08-26 15:12:49,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:12:49,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:12:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 787 transitions. [2023-08-26 15:12:49,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634864546525324 [2023-08-26 15:12:49,554 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 787 transitions. [2023-08-26 15:12:49,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 787 transitions. [2023-08-26 15:12:49,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:49,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 787 transitions. [2023-08-26 15:12:49,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:49,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:49,557 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:49,558 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 578 flow. Second operand 6 states and 787 transitions. [2023-08-26 15:12:49,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 116 transitions, 1184 flow [2023-08-26 15:12:49,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 116 transitions, 1145 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-26 15:12:49,739 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 665 flow [2023-08-26 15:12:49,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=665, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2023-08-26 15:12:49,739 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-08-26 15:12:49,739 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 665 flow [2023-08-26 15:12:49,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:49,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:49,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:49,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:12:49,740 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:12:49,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1799243344, now seen corresponding path program 1 times [2023-08-26 15:12:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:49,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964397268] [2023-08-26 15:12:49,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:49,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:12:49,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:49,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964397268] [2023-08-26 15:12:49,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964397268] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:49,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:49,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:12:49,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602016667] [2023-08-26 15:12:49,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:49,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:12:49,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:49,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:12:49,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:12:49,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 283 [2023-08-26 15:12:49,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 665 flow. Second operand has 7 states, 7 states have (on average 123.28571428571429) internal successors, (863), 7 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:49,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:49,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 283 [2023-08-26 15:12:49,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:51,068 INFO L124 PetriNetUnfolderBase]: 8542/12258 cut-off events. [2023-08-26 15:12:51,068 INFO L125 PetriNetUnfolderBase]: For 64631/65151 co-relation queries the response was YES. [2023-08-26 15:12:51,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56167 conditions, 12258 events. 8542/12258 cut-off events. For 64631/65151 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 67806 event pairs, 1753 based on Foata normal form. 408/12416 useless extension candidates. Maximal degree in co-relation 56146. Up to 8445 conditions per place. [2023-08-26 15:12:51,155 INFO L140 encePairwiseOnDemand]: 275/283 looper letters, 69 selfloop transitions, 23 changer transitions 11/118 dead transitions. [2023-08-26 15:12:51,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 118 transitions, 1230 flow [2023-08-26 15:12:51,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:12:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:12:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 789 transitions. [2023-08-26 15:12:51,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46466431095406363 [2023-08-26 15:12:51,158 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 789 transitions. [2023-08-26 15:12:51,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 789 transitions. [2023-08-26 15:12:51,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:51,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 789 transitions. [2023-08-26 15:12:51,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:51,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:51,162 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:51,162 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 665 flow. Second operand 6 states and 789 transitions. [2023-08-26 15:12:51,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 118 transitions, 1230 flow [2023-08-26 15:12:51,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 118 transitions, 1209 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-26 15:12:51,304 INFO L231 Difference]: Finished difference. Result has 71 places, 83 transitions, 913 flow [2023-08-26 15:12:51,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=913, PETRI_PLACES=71, PETRI_TRANSITIONS=83} [2023-08-26 15:12:51,304 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-08-26 15:12:51,304 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 83 transitions, 913 flow [2023-08-26 15:12:51,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.28571428571429) internal successors, (863), 7 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:51,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:51,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:51,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:12:51,305 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:12:51,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:51,305 INFO L85 PathProgramCache]: Analyzing trace with hash -777974892, now seen corresponding path program 2 times [2023-08-26 15:12:51,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:51,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750209560] [2023-08-26 15:12:51,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:51,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:51,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:12:51,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:51,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750209560] [2023-08-26 15:12:51,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750209560] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:51,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:51,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:12:51,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614500215] [2023-08-26 15:12:51,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:51,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:12:51,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:51,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:12:51,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:12:51,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-26 15:12:51,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 83 transitions, 913 flow. Second operand has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:51,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:51,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-26 15:12:51,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:52,657 INFO L124 PetriNetUnfolderBase]: 8283/11915 cut-off events. [2023-08-26 15:12:52,657 INFO L125 PetriNetUnfolderBase]: For 71646/72166 co-relation queries the response was YES. [2023-08-26 15:12:52,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57198 conditions, 11915 events. 8283/11915 cut-off events. For 71646/72166 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 65874 event pairs, 1669 based on Foata normal form. 412/12085 useless extension candidates. Maximal degree in co-relation 57176. Up to 7921 conditions per place. [2023-08-26 15:12:52,752 INFO L140 encePairwiseOnDemand]: 276/283 looper letters, 71 selfloop transitions, 25 changer transitions 19/130 dead transitions. [2023-08-26 15:12:52,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 130 transitions, 1484 flow [2023-08-26 15:12:52,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:12:52,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:12:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 909 transitions. [2023-08-26 15:12:52,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45885916203937405 [2023-08-26 15:12:52,755 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 909 transitions. [2023-08-26 15:12:52,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 909 transitions. [2023-08-26 15:12:52,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:52,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 909 transitions. [2023-08-26 15:12:52,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.85714285714286) internal successors, (909), 7 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:52,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:52,759 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:52,759 INFO L175 Difference]: Start difference. First operand has 71 places, 83 transitions, 913 flow. Second operand 7 states and 909 transitions. [2023-08-26 15:12:52,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 130 transitions, 1484 flow [2023-08-26 15:12:52,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 130 transitions, 1444 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-26 15:12:52,923 INFO L231 Difference]: Finished difference. Result has 77 places, 87 transitions, 1027 flow [2023-08-26 15:12:52,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1027, PETRI_PLACES=77, PETRI_TRANSITIONS=87} [2023-08-26 15:12:52,924 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2023-08-26 15:12:52,924 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 87 transitions, 1027 flow [2023-08-26 15:12:52,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:52,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:52,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:52,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:12:52,925 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:12:52,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:52,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1279786769, now seen corresponding path program 1 times [2023-08-26 15:12:52,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:52,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643222718] [2023-08-26 15:12:52,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:52,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:53,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 15:12:53,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:53,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643222718] [2023-08-26 15:12:53,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643222718] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:53,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:53,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 15:12:53,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166631107] [2023-08-26 15:12:53,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:53,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 15:12:53,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:53,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 15:12:53,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-26 15:12:53,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-26 15:12:53,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 87 transitions, 1027 flow. Second operand has 8 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:53,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:53,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-26 15:12:53,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:54,491 INFO L124 PetriNetUnfolderBase]: 8821/12698 cut-off events. [2023-08-26 15:12:54,491 INFO L125 PetriNetUnfolderBase]: For 90034/90744 co-relation queries the response was YES. [2023-08-26 15:12:54,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63179 conditions, 12698 events. 8821/12698 cut-off events. For 90034/90744 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 71360 event pairs, 1421 based on Foata normal form. 336/12704 useless extension candidates. Maximal degree in co-relation 63155. Up to 7653 conditions per place. [2023-08-26 15:12:54,608 INFO L140 encePairwiseOnDemand]: 276/283 looper letters, 81 selfloop transitions, 23 changer transitions 14/133 dead transitions. [2023-08-26 15:12:54,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 133 transitions, 1552 flow [2023-08-26 15:12:54,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:12:54,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:12:54,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 908 transitions. [2023-08-26 15:12:54,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45835436648157496 [2023-08-26 15:12:54,613 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 908 transitions. [2023-08-26 15:12:54,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 908 transitions. [2023-08-26 15:12:54,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:54,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 908 transitions. [2023-08-26 15:12:54,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.71428571428572) internal successors, (908), 7 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:54,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:54,617 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:54,617 INFO L175 Difference]: Start difference. First operand has 77 places, 87 transitions, 1027 flow. Second operand 7 states and 908 transitions. [2023-08-26 15:12:54,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 133 transitions, 1552 flow [2023-08-26 15:12:54,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 133 transitions, 1478 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-08-26 15:12:54,814 INFO L231 Difference]: Finished difference. Result has 79 places, 89 transitions, 1077 flow [2023-08-26 15:12:54,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1077, PETRI_PLACES=79, PETRI_TRANSITIONS=89} [2023-08-26 15:12:54,815 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2023-08-26 15:12:54,815 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 89 transitions, 1077 flow [2023-08-26 15:12:54,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:54,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:54,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:54,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:12:54,815 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:12:54,816 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:54,816 INFO L85 PathProgramCache]: Analyzing trace with hash -58900165, now seen corresponding path program 2 times [2023-08-26 15:12:54,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:54,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658866543] [2023-08-26 15:12:54,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:54,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:12:55,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:55,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658866543] [2023-08-26 15:12:55,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658866543] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:55,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:55,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 15:12:55,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376104715] [2023-08-26 15:12:55,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:55,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 15:12:55,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:55,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 15:12:55,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-26 15:12:55,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 283 [2023-08-26 15:12:55,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 89 transitions, 1077 flow. Second operand has 9 states, 9 states have (on average 108.88888888888889) internal successors, (980), 9 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:55,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:55,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 283 [2023-08-26 15:12:55,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:57,262 INFO L124 PetriNetUnfolderBase]: 12631/17456 cut-off events. [2023-08-26 15:12:57,262 INFO L125 PetriNetUnfolderBase]: For 108504/108504 co-relation queries the response was YES. [2023-08-26 15:12:57,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86341 conditions, 17456 events. 12631/17456 cut-off events. For 108504/108504 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 90825 event pairs, 977 based on Foata normal form. 192/17648 useless extension candidates. Maximal degree in co-relation 86316. Up to 9589 conditions per place. [2023-08-26 15:12:57,389 INFO L140 encePairwiseOnDemand]: 270/283 looper letters, 113 selfloop transitions, 61 changer transitions 27/201 dead transitions. [2023-08-26 15:12:57,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 201 transitions, 2358 flow [2023-08-26 15:12:57,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 15:12:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 15:12:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1197 transitions. [2023-08-26 15:12:57,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4229681978798587 [2023-08-26 15:12:57,392 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1197 transitions. [2023-08-26 15:12:57,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1197 transitions. [2023-08-26 15:12:57,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:57,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1197 transitions. [2023-08-26 15:12:57,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.7) internal successors, (1197), 10 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:57,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 283.0) internal successors, (3113), 11 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:57,397 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 283.0) internal successors, (3113), 11 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:57,397 INFO L175 Difference]: Start difference. First operand has 79 places, 89 transitions, 1077 flow. Second operand 10 states and 1197 transitions. [2023-08-26 15:12:57,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 201 transitions, 2358 flow [2023-08-26 15:12:57,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 201 transitions, 2302 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-26 15:12:57,764 INFO L231 Difference]: Finished difference. Result has 90 places, 122 transitions, 1782 flow [2023-08-26 15:12:57,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1782, PETRI_PLACES=90, PETRI_TRANSITIONS=122} [2023-08-26 15:12:57,764 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 39 predicate places. [2023-08-26 15:12:57,764 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 122 transitions, 1782 flow [2023-08-26 15:12:57,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 108.88888888888889) internal successors, (980), 9 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:57,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:57,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:57,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 15:12:57,765 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:12:57,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:57,765 INFO L85 PathProgramCache]: Analyzing trace with hash -281848665, now seen corresponding path program 3 times [2023-08-26 15:12:57,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:57,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198692564] [2023-08-26 15:12:57,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:57,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:58,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:12:58,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:58,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198692564] [2023-08-26 15:12:58,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198692564] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:58,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:58,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 15:12:58,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129368240] [2023-08-26 15:12:58,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:58,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 15:12:58,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:58,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 15:12:58,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 15:12:58,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 283 [2023-08-26 15:12:58,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 122 transitions, 1782 flow. Second operand has 8 states, 8 states have (on average 121.125) internal successors, (969), 8 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:58,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:58,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 283 [2023-08-26 15:12:58,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:59,744 INFO L124 PetriNetUnfolderBase]: 10530/15297 cut-off events. [2023-08-26 15:12:59,744 INFO L125 PetriNetUnfolderBase]: For 146539/147232 co-relation queries the response was YES. [2023-08-26 15:12:59,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83716 conditions, 15297 events. 10530/15297 cut-off events. For 146539/147232 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 89106 event pairs, 1161 based on Foata normal form. 466/15636 useless extension candidates. Maximal degree in co-relation 83686. Up to 7907 conditions per place. [2023-08-26 15:12:59,854 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 105 selfloop transitions, 23 changer transitions 14/170 dead transitions. [2023-08-26 15:12:59,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 170 transitions, 2432 flow [2023-08-26 15:12:59,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:12:59,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:12:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 901 transitions. [2023-08-26 15:12:59,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4548207975769813 [2023-08-26 15:12:59,856 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 901 transitions. [2023-08-26 15:12:59,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 901 transitions. [2023-08-26 15:12:59,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:59,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 901 transitions. [2023-08-26 15:12:59,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.71428571428572) internal successors, (901), 7 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:59,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:59,860 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:59,860 INFO L175 Difference]: Start difference. First operand has 90 places, 122 transitions, 1782 flow. Second operand 7 states and 901 transitions. [2023-08-26 15:12:59,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 170 transitions, 2432 flow [2023-08-26 15:13:00,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 170 transitions, 2325 flow, removed 43 selfloop flow, removed 4 redundant places. [2023-08-26 15:13:00,519 INFO L231 Difference]: Finished difference. Result has 92 places, 124 transitions, 1811 flow [2023-08-26 15:13:00,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1689, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1811, PETRI_PLACES=92, PETRI_TRANSITIONS=124} [2023-08-26 15:13:00,519 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 41 predicate places. [2023-08-26 15:13:00,519 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 124 transitions, 1811 flow [2023-08-26 15:13:00,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 121.125) internal successors, (969), 8 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:00,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:00,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:00,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 15:13:00,520 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:00,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:00,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1881272345, now seen corresponding path program 4 times [2023-08-26 15:13:00,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:00,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589336733] [2023-08-26 15:13:00,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:00,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:00,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:13:00,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:00,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589336733] [2023-08-26 15:13:00,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589336733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:00,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:00,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 15:13:00,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427964] [2023-08-26 15:13:00,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:00,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 15:13:00,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:00,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 15:13:00,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 15:13:00,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 283 [2023-08-26 15:13:00,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 124 transitions, 1811 flow. Second operand has 8 states, 8 states have (on average 109.125) internal successors, (873), 8 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:00,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:00,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 283 [2023-08-26 15:13:00,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:02,975 INFO L124 PetriNetUnfolderBase]: 15061/21090 cut-off events. [2023-08-26 15:13:02,976 INFO L125 PetriNetUnfolderBase]: For 185966/185966 co-relation queries the response was YES. [2023-08-26 15:13:03,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111479 conditions, 21090 events. 15061/21090 cut-off events. For 185966/185966 co-relation queries the response was YES. Maximal size of possible extension queue 724. Compared 116566 event pairs, 887 based on Foata normal form. 448/21538 useless extension candidates. Maximal degree in co-relation 111447. Up to 10576 conditions per place. [2023-08-26 15:13:03,218 INFO L140 encePairwiseOnDemand]: 272/283 looper letters, 149 selfloop transitions, 66 changer transitions 38/253 dead transitions. [2023-08-26 15:13:03,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 253 transitions, 3525 flow [2023-08-26 15:13:03,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 15:13:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 15:13:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1312 transitions. [2023-08-26 15:13:03,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42145840025698683 [2023-08-26 15:13:03,222 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1312 transitions. [2023-08-26 15:13:03,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1312 transitions. [2023-08-26 15:13:03,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:03,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1312 transitions. [2023-08-26 15:13:03,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.27272727272727) internal successors, (1312), 11 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:03,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 283.0) internal successors, (3396), 12 states have internal predecessors, (3396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:03,230 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 283.0) internal successors, (3396), 12 states have internal predecessors, (3396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:03,230 INFO L175 Difference]: Start difference. First operand has 92 places, 124 transitions, 1811 flow. Second operand 11 states and 1312 transitions. [2023-08-26 15:13:03,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 253 transitions, 3525 flow [2023-08-26 15:13:04,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 253 transitions, 3431 flow, removed 31 selfloop flow, removed 6 redundant places. [2023-08-26 15:13:04,502 INFO L231 Difference]: Finished difference. Result has 102 places, 154 transitions, 2487 flow [2023-08-26 15:13:04,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1751, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2487, PETRI_PLACES=102, PETRI_TRANSITIONS=154} [2023-08-26 15:13:04,503 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 51 predicate places. [2023-08-26 15:13:04,503 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 154 transitions, 2487 flow [2023-08-26 15:13:04,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.125) internal successors, (873), 8 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:04,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:04,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:04,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 15:13:04,504 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:04,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:04,504 INFO L85 PathProgramCache]: Analyzing trace with hash -27735913, now seen corresponding path program 1 times [2023-08-26 15:13:04,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:04,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019376398] [2023-08-26 15:13:04,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:04,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:04,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:13:04,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:04,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019376398] [2023-08-26 15:13:04,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019376398] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:04,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:04,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:13:04,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122733796] [2023-08-26 15:13:04,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:04,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:13:04,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:04,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:13:04,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:13:04,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 283 [2023-08-26 15:13:04,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 154 transitions, 2487 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:04,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:04,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 283 [2023-08-26 15:13:04,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:05,927 INFO L124 PetriNetUnfolderBase]: 7155/10793 cut-off events. [2023-08-26 15:13:05,928 INFO L125 PetriNetUnfolderBase]: For 138757/140392 co-relation queries the response was YES. [2023-08-26 15:13:05,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61045 conditions, 10793 events. 7155/10793 cut-off events. For 138757/140392 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 66815 event pairs, 1547 based on Foata normal form. 870/11416 useless extension candidates. Maximal degree in co-relation 61008. Up to 9054 conditions per place. [2023-08-26 15:13:06,026 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 157 selfloop transitions, 5 changer transitions 0/206 dead transitions. [2023-08-26 15:13:06,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 206 transitions, 3630 flow [2023-08-26 15:13:06,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:13:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:13:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-26 15:13:06,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793875147232038 [2023-08-26 15:13:06,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-26 15:13:06,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-26 15:13:06,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:06,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-26 15:13:06,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:06,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:06,040 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:06,040 INFO L175 Difference]: Start difference. First operand has 102 places, 154 transitions, 2487 flow. Second operand 3 states and 407 transitions. [2023-08-26 15:13:06,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 206 transitions, 3630 flow [2023-08-26 15:13:06,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 206 transitions, 3568 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-08-26 15:13:06,313 INFO L231 Difference]: Finished difference. Result has 96 places, 152 transitions, 2380 flow [2023-08-26 15:13:06,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=2347, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2380, PETRI_PLACES=96, PETRI_TRANSITIONS=152} [2023-08-26 15:13:06,314 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 45 predicate places. [2023-08-26 15:13:06,314 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 152 transitions, 2380 flow [2023-08-26 15:13:06,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:06,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:06,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:06,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 15:13:06,314 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:06,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:06,315 INFO L85 PathProgramCache]: Analyzing trace with hash -67390542, now seen corresponding path program 1 times [2023-08-26 15:13:06,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:06,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994172359] [2023-08-26 15:13:06,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:06,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:13:06,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:06,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994172359] [2023-08-26 15:13:06,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994172359] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:06,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:06,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:13:06,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647627505] [2023-08-26 15:13:06,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:06,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:13:06,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:06,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:13:06,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:13:06,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 283 [2023-08-26 15:13:06,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 152 transitions, 2380 flow. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:06,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:06,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 283 [2023-08-26 15:13:06,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:07,441 INFO L124 PetriNetUnfolderBase]: 3571/5744 cut-off events. [2023-08-26 15:13:07,441 INFO L125 PetriNetUnfolderBase]: For 67803/68601 co-relation queries the response was YES. [2023-08-26 15:13:07,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34370 conditions, 5744 events. 3571/5744 cut-off events. For 67803/68601 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 34949 event pairs, 482 based on Foata normal form. 771/6404 useless extension candidates. Maximal degree in co-relation 34335. Up to 3108 conditions per place. [2023-08-26 15:13:07,477 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 198 selfloop transitions, 9 changer transitions 0/249 dead transitions. [2023-08-26 15:13:07,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 249 transitions, 4323 flow [2023-08-26 15:13:07,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:13:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:13:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2023-08-26 15:13:07,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48056537102473496 [2023-08-26 15:13:07,479 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 544 transitions. [2023-08-26 15:13:07,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions. [2023-08-26 15:13:07,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:07,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions. [2023-08-26 15:13:07,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:07,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:07,482 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:07,482 INFO L175 Difference]: Start difference. First operand has 96 places, 152 transitions, 2380 flow. Second operand 4 states and 544 transitions. [2023-08-26 15:13:07,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 249 transitions, 4323 flow [2023-08-26 15:13:07,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 249 transitions, 4298 flow, removed 10 selfloop flow, removed 1 redundant places. [2023-08-26 15:13:07,596 INFO L231 Difference]: Finished difference. Result has 99 places, 144 transitions, 2172 flow [2023-08-26 15:13:07,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=2120, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2172, PETRI_PLACES=99, PETRI_TRANSITIONS=144} [2023-08-26 15:13:07,596 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 48 predicate places. [2023-08-26 15:13:07,596 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 144 transitions, 2172 flow [2023-08-26 15:13:07,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:07,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:07,597 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] [2023-08-26 15:13:07,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 15:13:07,597 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:07,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:07,597 INFO L85 PathProgramCache]: Analyzing trace with hash 419047996, now seen corresponding path program 1 times [2023-08-26 15:13:07,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:07,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985456031] [2023-08-26 15:13:07,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:07,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:13:07,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:07,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985456031] [2023-08-26 15:13:07,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985456031] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:07,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:07,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:13:07,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132259578] [2023-08-26 15:13:07,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:07,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:13:07,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:07,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:13:07,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:13:07,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 283 [2023-08-26 15:13:07,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 144 transitions, 2172 flow. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:07,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:07,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 283 [2023-08-26 15:13:07,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:08,648 INFO L124 PetriNetUnfolderBase]: 5009/8141 cut-off events. [2023-08-26 15:13:08,648 INFO L125 PetriNetUnfolderBase]: For 91123/91401 co-relation queries the response was YES. [2023-08-26 15:13:08,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51243 conditions, 8141 events. 5009/8141 cut-off events. For 91123/91401 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 51807 event pairs, 1431 based on Foata normal form. 138/8192 useless extension candidates. Maximal degree in co-relation 51207. Up to 3943 conditions per place. [2023-08-26 15:13:08,702 INFO L140 encePairwiseOnDemand]: 279/283 looper letters, 99 selfloop transitions, 17 changer transitions 81/211 dead transitions. [2023-08-26 15:13:08,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 211 transitions, 3320 flow [2023-08-26 15:13:08,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:13:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:13:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2023-08-26 15:13:08,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47491166077738517 [2023-08-26 15:13:08,704 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2023-08-26 15:13:08,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2023-08-26 15:13:08,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:08,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2023-08-26 15:13:08,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:08,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:08,708 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:08,708 INFO L175 Difference]: Start difference. First operand has 99 places, 144 transitions, 2172 flow. Second operand 5 states and 672 transitions. [2023-08-26 15:13:08,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 211 transitions, 3320 flow [2023-08-26 15:13:08,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 211 transitions, 3270 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-26 15:13:08,924 INFO L231 Difference]: Finished difference. Result has 104 places, 105 transitions, 1487 flow [2023-08-26 15:13:08,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=2140, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1487, PETRI_PLACES=104, PETRI_TRANSITIONS=105} [2023-08-26 15:13:08,924 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 53 predicate places. [2023-08-26 15:13:08,924 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 105 transitions, 1487 flow [2023-08-26 15:13:08,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:08,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:08,925 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] [2023-08-26 15:13:08,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 15:13:08,925 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:08,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:08,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1596666494, now seen corresponding path program 1 times [2023-08-26 15:13:08,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:08,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217022317] [2023-08-26 15:13:08,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:08,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:09,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:13:09,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:09,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217022317] [2023-08-26 15:13:09,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217022317] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:09,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:09,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 15:13:09,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246467237] [2023-08-26 15:13:09,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:09,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 15:13:09,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:09,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 15:13:09,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 15:13:09,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 283 [2023-08-26 15:13:09,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 105 transitions, 1487 flow. Second operand has 8 states, 8 states have (on average 108.625) internal successors, (869), 8 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:09,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:09,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 283 [2023-08-26 15:13:09,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:10,777 INFO L124 PetriNetUnfolderBase]: 6829/10847 cut-off events. [2023-08-26 15:13:10,778 INFO L125 PetriNetUnfolderBase]: For 126286/126286 co-relation queries the response was YES. [2023-08-26 15:13:10,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66654 conditions, 10847 events. 6829/10847 cut-off events. For 126286/126286 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 69057 event pairs, 789 based on Foata normal form. 92/10939 useless extension candidates. Maximal degree in co-relation 66615. Up to 4990 conditions per place. [2023-08-26 15:13:10,858 INFO L140 encePairwiseOnDemand]: 270/283 looper letters, 195 selfloop transitions, 92 changer transitions 74/361 dead transitions. [2023-08-26 15:13:10,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 361 transitions, 5396 flow [2023-08-26 15:13:10,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 15:13:10,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 15:13:10,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1208 transitions. [2023-08-26 15:13:10,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268551236749117 [2023-08-26 15:13:10,860 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1208 transitions. [2023-08-26 15:13:10,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1208 transitions. [2023-08-26 15:13:10,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:10,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1208 transitions. [2023-08-26 15:13:10,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.8) internal successors, (1208), 10 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:10,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 283.0) internal successors, (3113), 11 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:10,865 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 283.0) internal successors, (3113), 11 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:10,865 INFO L175 Difference]: Start difference. First operand has 104 places, 105 transitions, 1487 flow. Second operand 10 states and 1208 transitions. [2023-08-26 15:13:10,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 361 transitions, 5396 flow [2023-08-26 15:13:11,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 361 transitions, 5241 flow, removed 50 selfloop flow, removed 4 redundant places. [2023-08-26 15:13:11,121 INFO L231 Difference]: Finished difference. Result has 113 places, 172 transitions, 2956 flow [2023-08-26 15:13:11,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1436, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2956, PETRI_PLACES=113, PETRI_TRANSITIONS=172} [2023-08-26 15:13:11,121 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 62 predicate places. [2023-08-26 15:13:11,121 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 172 transitions, 2956 flow [2023-08-26 15:13:11,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.625) internal successors, (869), 8 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:11,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:11,122 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] [2023-08-26 15:13:11,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 15:13:11,122 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:11,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:11,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1404353533, now seen corresponding path program 1 times [2023-08-26 15:13:11,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:11,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145819316] [2023-08-26 15:13:11,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:11,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:13:11,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:11,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145819316] [2023-08-26 15:13:11,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145819316] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:11,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:11,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:13:11,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374836953] [2023-08-26 15:13:11,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:11,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:13:11,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:11,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:13:11,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:13:11,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 283 [2023-08-26 15:13:11,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 172 transitions, 2956 flow. Second operand has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:11,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:11,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 283 [2023-08-26 15:13:11,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:11,739 INFO L124 PetriNetUnfolderBase]: 2590/4316 cut-off events. [2023-08-26 15:13:11,739 INFO L125 PetriNetUnfolderBase]: For 58937/59846 co-relation queries the response was YES. [2023-08-26 15:13:11,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27239 conditions, 4316 events. 2590/4316 cut-off events. For 58937/59846 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 26977 event pairs, 215 based on Foata normal form. 674/4882 useless extension candidates. Maximal degree in co-relation 27197. Up to 1674 conditions per place. [2023-08-26 15:13:11,769 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 232 selfloop transitions, 13 changer transitions 9/289 dead transitions. [2023-08-26 15:13:11,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 289 transitions, 5511 flow [2023-08-26 15:13:11,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:13:11,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:13:11,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2023-08-26 15:13:11,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47985865724381627 [2023-08-26 15:13:11,770 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 679 transitions. [2023-08-26 15:13:11,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 679 transitions. [2023-08-26 15:13:11,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:11,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 679 transitions. [2023-08-26 15:13:11,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:11,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:11,772 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:11,772 INFO L175 Difference]: Start difference. First operand has 113 places, 172 transitions, 2956 flow. Second operand 5 states and 679 transitions. [2023-08-26 15:13:11,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 289 transitions, 5511 flow [2023-08-26 15:13:11,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 289 transitions, 5201 flow, removed 50 selfloop flow, removed 11 redundant places. [2023-08-26 15:13:11,869 INFO L231 Difference]: Finished difference. Result has 105 places, 138 transitions, 2248 flow [2023-08-26 15:13:11,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=2250, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2248, PETRI_PLACES=105, PETRI_TRANSITIONS=138} [2023-08-26 15:13:11,870 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 54 predicate places. [2023-08-26 15:13:11,870 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 138 transitions, 2248 flow [2023-08-26 15:13:11,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:11,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:11,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:11,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 15:13:11,871 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:11,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:11,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1350082908, now seen corresponding path program 1 times [2023-08-26 15:13:11,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:11,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537848047] [2023-08-26 15:13:11,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:11,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:12,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:13:12,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:12,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537848047] [2023-08-26 15:13:12,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537848047] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:12,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:12,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:13:12,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036375929] [2023-08-26 15:13:12,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:12,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:13:12,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:12,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:13:12,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:13:12,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 283 [2023-08-26 15:13:12,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 138 transitions, 2248 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:12,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:12,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 283 [2023-08-26 15:13:12,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:13,015 INFO L124 PetriNetUnfolderBase]: 4400/7132 cut-off events. [2023-08-26 15:13:13,015 INFO L125 PetriNetUnfolderBase]: For 82703/82703 co-relation queries the response was YES. [2023-08-26 15:13:13,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46920 conditions, 7132 events. 4400/7132 cut-off events. For 82703/82703 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 43559 event pairs, 478 based on Foata normal form. 15/7147 useless extension candidates. Maximal degree in co-relation 46882. Up to 3529 conditions per place. [2023-08-26 15:13:13,051 INFO L140 encePairwiseOnDemand]: 271/283 looper letters, 101 selfloop transitions, 19 changer transitions 145/265 dead transitions. [2023-08-26 15:13:13,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 265 transitions, 4180 flow [2023-08-26 15:13:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:13:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:13:13,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 857 transitions. [2023-08-26 15:13:13,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4326097930338213 [2023-08-26 15:13:13,053 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 857 transitions. [2023-08-26 15:13:13,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 857 transitions. [2023-08-26 15:13:13,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:13,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 857 transitions. [2023-08-26 15:13:13,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:13,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:13,056 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:13,056 INFO L175 Difference]: Start difference. First operand has 105 places, 138 transitions, 2248 flow. Second operand 7 states and 857 transitions. [2023-08-26 15:13:13,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 265 transitions, 4180 flow [2023-08-26 15:13:13,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 265 transitions, 4016 flow, removed 45 selfloop flow, removed 4 redundant places. [2023-08-26 15:13:13,317 INFO L231 Difference]: Finished difference. Result has 109 places, 78 transitions, 1091 flow [2023-08-26 15:13:13,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=2208, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1091, PETRI_PLACES=109, PETRI_TRANSITIONS=78} [2023-08-26 15:13:13,317 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 58 predicate places. [2023-08-26 15:13:13,317 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 78 transitions, 1091 flow [2023-08-26 15:13:13,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:13,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:13,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:13,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 15:13:13,318 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:13,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:13,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1807545377, now seen corresponding path program 1 times [2023-08-26 15:13:13,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:13,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460794391] [2023-08-26 15:13:13,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:13,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:13,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:13:13,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:13,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460794391] [2023-08-26 15:13:13,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460794391] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:13,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:13,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:13:13,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428329788] [2023-08-26 15:13:13,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:13,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:13:13,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:13,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:13:13,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:13:13,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 283 [2023-08-26 15:13:13,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 78 transitions, 1091 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:13,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:13,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 283 [2023-08-26 15:13:13,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:14,226 INFO L124 PetriNetUnfolderBase]: 2331/4011 cut-off events. [2023-08-26 15:13:14,227 INFO L125 PetriNetUnfolderBase]: For 42272/42272 co-relation queries the response was YES. [2023-08-26 15:13:14,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23746 conditions, 4011 events. 2331/4011 cut-off events. For 42272/42272 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 23870 event pairs, 370 based on Foata normal form. 13/4024 useless extension candidates. Maximal degree in co-relation 23707. Up to 1803 conditions per place. [2023-08-26 15:13:14,248 INFO L140 encePairwiseOnDemand]: 271/283 looper letters, 120 selfloop transitions, 19 changer transitions 59/198 dead transitions. [2023-08-26 15:13:14,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 198 transitions, 2811 flow [2023-08-26 15:13:14,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:13:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:13:14,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 843 transitions. [2023-08-26 15:13:14,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425542655224634 [2023-08-26 15:13:14,250 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 843 transitions. [2023-08-26 15:13:14,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 843 transitions. [2023-08-26 15:13:14,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:14,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 843 transitions. [2023-08-26 15:13:14,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:14,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:14,274 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:14,274 INFO L175 Difference]: Start difference. First operand has 109 places, 78 transitions, 1091 flow. Second operand 7 states and 843 transitions. [2023-08-26 15:13:14,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 198 transitions, 2811 flow [2023-08-26 15:13:14,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 198 transitions, 2563 flow, removed 37 selfloop flow, removed 13 redundant places. [2023-08-26 15:13:14,397 INFO L231 Difference]: Finished difference. Result has 100 places, 79 transitions, 1009 flow [2023-08-26 15:13:14,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1009, PETRI_PLACES=100, PETRI_TRANSITIONS=79} [2023-08-26 15:13:14,398 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 49 predicate places. [2023-08-26 15:13:14,398 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 79 transitions, 1009 flow [2023-08-26 15:13:14,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:14,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:14,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:14,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 15:13:14,399 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:14,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:14,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1141246491, now seen corresponding path program 1 times [2023-08-26 15:13:14,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:14,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677062944] [2023-08-26 15:13:14,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:14,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:13:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:13:14,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:13:14,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677062944] [2023-08-26 15:13:14,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677062944] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:13:14,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:13:14,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:13:14,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970091512] [2023-08-26 15:13:14,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:13:14,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:13:14,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:13:14,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:13:14,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:13:14,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 283 [2023-08-26 15:13:14,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 79 transitions, 1009 flow. Second operand has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:14,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:13:14,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 283 [2023-08-26 15:13:14,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:13:14,906 INFO L124 PetriNetUnfolderBase]: 1505/2633 cut-off events. [2023-08-26 15:13:14,906 INFO L125 PetriNetUnfolderBase]: For 21219/21554 co-relation queries the response was YES. [2023-08-26 15:13:14,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14020 conditions, 2633 events. 1505/2633 cut-off events. For 21219/21554 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16317 event pairs, 161 based on Foata normal form. 219/2778 useless extension candidates. Maximal degree in co-relation 13986. Up to 957 conditions per place. [2023-08-26 15:13:14,921 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 33 selfloop transitions, 17 changer transitions 94/148 dead transitions. [2023-08-26 15:13:14,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 148 transitions, 2233 flow [2023-08-26 15:13:14,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:13:14,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:13:14,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 796 transitions. [2023-08-26 15:13:14,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46878680800942285 [2023-08-26 15:13:14,923 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 796 transitions. [2023-08-26 15:13:14,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 796 transitions. [2023-08-26 15:13:14,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:13:14,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 796 transitions. [2023-08-26 15:13:14,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:14,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:14,926 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:14,926 INFO L175 Difference]: Start difference. First operand has 100 places, 79 transitions, 1009 flow. Second operand 6 states and 796 transitions. [2023-08-26 15:13:14,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 148 transitions, 2233 flow [2023-08-26 15:13:14,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 148 transitions, 2143 flow, removed 26 selfloop flow, removed 5 redundant places. [2023-08-26 15:13:14,991 INFO L231 Difference]: Finished difference. Result has 100 places, 41 transitions, 394 flow [2023-08-26 15:13:14,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=100, PETRI_TRANSITIONS=41} [2023-08-26 15:13:14,991 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 49 predicate places. [2023-08-26 15:13:14,991 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 41 transitions, 394 flow [2023-08-26 15:13:14,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:13:14,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:13:14,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:14,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 15:13:14,992 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:13:14,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:13:14,992 INFO L85 PathProgramCache]: Analyzing trace with hash -666923481, now seen corresponding path program 1 times [2023-08-26 15:13:14,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:13:14,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309877169] [2023-08-26 15:13:14,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:13:14,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:13:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:13:15,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:13:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:13:15,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:13:15,125 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:13:15,126 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 15:13:15,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 15:13:15,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 15:13:15,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 15:13:15,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 15:13:15,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 15:13:15,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 15:13:15,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 15:13:15,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 15:13:15,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 15:13:15,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 15:13:15,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 15:13:15,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 15:13:15,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 15:13:15,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 15:13:15,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 15:13:15,138 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:13:15,146 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:13:15,146 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:13:15,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:13:15 BasicIcfg [2023-08-26 15:13:15,216 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:13:15,217 INFO L158 Benchmark]: Toolchain (without parser) took 38850.89ms. Allocated memory was 360.7MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 335.0MB in the beginning and 1.1GB in the end (delta: -793.5MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-08-26 15:13:15,217 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 360.7MB. Free memory was 337.3MB in the beginning and 337.1MB in the end (delta: 211.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:13:15,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.77ms. Allocated memory is still 360.7MB. Free memory was 335.0MB in the beginning and 310.9MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 15:13:15,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.04ms. Allocated memory is still 360.7MB. Free memory was 310.9MB in the beginning and 308.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:13:15,218 INFO L158 Benchmark]: Boogie Preprocessor took 26.98ms. Allocated memory is still 360.7MB. Free memory was 308.8MB in the beginning and 306.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:13:15,218 INFO L158 Benchmark]: RCFGBuilder took 612.06ms. Allocated memory is still 360.7MB. Free memory was 306.7MB in the beginning and 268.8MB in the end (delta: 37.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-26 15:13:15,218 INFO L158 Benchmark]: TraceAbstraction took 37755.28ms. Allocated memory was 360.7MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 267.9MB in the beginning and 1.1GB in the end (delta: -860.6MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-08-26 15:13:15,219 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 360.7MB. Free memory was 337.3MB in the beginning and 337.1MB in the end (delta: 211.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 395.77ms. Allocated memory is still 360.7MB. Free memory was 335.0MB in the beginning and 310.9MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.04ms. Allocated memory is still 360.7MB. Free memory was 310.9MB in the beginning and 308.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.98ms. Allocated memory is still 360.7MB. Free memory was 308.8MB in the beginning and 306.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 612.06ms. Allocated memory is still 360.7MB. Free memory was 306.7MB in the beginning and 268.8MB in the end (delta: 37.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 37755.28ms. Allocated memory was 360.7MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 267.9MB in the beginning and 1.1GB in the end (delta: -860.6MB). Peak memory consumption was 1.2GB. 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.4s, 148 PlacesBefore, 51 PlacesAfterwards, 138 TransitionsBefore, 39 TransitionsAfterwards, 3316 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 141 TotalNumberOfCompositions, 9022 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3507, independent: 3288, independent conditional: 0, independent unconditional: 3288, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1805, independent: 1768, independent conditional: 0, independent unconditional: 1768, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3507, independent: 1520, independent conditional: 0, independent unconditional: 1520, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 1805, unknown conditional: 0, unknown unconditional: 1805] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 136, Positive conditional cache size: 0, Positive unconditional cache size: 136, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1221; [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1221, ((void *)0), P0, ((void *)0))=-3, t1221={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1222; [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1222, ((void *)0), P1, ((void *)0))=-2, t1221={5:0}, t1222={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1223; [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1223, ((void *)0), P2, ((void *)0))=-1, t1221={5:0}, t1222={6:0}, t1223={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1224; [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1224, ((void *)0), P3, ((void *)0))=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [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 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix046.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 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: 847]: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 177 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 37.6s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 27.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 925 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 925 mSDsluCounter, 348 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 235 mSDsCounter, 143 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3303 IncrementalHoareTripleChecker+Invalid, 3446 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 143 mSolverCounterUnsat, 113 mSDtfsCounter, 3303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2956occurred in iteration=17, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 326 ConstructedInterpolants, 0 QuantifiedInterpolants, 3428 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 15:13:15,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...