/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/mix043.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:12:00,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:12:00,495 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:00,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:12:00,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:12:00,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:12:00,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:12:00,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:12:00,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:12:00,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:12:00,535 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:12:00,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:12:00,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:12:00,536 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:12:00,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:12:00,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:12:00,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:12:00,537 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:12:00,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:12:00,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:12:00,538 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:12:00,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:12:00,539 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:12:00,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:12:00,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:12:00,539 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:12:00,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:12:00,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:12:00,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:12:00,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:12:00,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:12:00,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:12:00,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:12:00,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:12:00,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:12:00,542 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:00,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:12:00,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:12:00,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:12:00,865 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:12:00,866 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:12:00,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.opt.i [2023-08-26 15:12:02,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:12:02,274 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:12:02,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.opt.i [2023-08-26 15:12:02,289 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f5bdf352/99450246d24c4968a0fc2c01aa9e5c95/FLAG26f863c58 [2023-08-26 15:12:02,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f5bdf352/99450246d24c4968a0fc2c01aa9e5c95 [2023-08-26 15:12:02,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:12:02,312 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:12:02,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:12:02,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:12:02,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:12:02,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:12:02" (1/1) ... [2023-08-26 15:12:02,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df9a11f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:12:02, skipping insertion in model container [2023-08-26 15:12:02,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:12:02" (1/1) ... [2023-08-26 15:12:02,373 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:12:02,760 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:12:02,775 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:12:02,810 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:12:02,812 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:12:02,854 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:12:02,889 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:12:02,889 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:12:02,894 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:12:02,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:12:02 WrapperNode [2023-08-26 15:12:02,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:12:02,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:12:02,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:12:02,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:12:02,902 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:02" (1/1) ... [2023-08-26 15:12:02,918 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:02" (1/1) ... [2023-08-26 15:12:02,943 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 175 [2023-08-26 15:12:02,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:12:02,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:12:02,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:12:02,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:12:02,952 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:02" (1/1) ... [2023-08-26 15:12:02,952 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:02" (1/1) ... [2023-08-26 15:12:02,956 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:02" (1/1) ... [2023-08-26 15:12:02,956 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:02" (1/1) ... [2023-08-26 15:12:02,964 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:02" (1/1) ... [2023-08-26 15:12:02,977 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:02" (1/1) ... [2023-08-26 15:12:02,979 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:02" (1/1) ... [2023-08-26 15:12:02,980 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:02" (1/1) ... [2023-08-26 15:12:02,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:12:02,984 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:12:02,984 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:12:02,984 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:12:02,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:12:02" (1/1) ... [2023-08-26 15:12:03,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:12:03,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:12:03,024 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:03,028 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:03,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:12:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:12:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:12:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:12:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:12:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:12:03,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:12:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:12:03,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:12:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 15:12:03,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 15:12:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 15:12:03,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 15:12:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:12:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:12:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:12:03,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:12:03,060 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:03,180 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:12:03,181 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:12:03,564 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:12:03,677 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:12:03,678 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:12:03,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:12:03 BoogieIcfgContainer [2023-08-26 15:12:03,680 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:12:03,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:12:03,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:12:03,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:12:03,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:12:02" (1/3) ... [2023-08-26 15:12:03,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@872653e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:12:03, skipping insertion in model container [2023-08-26 15:12:03,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:12:02" (2/3) ... [2023-08-26 15:12:03,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@872653e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:12:03, skipping insertion in model container [2023-08-26 15:12:03,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:12:03" (3/3) ... [2023-08-26 15:12:03,697 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.opt.i [2023-08-26 15:12:03,709 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:12:03,709 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 15:12:03,709 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:12:03,756 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:12:03,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 143 transitions, 306 flow [2023-08-26 15:12:03,843 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-08-26 15:12:03,844 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:12:03,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 3/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 114 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 15:12:03,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 143 transitions, 306 flow [2023-08-26 15:12:03,858 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 139 transitions, 290 flow [2023-08-26 15:12:03,862 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:12:03,874 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 139 transitions, 290 flow [2023-08-26 15:12:03,877 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 139 transitions, 290 flow [2023-08-26 15:12:03,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 139 transitions, 290 flow [2023-08-26 15:12:03,905 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-08-26 15:12:03,906 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:12:03,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 3/139 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/126 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 15:12:03,909 INFO L119 LiptonReduction]: Number of co-enabled transitions 3316 [2023-08-26 15:12:08,431 INFO L134 LiptonReduction]: Checked pairs total: 8376 [2023-08-26 15:12:08,432 INFO L136 LiptonReduction]: Total number of compositions: 143 [2023-08-26 15:12:08,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:12:08,457 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;@20bc6e16, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:12:08,457 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 15:12:08,460 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:12:08,460 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 15:12:08,460 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:12:08,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:08,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:12:08,461 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:08,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:08,466 INFO L85 PathProgramCache]: Analyzing trace with hash 612, now seen corresponding path program 1 times [2023-08-26 15:12:08,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:08,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901174423] [2023-08-26 15:12:08,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:08,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:08,578 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:08,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:08,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901174423] [2023-08-26 15:12:08,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901174423] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:08,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:08,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:12:08,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372424055] [2023-08-26 15:12:08,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:08,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:12:08,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:08,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:12:08,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:12:08,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 286 [2023-08-26 15:12:08,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have 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:08,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:08,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 286 [2023-08-26 15:12:08,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:09,352 INFO L124 PetriNetUnfolderBase]: 4373/6104 cut-off events. [2023-08-26 15:12:09,353 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-08-26 15:12:09,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12190 conditions, 6104 events. 4373/6104 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 31660 event pairs, 4373 based on Foata normal form. 216/5587 useless extension candidates. Maximal degree in co-relation 12178. Up to 5983 conditions per place. [2023-08-26 15:12:09,456 INFO L140 encePairwiseOnDemand]: 277/286 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-26 15:12:09,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-08-26 15:12:09,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:12:09,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:12:09,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 293 transitions. [2023-08-26 15:12:09,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5122377622377622 [2023-08-26 15:12:09,477 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 293 transitions. [2023-08-26 15:12:09,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 293 transitions. [2023-08-26 15:12:09,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:09,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 293 transitions. [2023-08-26 15:12:09,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have 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:09,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have 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:09,492 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have 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:09,494 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 293 transitions. [2023-08-26 15:12:09,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-08-26 15:12:09,500 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:09,502 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-26 15:12:09,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, 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:09,506 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-26 15:12:09,506 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-26 15:12:09,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have 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:09,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:09,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:09,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:12:09,508 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:09,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:09,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1482337430, now seen corresponding path program 1 times [2023-08-26 15:12:09,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:09,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475853768] [2023-08-26 15:12:09,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:09,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:09,820 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:09,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:09,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475853768] [2023-08-26 15:12:09,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475853768] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:09,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:09,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:12:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711932282] [2023-08-26 15:12:09,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:09,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:12:09,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:09,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:12:09,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:12:09,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 286 [2023-08-26 15:12:09,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have 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:09,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:09,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 286 [2023-08-26 15:12:09,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:10,384 INFO L124 PetriNetUnfolderBase]: 3632/5255 cut-off events. [2023-08-26 15:12:10,385 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:12:10,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10345 conditions, 5255 events. 3632/5255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 29144 event pairs, 668 based on Foata normal form. 0/4882 useless extension candidates. Maximal degree in co-relation 10342. Up to 3973 conditions per place. [2023-08-26 15:12:10,411 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 32 selfloop transitions, 2 changer transitions 4/42 dead transitions. [2023-08-26 15:12:10,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 168 flow [2023-08-26 15:12:10,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:12:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:12:10,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-08-26 15:12:10,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.493006993006993 [2023-08-26 15:12:10,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-08-26 15:12:10,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-08-26 15:12:10,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:10,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-08-26 15:12:10,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have 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:10,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have 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:10,421 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have 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:10,421 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 423 transitions. [2023-08-26 15:12:10,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 168 flow [2023-08-26 15:12:10,424 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:10,425 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 66 flow [2023-08-26 15:12:10,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, 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:10,426 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-26 15:12:10,428 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 66 flow [2023-08-26 15:12:10,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have 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:10,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:10,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:10,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:12:10,433 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:10,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:10,433 INFO L85 PathProgramCache]: Analyzing trace with hash 541856555, now seen corresponding path program 1 times [2023-08-26 15:12:10,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:10,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138226109] [2023-08-26 15:12:10,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:10,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:10,747 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:10,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:10,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138226109] [2023-08-26 15:12:10,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138226109] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:10,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:10,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:12:10,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811364870] [2023-08-26 15:12:10,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:10,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:12:10,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:10,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:12:10,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:12:10,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 286 [2023-08-26 15:12:10,752 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:10,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:10,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 286 [2023-08-26 15:12:10,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:11,203 INFO L124 PetriNetUnfolderBase]: 2561/3752 cut-off events. [2023-08-26 15:12:11,203 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-08-26 15:12:11,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7593 conditions, 3752 events. 2561/3752 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 19524 event pairs, 809 based on Foata normal form. 180/3919 useless extension candidates. Maximal degree in co-relation 7589. Up to 2026 conditions per place. [2023-08-26 15:12:11,223 INFO L140 encePairwiseOnDemand]: 282/286 looper letters, 30 selfloop transitions, 2 changer transitions 19/55 dead transitions. [2023-08-26 15:12:11,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 226 flow [2023-08-26 15:12:11,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:12:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:12:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 668 transitions. [2023-08-26 15:12:11,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4671328671328671 [2023-08-26 15:12:11,226 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 668 transitions. [2023-08-26 15:12:11,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 668 transitions. [2023-08-26 15:12:11,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:11,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 668 transitions. [2023-08-26 15:12:11,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.6) internal successors, (668), 5 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:11,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have 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:11,231 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have 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:11,231 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 66 flow. Second operand 5 states and 668 transitions. [2023-08-26 15:12:11,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 226 flow [2023-08-26 15:12:11,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:12:11,235 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 74 flow [2023-08-26 15:12:11,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2023-08-26 15:12:11,236 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -7 predicate places. [2023-08-26 15:12:11,236 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 74 flow [2023-08-26 15:12:11,237 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:11,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:11,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:11,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:12:11,241 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:11,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:11,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1137684016, now seen corresponding path program 1 times [2023-08-26 15:12:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:11,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945644858] [2023-08-26 15:12:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:11,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:12,330 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:12,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:12,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945644858] [2023-08-26 15:12:12,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945644858] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:12,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:12,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:12:12,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246260085] [2023-08-26 15:12:12,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:12,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:12:12,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:12,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:12:12,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:12:12,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 286 [2023-08-26 15:12:12,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 74 flow. Second operand has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have 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:12,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:12,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 286 [2023-08-26 15:12:12,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:13,387 INFO L124 PetriNetUnfolderBase]: 7411/10120 cut-off events. [2023-08-26 15:12:13,387 INFO L125 PetriNetUnfolderBase]: For 1428/1428 co-relation queries the response was YES. [2023-08-26 15:12:13,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21914 conditions, 10120 events. 7411/10120 cut-off events. For 1428/1428 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 45966 event pairs, 1095 based on Foata normal form. 348/10468 useless extension candidates. Maximal degree in co-relation 21907. Up to 6809 conditions per place. [2023-08-26 15:12:13,455 INFO L140 encePairwiseOnDemand]: 274/286 looper letters, 55 selfloop transitions, 13 changer transitions 34/102 dead transitions. [2023-08-26 15:12:13,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 102 transitions, 442 flow [2023-08-26 15:12:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:12:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:12:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 977 transitions. [2023-08-26 15:12:13,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42701048951048953 [2023-08-26 15:12:13,459 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 977 transitions. [2023-08-26 15:12:13,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 977 transitions. [2023-08-26 15:12:13,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:13,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 977 transitions. [2023-08-26 15:12:13,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 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:13,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 286.0) internal successors, (2574), 9 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have 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:13,467 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 286.0) internal successors, (2574), 9 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have 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:13,467 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 74 flow. Second operand 8 states and 977 transitions. [2023-08-26 15:12:13,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 102 transitions, 442 flow [2023-08-26 15:12:13,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 102 transitions, 430 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 15:12:13,533 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 166 flow [2023-08-26 15:12:13,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=166, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-26 15:12:13,534 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2023-08-26 15:12:13,534 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 166 flow [2023-08-26 15:12:13,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have 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:13,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:13,535 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:13,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:12:13,535 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:13,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:13,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1716025533, now seen corresponding path program 1 times [2023-08-26 15:12:13,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:13,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930007063] [2023-08-26 15:12:13,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:13,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:14,033 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:14,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:14,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930007063] [2023-08-26 15:12:14,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930007063] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:14,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:14,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:12:14,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148253132] [2023-08-26 15:12:14,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:14,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:12:14,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:14,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:12:14,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:12:14,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 286 [2023-08-26 15:12:14,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:14,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:14,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 286 [2023-08-26 15:12:14,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:15,067 INFO L124 PetriNetUnfolderBase]: 6743/9532 cut-off events. [2023-08-26 15:12:15,067 INFO L125 PetriNetUnfolderBase]: For 7630/7660 co-relation queries the response was YES. [2023-08-26 15:12:15,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27599 conditions, 9532 events. 6743/9532 cut-off events. For 7630/7660 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 48998 event pairs, 4132 based on Foata normal form. 192/9439 useless extension candidates. Maximal degree in co-relation 27589. Up to 6287 conditions per place. [2023-08-26 15:12:15,128 INFO L140 encePairwiseOnDemand]: 278/286 looper letters, 42 selfloop transitions, 15 changer transitions 15/78 dead transitions. [2023-08-26 15:12:15,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 78 transitions, 444 flow [2023-08-26 15:12:15,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:12:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:12:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 912 transitions. [2023-08-26 15:12:15,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45554445554445555 [2023-08-26 15:12:15,131 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 912 transitions. [2023-08-26 15:12:15,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 912 transitions. [2023-08-26 15:12:15,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:15,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 912 transitions. [2023-08-26 15:12:15,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.28571428571428) internal successors, (912), 7 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have 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:15,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have 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:15,138 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have 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:15,138 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 166 flow. Second operand 7 states and 912 transitions. [2023-08-26 15:12:15,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 78 transitions, 444 flow [2023-08-26 15:12:15,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 78 transitions, 436 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 15:12:15,174 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 260 flow [2023-08-26 15:12:15,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=260, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-08-26 15:12:15,174 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-08-26 15:12:15,175 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 260 flow [2023-08-26 15:12:15,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:12:15,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:15,175 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:15,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:12:15,176 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:15,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:15,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1443010933, now seen corresponding path program 2 times [2023-08-26 15:12:15,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:15,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446859526] [2023-08-26 15:12:15,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:15,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:15,674 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:15,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:15,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446859526] [2023-08-26 15:12:15,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446859526] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:15,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:15,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:12:15,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151035940] [2023-08-26 15:12:15,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:15,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:12:15,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:15,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:12:15,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:12:15,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 286 [2023-08-26 15:12:15,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 260 flow. Second operand has 7 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have 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:15,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:15,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 286 [2023-08-26 15:12:15,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:16,492 INFO L124 PetriNetUnfolderBase]: 6949/9853 cut-off events. [2023-08-26 15:12:16,492 INFO L125 PetriNetUnfolderBase]: For 15395/15433 co-relation queries the response was YES. [2023-08-26 15:12:16,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33337 conditions, 9853 events. 6949/9853 cut-off events. For 15395/15433 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 51013 event pairs, 1798 based on Foata normal form. 199/9833 useless extension candidates. Maximal degree in co-relation 33324. Up to 6560 conditions per place. [2023-08-26 15:12:16,572 INFO L140 encePairwiseOnDemand]: 278/286 looper letters, 57 selfloop transitions, 15 changer transitions 9/87 dead transitions. [2023-08-26 15:12:16,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 87 transitions, 593 flow [2023-08-26 15:12:16,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:12:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:12:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions. [2023-08-26 15:12:16,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2023-08-26 15:12:16,575 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 770 transitions. [2023-08-26 15:12:16,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 770 transitions. [2023-08-26 15:12:16,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:16,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 770 transitions. [2023-08-26 15:12:16,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have 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:16,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have 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:16,581 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have 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:16,581 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 260 flow. Second operand 6 states and 770 transitions. [2023-08-26 15:12:16,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 87 transitions, 593 flow [2023-08-26 15:12:16,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 87 transitions, 582 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-26 15:12:16,641 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 379 flow [2023-08-26 15:12:16,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=379, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2023-08-26 15:12:16,641 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-26 15:12:16,642 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 379 flow [2023-08-26 15:12:16,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have 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:16,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:16,642 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:16,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:12:16,642 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:16,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:16,643 INFO L85 PathProgramCache]: Analyzing trace with hash 861543947, now seen corresponding path program 3 times [2023-08-26 15:12:16,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:16,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826819401] [2023-08-26 15:12:16,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:16,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:17,223 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:17,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:17,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826819401] [2023-08-26 15:12:17,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826819401] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:17,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:17,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:12:17,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423274375] [2023-08-26 15:12:17,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:17,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:12:17,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:17,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:12:17,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:12:17,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 286 [2023-08-26 15:12:17,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 379 flow. Second operand has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have 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:17,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:17,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 286 [2023-08-26 15:12:17,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:18,488 INFO L124 PetriNetUnfolderBase]: 9295/12716 cut-off events. [2023-08-26 15:12:18,489 INFO L125 PetriNetUnfolderBase]: For 22392/22392 co-relation queries the response was YES. [2023-08-26 15:12:18,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46811 conditions, 12716 events. 9295/12716 cut-off events. For 22392/22392 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 61243 event pairs, 667 based on Foata normal form. 252/12968 useless extension candidates. Maximal degree in co-relation 46797. Up to 7388 conditions per place. [2023-08-26 15:12:18,637 INFO L140 encePairwiseOnDemand]: 274/286 looper letters, 90 selfloop transitions, 38 changer transitions 23/151 dead transitions. [2023-08-26 15:12:18,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 151 transitions, 1119 flow [2023-08-26 15:12:18,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 15:12:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 15:12:18,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1215 transitions. [2023-08-26 15:12:18,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42482517482517484 [2023-08-26 15:12:18,641 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1215 transitions. [2023-08-26 15:12:18,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1215 transitions. [2023-08-26 15:12:18,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:18,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1215 transitions. [2023-08-26 15:12:18,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.5) internal successors, (1215), 10 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have 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:18,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 286.0) internal successors, (3146), 11 states have internal predecessors, (3146), 0 states have call successors, (0), 0 states have 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:18,649 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 286.0) internal successors, (3146), 11 states have internal predecessors, (3146), 0 states have call successors, (0), 0 states have 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:18,649 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 379 flow. Second operand 10 states and 1215 transitions. [2023-08-26 15:12:18,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 151 transitions, 1119 flow [2023-08-26 15:12:18,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 151 transitions, 1111 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-26 15:12:18,730 INFO L231 Difference]: Finished difference. Result has 69 places, 72 transitions, 647 flow [2023-08-26 15:12:18,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=647, PETRI_PLACES=69, PETRI_TRANSITIONS=72} [2023-08-26 15:12:18,731 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-08-26 15:12:18,732 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 72 transitions, 647 flow [2023-08-26 15:12:18,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have 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:18,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:18,732 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:18,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:12:18,732 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:18,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:18,733 INFO L85 PathProgramCache]: Analyzing trace with hash 795782717, now seen corresponding path program 4 times [2023-08-26 15:12:18,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:18,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266207854] [2023-08-26 15:12:18,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:18,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:19,157 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:19,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:19,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266207854] [2023-08-26 15:12:19,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266207854] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:19,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:19,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:12:19,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944256283] [2023-08-26 15:12:19,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:19,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:12:19,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:19,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:12:19,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:12:19,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 286 [2023-08-26 15:12:19,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 72 transitions, 647 flow. Second operand has 7 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have 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:19,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:19,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 286 [2023-08-26 15:12:19,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:20,430 INFO L124 PetriNetUnfolderBase]: 8331/11884 cut-off events. [2023-08-26 15:12:20,430 INFO L125 PetriNetUnfolderBase]: For 40678/40887 co-relation queries the response was YES. [2023-08-26 15:12:20,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51801 conditions, 11884 events. 8331/11884 cut-off events. For 40678/40887 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 64126 event pairs, 733 based on Foata normal form. 280/12056 useless extension candidates. Maximal degree in co-relation 51783. Up to 5298 conditions per place. [2023-08-26 15:12:20,517 INFO L140 encePairwiseOnDemand]: 279/286 looper letters, 59 selfloop transitions, 31 changer transitions 17/118 dead transitions. [2023-08-26 15:12:20,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 118 transitions, 1070 flow [2023-08-26 15:12:20,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:12:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:12:20,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1018 transitions. [2023-08-26 15:12:20,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44493006993006995 [2023-08-26 15:12:20,520 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1018 transitions. [2023-08-26 15:12:20,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1018 transitions. [2023-08-26 15:12:20,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:20,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1018 transitions. [2023-08-26 15:12:20,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.25) internal successors, (1018), 8 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have 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:20,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 286.0) internal successors, (2574), 9 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have 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:20,527 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 286.0) internal successors, (2574), 9 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have 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:20,527 INFO L175 Difference]: Start difference. First operand has 69 places, 72 transitions, 647 flow. Second operand 8 states and 1018 transitions. [2023-08-26 15:12:20,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 118 transitions, 1070 flow [2023-08-26 15:12:20,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 118 transitions, 1040 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-26 15:12:20,807 INFO L231 Difference]: Finished difference. Result has 74 places, 74 transitions, 747 flow [2023-08-26 15:12:20,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=747, PETRI_PLACES=74, PETRI_TRANSITIONS=74} [2023-08-26 15:12:20,810 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2023-08-26 15:12:20,810 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 74 transitions, 747 flow [2023-08-26 15:12:20,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have 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:20,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:20,811 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:20,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:12:20,811 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:20,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:20,811 INFO L85 PathProgramCache]: Analyzing trace with hash -173235899, now seen corresponding path program 1 times [2023-08-26 15:12:20,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:20,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114697613] [2023-08-26 15:12:20,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:20,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:20,936 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:20,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:20,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114697613] [2023-08-26 15:12:20,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114697613] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:20,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:20,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:12:20,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752449176] [2023-08-26 15:12:20,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:20,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:12:20,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:20,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:12:20,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:12:20,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 286 [2023-08-26 15:12:20,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 74 transitions, 747 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have 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:20,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:20,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 286 [2023-08-26 15:12:20,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:21,617 INFO L124 PetriNetUnfolderBase]: 4517/6666 cut-off events. [2023-08-26 15:12:21,618 INFO L125 PetriNetUnfolderBase]: For 34096/34904 co-relation queries the response was YES. [2023-08-26 15:12:21,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30776 conditions, 6666 events. 4517/6666 cut-off events. For 34096/34904 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 36584 event pairs, 898 based on Foata normal form. 408/6855 useless extension candidates. Maximal degree in co-relation 30757. Up to 5295 conditions per place. [2023-08-26 15:12:21,666 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 86 selfloop transitions, 5 changer transitions 0/107 dead transitions. [2023-08-26 15:12:21,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 107 transitions, 1217 flow [2023-08-26 15:12:21,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:12:21,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:12:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-26 15:12:21,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47785547785547783 [2023-08-26 15:12:21,668 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-26 15:12:21,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-26 15:12:21,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:21,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-26 15:12:21,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have 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:21,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have 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:21,672 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have 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:21,672 INFO L175 Difference]: Start difference. First operand has 74 places, 74 transitions, 747 flow. Second operand 3 states and 410 transitions. [2023-08-26 15:12:21,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 107 transitions, 1217 flow [2023-08-26 15:12:21,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 107 transitions, 1184 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-08-26 15:12:21,731 INFO L231 Difference]: Finished difference. Result has 70 places, 78 transitions, 756 flow [2023-08-26 15:12:21,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=70, PETRI_TRANSITIONS=78} [2023-08-26 15:12:21,732 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2023-08-26 15:12:21,732 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 78 transitions, 756 flow [2023-08-26 15:12:21,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have 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:21,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:21,733 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:21,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:12:21,733 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:21,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:21,733 INFO L85 PathProgramCache]: Analyzing trace with hash 135537421, now seen corresponding path program 1 times [2023-08-26 15:12:21,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:21,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997637360] [2023-08-26 15:12:21,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:21,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:21,892 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:21,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:21,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997637360] [2023-08-26 15:12:21,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997637360] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:21,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:21,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:12:21,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917014195] [2023-08-26 15:12:21,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:21,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:12:21,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:21,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:12:21,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:12:21,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 286 [2023-08-26 15:12:21,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 78 transitions, 756 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:21,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:21,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 286 [2023-08-26 15:12:21,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:22,252 INFO L124 PetriNetUnfolderBase]: 2201/3466 cut-off events. [2023-08-26 15:12:22,252 INFO L125 PetriNetUnfolderBase]: For 15304/15735 co-relation queries the response was YES. [2023-08-26 15:12:22,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16480 conditions, 3466 events. 2201/3466 cut-off events. For 15304/15735 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 18362 event pairs, 355 based on Foata normal form. 354/3712 useless extension candidates. Maximal degree in co-relation 16463. Up to 1620 conditions per place. [2023-08-26 15:12:22,272 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 112 selfloop transitions, 9 changer transitions 0/137 dead transitions. [2023-08-26 15:12:22,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 137 transitions, 1536 flow [2023-08-26 15:12:22,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:12:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:12:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-26 15:12:22,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.479020979020979 [2023-08-26 15:12:22,274 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-26 15:12:22,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-26 15:12:22,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:22,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-26 15:12:22,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have 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:22,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have 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:22,278 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have 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:22,278 INFO L175 Difference]: Start difference. First operand has 70 places, 78 transitions, 756 flow. Second operand 4 states and 548 transitions. [2023-08-26 15:12:22,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 137 transitions, 1536 flow [2023-08-26 15:12:22,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 137 transitions, 1531 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:12:22,296 INFO L231 Difference]: Finished difference. Result has 73 places, 81 transitions, 789 flow [2023-08-26 15:12:22,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=789, PETRI_PLACES=73, PETRI_TRANSITIONS=81} [2023-08-26 15:12:22,296 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2023-08-26 15:12:22,297 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 81 transitions, 789 flow [2023-08-26 15:12:22,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:22,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:22,297 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:12:22,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:12:22,297 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:22,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:22,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1537079611, now seen corresponding path program 1 times [2023-08-26 15:12:22,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:22,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281152449] [2023-08-26 15:12:22,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:22,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:22,452 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:22,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:22,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281152449] [2023-08-26 15:12:22,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281152449] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:22,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:22,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:12:22,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466239228] [2023-08-26 15:12:22,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:22,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:12:22,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:22,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:12:22,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:12:22,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 286 [2023-08-26 15:12:22,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 81 transitions, 789 flow. Second operand has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have 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:22,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:22,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 286 [2023-08-26 15:12:22,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:22,959 INFO L124 PetriNetUnfolderBase]: 3150/4998 cut-off events. [2023-08-26 15:12:22,959 INFO L125 PetriNetUnfolderBase]: For 25249/25627 co-relation queries the response was YES. [2023-08-26 15:12:22,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25794 conditions, 4998 events. 3150/4998 cut-off events. For 25249/25627 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 28734 event pairs, 505 based on Foata normal form. 209/5120 useless extension candidates. Maximal degree in co-relation 25776. Up to 2571 conditions per place. [2023-08-26 15:12:22,986 INFO L140 encePairwiseOnDemand]: 282/286 looper letters, 113 selfloop transitions, 2 changer transitions 46/174 dead transitions. [2023-08-26 15:12:22,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 174 transitions, 1982 flow [2023-08-26 15:12:22,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:12:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:12:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 670 transitions. [2023-08-26 15:12:22,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46853146853146854 [2023-08-26 15:12:22,989 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 670 transitions. [2023-08-26 15:12:22,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 670 transitions. [2023-08-26 15:12:22,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:22,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 670 transitions. [2023-08-26 15:12:22,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have 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:22,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have 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:22,994 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have 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:22,994 INFO L175 Difference]: Start difference. First operand has 73 places, 81 transitions, 789 flow. Second operand 5 states and 670 transitions. [2023-08-26 15:12:22,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 174 transitions, 1982 flow [2023-08-26 15:12:23,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 174 transitions, 1936 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-26 15:12:23,022 INFO L231 Difference]: Finished difference. Result has 78 places, 78 transitions, 758 flow [2023-08-26 15:12:23,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=758, PETRI_PLACES=78, PETRI_TRANSITIONS=78} [2023-08-26 15:12:23,023 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2023-08-26 15:12:23,023 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 78 transitions, 758 flow [2023-08-26 15:12:23,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have 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:23,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:23,024 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:12:23,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 15:12:23,024 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:23,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:23,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1510589695, now seen corresponding path program 2 times [2023-08-26 15:12:23,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:23,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470728474] [2023-08-26 15:12:23,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:23,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:23,161 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:23,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:23,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470728474] [2023-08-26 15:12:23,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470728474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:23,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:23,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:12:23,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151878622] [2023-08-26 15:12:23,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:23,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:12:23,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:23,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:12:23,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:12:23,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 286 [2023-08-26 15:12:23,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 78 transitions, 758 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have 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:23,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:23,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 286 [2023-08-26 15:12:23,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:23,460 INFO L124 PetriNetUnfolderBase]: 1865/2978 cut-off events. [2023-08-26 15:12:23,460 INFO L125 PetriNetUnfolderBase]: For 15372/15806 co-relation queries the response was YES. [2023-08-26 15:12:23,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14651 conditions, 2978 events. 1865/2978 cut-off events. For 15372/15806 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 16410 event pairs, 268 based on Foata normal form. 277/3132 useless extension candidates. Maximal degree in co-relation 14630. Up to 1098 conditions per place. [2023-08-26 15:12:23,478 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 103 selfloop transitions, 13 changer transitions 7/139 dead transitions. [2023-08-26 15:12:23,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 139 transitions, 1526 flow [2023-08-26 15:12:23,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:12:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:12:23,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 684 transitions. [2023-08-26 15:12:23,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783216783216783 [2023-08-26 15:12:23,480 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 684 transitions. [2023-08-26 15:12:23,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 684 transitions. [2023-08-26 15:12:23,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:23,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 684 transitions. [2023-08-26 15:12:23,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have 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:23,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have 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:23,485 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have 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:23,485 INFO L175 Difference]: Start difference. First operand has 78 places, 78 transitions, 758 flow. Second operand 5 states and 684 transitions. [2023-08-26 15:12:23,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 139 transitions, 1526 flow [2023-08-26 15:12:23,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 139 transitions, 1454 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-26 15:12:23,502 INFO L231 Difference]: Finished difference. Result has 76 places, 70 transitions, 628 flow [2023-08-26 15:12:23,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=628, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2023-08-26 15:12:23,502 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2023-08-26 15:12:23,502 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 628 flow [2023-08-26 15:12:23,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have 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:23,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:23,503 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] [2023-08-26 15:12:23,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 15:12:23,503 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:12:23,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:23,504 INFO L85 PathProgramCache]: Analyzing trace with hash -440944434, now seen corresponding path program 1 times [2023-08-26 15:12:23,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:23,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833765328] [2023-08-26 15:12:23,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:23,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:23,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:23,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:23,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833765328] [2023-08-26 15:12:23,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833765328] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:23,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:23,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:12:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729298388] [2023-08-26 15:12:23,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:23,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:12:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:23,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:12:23,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:12:23,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 286 [2023-08-26 15:12:23,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 628 flow. Second operand has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have 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:23,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:23,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 286 [2023-08-26 15:12:23,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:24,155 INFO L124 PetriNetUnfolderBase]: 2971/4792 cut-off events. [2023-08-26 15:12:24,156 INFO L125 PetriNetUnfolderBase]: For 25808/25929 co-relation queries the response was YES. [2023-08-26 15:12:24,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25578 conditions, 4792 events. 2971/4792 cut-off events. For 25808/25929 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 28690 event pairs, 413 based on Foata normal form. 97/4780 useless extension candidates. Maximal degree in co-relation 25558. Up to 2120 conditions per place. [2023-08-26 15:12:24,181 INFO L140 encePairwiseOnDemand]: 282/286 looper letters, 97 selfloop transitions, 2 changer transitions 58/169 dead transitions. [2023-08-26 15:12:24,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 169 transitions, 1853 flow [2023-08-26 15:12:24,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:12:24,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:12:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2023-08-26 15:12:24,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4699300699300699 [2023-08-26 15:12:24,183 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2023-08-26 15:12:24,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2023-08-26 15:12:24,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:24,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2023-08-26 15:12:24,185 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:12:24,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have 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:24,187 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have 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:24,187 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 628 flow. Second operand 5 states and 672 transitions. [2023-08-26 15:12:24,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 169 transitions, 1853 flow [2023-08-26 15:12:24,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 169 transitions, 1763 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-08-26 15:12:24,244 INFO L231 Difference]: Finished difference. Result has 80 places, 71 transitions, 625 flow [2023-08-26 15:12:24,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=625, PETRI_PLACES=80, PETRI_TRANSITIONS=71} [2023-08-26 15:12:24,244 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 29 predicate places. [2023-08-26 15:12:24,245 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 71 transitions, 625 flow [2023-08-26 15:12:24,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have 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:24,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:24,245 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] [2023-08-26 15:12:24,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 15:12:24,245 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:12:24,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:24,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1271066572, now seen corresponding path program 2 times [2023-08-26 15:12:24,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:24,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333026517] [2023-08-26 15:12:24,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:24,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:12:24,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:24,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333026517] [2023-08-26 15:12:24,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333026517] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:24,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:24,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:12:24,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908622265] [2023-08-26 15:12:24,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:24,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:12:24,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:24,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:12:24,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:12:24,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 286 [2023-08-26 15:12:24,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 625 flow. Second operand has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have 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:24,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:24,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 286 [2023-08-26 15:12:24,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:24,854 INFO L124 PetriNetUnfolderBase]: 2373/3746 cut-off events. [2023-08-26 15:12:24,854 INFO L125 PetriNetUnfolderBase]: For 18670/19225 co-relation queries the response was YES. [2023-08-26 15:12:24,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19013 conditions, 3746 events. 2373/3746 cut-off events. For 18670/19225 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 22103 event pairs, 314 based on Foata normal form. 248/3809 useless extension candidates. Maximal degree in co-relation 18990. Up to 1415 conditions per place. [2023-08-26 15:12:24,871 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 68 selfloop transitions, 17 changer transitions 43/138 dead transitions. [2023-08-26 15:12:24,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 138 transitions, 1480 flow [2023-08-26 15:12:24,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:12:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:12:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 807 transitions. [2023-08-26 15:12:24,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47027972027972026 [2023-08-26 15:12:24,873 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 807 transitions. [2023-08-26 15:12:24,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 807 transitions. [2023-08-26 15:12:24,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:24,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 807 transitions. [2023-08-26 15:12:24,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.5) internal successors, (807), 6 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have 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:24,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have 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:24,878 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have 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:24,878 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 625 flow. Second operand 6 states and 807 transitions. [2023-08-26 15:12:24,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 138 transitions, 1480 flow [2023-08-26 15:12:24,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 138 transitions, 1378 flow, removed 28 selfloop flow, removed 4 redundant places. [2023-08-26 15:12:24,952 INFO L231 Difference]: Finished difference. Result has 81 places, 58 transitions, 488 flow [2023-08-26 15:12:24,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=81, PETRI_TRANSITIONS=58} [2023-08-26 15:12:24,953 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2023-08-26 15:12:24,953 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 58 transitions, 488 flow [2023-08-26 15:12:24,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have 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:24,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:24,953 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:12:24,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 15:12:24,954 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:12:24,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:24,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1562289297, now seen corresponding path program 1 times [2023-08-26 15:12:24,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:24,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324386598] [2023-08-26 15:12:24,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:24,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:25,290 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:25,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:25,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324386598] [2023-08-26 15:12:25,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324386598] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:25,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:25,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:12:25,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130657140] [2023-08-26 15:12:25,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:25,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:12:25,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:25,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:12:25,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:12:25,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 286 [2023-08-26 15:12:25,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 58 transitions, 488 flow. Second operand has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have 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:25,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:25,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 286 [2023-08-26 15:12:25,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:25,605 INFO L124 PetriNetUnfolderBase]: 1328/2152 cut-off events. [2023-08-26 15:12:25,605 INFO L125 PetriNetUnfolderBase]: For 10897/10897 co-relation queries the response was YES. [2023-08-26 15:12:25,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11242 conditions, 2152 events. 1328/2152 cut-off events. For 10897/10897 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10611 event pairs, 280 based on Foata normal form. 1/2153 useless extension candidates. Maximal degree in co-relation 11221. Up to 1161 conditions per place. [2023-08-26 15:12:25,613 INFO L140 encePairwiseOnDemand]: 278/286 looper letters, 51 selfloop transitions, 3 changer transitions 69/123 dead transitions. [2023-08-26 15:12:25,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 123 transitions, 1245 flow [2023-08-26 15:12:25,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:12:25,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:12:25,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 817 transitions. [2023-08-26 15:12:25,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4080919080919081 [2023-08-26 15:12:25,616 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 817 transitions. [2023-08-26 15:12:25,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 817 transitions. [2023-08-26 15:12:25,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:25,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 817 transitions. [2023-08-26 15:12:25,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have 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:25,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have 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:25,621 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have 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:25,621 INFO L175 Difference]: Start difference. First operand has 81 places, 58 transitions, 488 flow. Second operand 7 states and 817 transitions. [2023-08-26 15:12:25,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 123 transitions, 1245 flow [2023-08-26 15:12:25,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 123 transitions, 1059 flow, removed 58 selfloop flow, removed 9 redundant places. [2023-08-26 15:12:25,649 INFO L231 Difference]: Finished difference. Result has 78 places, 44 transitions, 284 flow [2023-08-26 15:12:25,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=284, PETRI_PLACES=78, PETRI_TRANSITIONS=44} [2023-08-26 15:12:25,650 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2023-08-26 15:12:25,650 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 44 transitions, 284 flow [2023-08-26 15:12:25,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have 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:25,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:25,651 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:12:25,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 15:12:25,651 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:12:25,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:25,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1339722787, now seen corresponding path program 2 times [2023-08-26 15:12:25,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:25,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218238552] [2023-08-26 15:12:25,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:25,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:12:25,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:12:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:12:25,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:12:25,743 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:12:25,744 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 15:12:25,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 15:12:25,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 15:12:25,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 15:12:25,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 15:12:25,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 15:12:25,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 15:12:25,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 15:12:25,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 15:12:25,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 15:12:25,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 15:12:25,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 15:12:25,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 15:12:25,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 15:12:25,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 15:12:25,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 15:12:25,750 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:25,756 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:12:25,756 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:12:25,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:12:25 BasicIcfg [2023-08-26 15:12:25,835 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:12:25,835 INFO L158 Benchmark]: Toolchain (without parser) took 23523.36ms. Allocated memory was 364.9MB in the beginning and 1.2GB in the end (delta: 792.7MB). Free memory was 339.9MB in the beginning and 399.9MB in the end (delta: -60.0MB). Peak memory consumption was 733.2MB. Max. memory is 16.0GB. [2023-08-26 15:12:25,835 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 364.9MB. Free memory is still 341.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:12:25,836 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.73ms. Allocated memory is still 364.9MB. Free memory was 339.3MB in the beginning and 316.1MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 15:12:25,836 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.49ms. Allocated memory is still 364.9MB. Free memory was 316.1MB in the beginning and 313.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:12:25,836 INFO L158 Benchmark]: Boogie Preprocessor took 39.01ms. Allocated memory is still 364.9MB. Free memory was 313.2MB in the beginning and 311.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:12:25,836 INFO L158 Benchmark]: RCFGBuilder took 695.86ms. Allocated memory is still 364.9MB. Free memory was 311.1MB in the beginning and 325.7MB in the end (delta: -14.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 15:12:25,837 INFO L158 Benchmark]: TraceAbstraction took 22147.88ms. Allocated memory was 364.9MB in the beginning and 1.2GB in the end (delta: 792.7MB). Free memory was 325.7MB in the beginning and 399.9MB in the end (delta: -74.2MB). Peak memory consumption was 718.5MB. Max. memory is 16.0GB. [2023-08-26 15:12:25,838 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 364.9MB. Free memory is still 341.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 581.73ms. Allocated memory is still 364.9MB. Free memory was 339.3MB in the beginning and 316.1MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 48.49ms. Allocated memory is still 364.9MB. Free memory was 316.1MB in the beginning and 313.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.01ms. Allocated memory is still 364.9MB. Free memory was 313.2MB in the beginning and 311.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 695.86ms. Allocated memory is still 364.9MB. Free memory was 311.1MB in the beginning and 325.7MB in the end (delta: -14.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 22147.88ms. Allocated memory was 364.9MB in the beginning and 1.2GB in the end (delta: 792.7MB). Free memory was 325.7MB in the beginning and 399.9MB in the end (delta: -74.2MB). Peak memory consumption was 718.5MB. 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: 4.6s, 149 PlacesBefore, 51 PlacesAfterwards, 139 TransitionsBefore, 39 TransitionsAfterwards, 3316 CoEnabledTransitionPairs, 6 FixpointIterations, 56 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 143 TotalNumberOfCompositions, 8376 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3264, independent: 3073, independent conditional: 0, independent unconditional: 3073, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1782, independent: 1737, independent conditional: 0, independent unconditional: 1737, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3264, independent: 1336, independent conditional: 0, independent unconditional: 1336, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 1782, unknown conditional: 0, unknown unconditional: 1782] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 133, Positive conditional cache size: 0, Positive unconditional cache size: 133, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1133; [L849] FCALL, FORK 0 pthread_create(&t1133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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(&t1133, ((void *)0), P0, ((void *)0))=-3, t1133={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] [L850] 0 pthread_t t1134; [L851] FCALL, FORK 0 pthread_create(&t1134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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(&t1134, ((void *)0), P1, ((void *)0))=-2, t1133={5:0}, t1134={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] [L852] 0 pthread_t t1135; [L853] FCALL, FORK 0 pthread_create(&t1135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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(&t1135, ((void *)0), P2, ((void *)0))=-1, t1133={5:0}, t1134={6:0}, t1135={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] [L854] 0 pthread_t t1136; [L855] FCALL, FORK 0 pthread_create(&t1136, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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(&t1136, ((void *)0), P3, ((void *)0))=0, t1133={5:0}, t1134={6:0}, t1135={7:0}, t1136={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] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 2 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L808] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L808] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L817] 4 a = 1 [L820] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L823] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L784] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=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] [L787] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=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=1] [L790] 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) [L791] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L792] 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 [L793] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L794] 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_p1_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=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=1] [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L826] 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) [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] 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 [L829] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L830] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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=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=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] 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 [L864] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L865] 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_p1_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, t1133={5:0}, t1134={6:0}, t1135={7:0}, t1136={3: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=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 z$flush_delayed = weak$$choice2 [L871] 0 z$mem_tmp = z [L872] 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) [L873] 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)) [L874] 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)) [L875] 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)) [L876] 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)) [L877] 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)) [L878] 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)) [L879] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] 0 z = z$flush_delayed ? z$mem_tmp : z [L881] 0 z$flush_delayed = (_Bool)0 [L883] 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", "mix043.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_p1_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=1, 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: 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: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: 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, 178 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: 22.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 632 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 632 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1791 IncrementalHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 29 mSDtfsCounter, 1791 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=789occurred in iteration=10, InterpolantAutomatonStates: 84, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 1800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:12:25,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...