/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 20:23:07,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 20:23:07,754 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 20:23:07,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 20:23:07,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 20:23:07,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 20:23:07,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 20:23:07,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 20:23:07,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 20:23:07,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 20:23:07,796 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 20:23:07,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 20:23:07,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 20:23:07,797 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 20:23:07,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 20:23:07,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 20:23:07,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 20:23:07,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 20:23:07,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 20:23:07,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 20:23:07,799 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 20:23:07,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 20:23:07,803 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 20:23:07,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 20:23:07,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 20:23:07,806 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 20:23:07,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 20:23:07,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 20:23:07,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 20:23:07,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 20:23:07,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 20:23:07,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 20:23:07,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 20:23:07,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 20:23:07,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 20:23:07,808 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 20:23:08,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 20:23:08,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 20:23:08,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 20:23:08,130 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 20:23:08,130 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 20:23:08,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i [2023-08-26 20:23:09,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 20:23:09,629 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 20:23:09,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i [2023-08-26 20:23:09,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73f36d837/5d94cf13490746bb934b200639ddc409/FLAGef471d56d [2023-08-26 20:23:09,659 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73f36d837/5d94cf13490746bb934b200639ddc409 [2023-08-26 20:23:09,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 20:23:09,662 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 20:23:09,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 20:23:09,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 20:23:09,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 20:23:09,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:23:09" (1/1) ... [2023-08-26 20:23:09,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f730922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:23:09, skipping insertion in model container [2023-08-26 20:23:09,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:23:09" (1/1) ... [2023-08-26 20:23:09,707 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 20:23:10,009 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 20:23:10,023 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 20:23:10,046 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [208] [2023-08-26 20:23:10,048 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [209] [2023-08-26 20:23:10,075 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 20:23:10,121 INFO L206 MainTranslator]: Completed translation [2023-08-26 20:23:10,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:23:10 WrapperNode [2023-08-26 20:23:10,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 20:23:10,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 20:23:10,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 20:23:10,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 20:23:10,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:23:10" (1/1) ... [2023-08-26 20:23:10,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:23:10" (1/1) ... [2023-08-26 20:23:10,170 INFO L138 Inliner]: procedures = 168, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 141 [2023-08-26 20:23:10,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 20:23:10,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 20:23:10,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 20:23:10,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 20:23:10,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:23:10" (1/1) ... [2023-08-26 20:23:10,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:23:10" (1/1) ... [2023-08-26 20:23:10,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:23:10" (1/1) ... [2023-08-26 20:23:10,183 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:23:10" (1/1) ... [2023-08-26 20:23:10,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:23:10" (1/1) ... [2023-08-26 20:23:10,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:23:10" (1/1) ... [2023-08-26 20:23:10,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:23:10" (1/1) ... [2023-08-26 20:23:10,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:23:10" (1/1) ... [2023-08-26 20:23:10,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 20:23:10,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 20:23:10,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 20:23:10,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 20:23:10,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:23:10" (1/1) ... [2023-08-26 20:23:10,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 20:23:10,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:23:10,262 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 20:23:10,290 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 20:23:10,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 20:23:10,303 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-26 20:23:10,303 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-26 20:23:10,304 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-26 20:23:10,304 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-26 20:23:10,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 20:23:10,304 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 20:23:10,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 20:23:10,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 20:23:10,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 20:23:10,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-08-26 20:23:10,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 20:23:10,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 20:23:10,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 20:23:10,307 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 20:23:10,475 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 20:23:10,477 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 20:23:10,742 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 20:23:10,749 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 20:23:10,749 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-26 20:23:10,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:23:10 BoogieIcfgContainer [2023-08-26 20:23:10,752 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 20:23:10,754 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 20:23:10,754 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 20:23:10,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 20:23:10,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 08:23:09" (1/3) ... [2023-08-26 20:23:10,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acab524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:23:10, skipping insertion in model container [2023-08-26 20:23:10,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:23:10" (2/3) ... [2023-08-26 20:23:10,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acab524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:23:10, skipping insertion in model container [2023-08-26 20:23:10,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:23:10" (3/3) ... [2023-08-26 20:23:10,764 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2023-08-26 20:23:10,779 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 20:23:10,779 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-08-26 20:23:10,779 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 20:23:10,862 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 20:23:10,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 160 transitions, 336 flow [2023-08-26 20:23:10,947 INFO L124 PetriNetUnfolderBase]: 12/158 cut-off events. [2023-08-26 20:23:10,947 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 20:23:10,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 158 events. 12/158 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 335 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-26 20:23:10,955 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 160 transitions, 336 flow [2023-08-26 20:23:10,960 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 149 transitions, 307 flow [2023-08-26 20:23:10,963 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 20:23:10,971 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 149 transitions, 307 flow [2023-08-26 20:23:10,973 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 149 transitions, 307 flow [2023-08-26 20:23:10,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 149 transitions, 307 flow [2023-08-26 20:23:11,007 INFO L124 PetriNetUnfolderBase]: 12/149 cut-off events. [2023-08-26 20:23:11,007 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 20:23:11,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 149 events. 12/149 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 316 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-26 20:23:11,012 INFO L119 LiptonReduction]: Number of co-enabled transitions 5668 [2023-08-26 20:23:17,034 INFO L134 LiptonReduction]: Checked pairs total: 14419 [2023-08-26 20:23:17,034 INFO L136 LiptonReduction]: Total number of compositions: 155 [2023-08-26 20:23:17,046 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 20:23:17,052 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2b9c4bd4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 20:23:17,052 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-08-26 20:23:17,053 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 20:23:17,053 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 20:23:17,053 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 20:23:17,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:17,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 20:23:17,054 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 20:23:17,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:17,058 INFO L85 PathProgramCache]: Analyzing trace with hash 647, now seen corresponding path program 1 times [2023-08-26 20:23:17,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:17,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586981703] [2023-08-26 20:23:17,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:17,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:17,178 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 20:23:17,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:17,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586981703] [2023-08-26 20:23:17,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586981703] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:17,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:17,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 20:23:17,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386665548] [2023-08-26 20:23:17,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:17,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 20:23:17,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:17,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 20:23:17,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 20:23:17,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 315 [2023-08-26 20:23:17,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 105 flow. Second operand has 2 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:17,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:17,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 315 [2023-08-26 20:23:17,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:17,471 INFO L124 PetriNetUnfolderBase]: 1377/2158 cut-off events. [2023-08-26 20:23:17,471 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-08-26 20:23:17,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4228 conditions, 2158 events. 1377/2158 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 10602 event pairs, 1085 based on Foata normal form. 0/1131 useless extension candidates. Maximal degree in co-relation 4002. Up to 2027 conditions per place. [2023-08-26 20:23:17,514 INFO L140 encePairwiseOnDemand]: 312/315 looper letters, 40 selfloop transitions, 0 changer transitions 0/44 dead transitions. [2023-08-26 20:23:17,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 177 flow [2023-08-26 20:23:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 20:23:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 20:23:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 339 transitions. [2023-08-26 20:23:17,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5380952380952381 [2023-08-26 20:23:17,528 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 339 transitions. [2023-08-26 20:23:17,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 339 transitions. [2023-08-26 20:23:17,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:17,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 339 transitions. [2023-08-26 20:23:17,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 169.5) internal successors, (339), 2 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:17,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:17,539 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:17,541 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 105 flow. Second operand 2 states and 339 transitions. [2023-08-26 20:23:17,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 177 flow [2023-08-26 20:23:17,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 20:23:17,545 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 92 flow [2023-08-26 20:23:17,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=92, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2023-08-26 20:23:17,550 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2023-08-26 20:23:17,550 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 92 flow [2023-08-26 20:23:17,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:17,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:17,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 20:23:17,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 20:23:17,551 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 20:23:17,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:17,552 INFO L85 PathProgramCache]: Analyzing trace with hash 637603, now seen corresponding path program 1 times [2023-08-26 20:23:17,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:17,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871795251] [2023-08-26 20:23:17,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:17,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:17,721 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 20:23:17,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:17,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871795251] [2023-08-26 20:23:17,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871795251] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:17,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:17,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:23:17,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168366354] [2023-08-26 20:23:17,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:17,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:23:17,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:17,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:23:17,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:23:17,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 315 [2023-08-26 20:23:17,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:17,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:17,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 315 [2023-08-26 20:23:17,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:17,902 INFO L124 PetriNetUnfolderBase]: 1348/2103 cut-off events. [2023-08-26 20:23:17,902 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-08-26 20:23:17,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4107 conditions, 2103 events. 1348/2103 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 10317 event pairs, 1062 based on Foata normal form. 0/1113 useless extension candidates. Maximal degree in co-relation 4104. Up to 1974 conditions per place. [2023-08-26 20:23:17,914 INFO L140 encePairwiseOnDemand]: 312/315 looper letters, 37 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2023-08-26 20:23:17,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 164 flow [2023-08-26 20:23:17,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:17,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-08-26 20:23:17,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4328042328042328 [2023-08-26 20:23:17,921 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-08-26 20:23:17,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-08-26 20:23:17,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:17,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-08-26 20:23:17,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:17,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:17,928 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:17,928 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 92 flow. Second operand 3 states and 409 transitions. [2023-08-26 20:23:17,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 164 flow [2023-08-26 20:23:17,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 20:23:17,930 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 90 flow [2023-08-26 20:23:17,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2023-08-26 20:23:17,932 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2023-08-26 20:23:17,934 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 90 flow [2023-08-26 20:23:17,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:17,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:17,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 20:23:17,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 20:23:17,936 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 20:23:17,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:17,937 INFO L85 PathProgramCache]: Analyzing trace with hash 637605, now seen corresponding path program 1 times [2023-08-26 20:23:17,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:17,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392565371] [2023-08-26 20:23:17,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:17,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:18,061 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 20:23:18,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:18,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392565371] [2023-08-26 20:23:18,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392565371] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:18,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:18,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:23:18,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146890879] [2023-08-26 20:23:18,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:18,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:23:18,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:18,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:23:18,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:23:18,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 315 [2023-08-26 20:23:18,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:18,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:18,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 315 [2023-08-26 20:23:18,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:18,228 INFO L124 PetriNetUnfolderBase]: 1319/2048 cut-off events. [2023-08-26 20:23:18,228 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-08-26 20:23:18,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4002 conditions, 2048 events. 1319/2048 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 9923 event pairs, 1039 based on Foata normal form. 0/1095 useless extension candidates. Maximal degree in co-relation 3998. Up to 1922 conditions per place. [2023-08-26 20:23:18,240 INFO L140 encePairwiseOnDemand]: 312/315 looper letters, 35 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2023-08-26 20:23:18,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 158 flow [2023-08-26 20:23:18,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-08-26 20:23:18,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43703703703703706 [2023-08-26 20:23:18,242 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-08-26 20:23:18,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-08-26 20:23:18,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:18,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-08-26 20:23:18,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:18,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:18,246 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:18,246 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 90 flow. Second operand 3 states and 413 transitions. [2023-08-26 20:23:18,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 158 flow [2023-08-26 20:23:18,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 40 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:23:18,248 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 87 flow [2023-08-26 20:23:18,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2023-08-26 20:23:18,250 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2023-08-26 20:23:18,250 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 87 flow [2023-08-26 20:23:18,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:18,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:18,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 20:23:18,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 20:23:18,251 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 20:23:18,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:18,251 INFO L85 PathProgramCache]: Analyzing trace with hash 612752220, now seen corresponding path program 1 times [2023-08-26 20:23:18,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:18,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275883014] [2023-08-26 20:23:18,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:18,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:18,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 20:23:18,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:18,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275883014] [2023-08-26 20:23:18,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275883014] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:18,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:18,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:23:18,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932283665] [2023-08-26 20:23:18,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:18,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:23:18,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:18,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:23:18,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:23:18,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 315 [2023-08-26 20:23:18,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:18,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:18,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 315 [2023-08-26 20:23:18,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:18,581 INFO L124 PetriNetUnfolderBase]: 965/1525 cut-off events. [2023-08-26 20:23:18,582 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-08-26 20:23:18,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2987 conditions, 1525 events. 965/1525 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 7157 event pairs, 752 based on Foata normal form. 0/882 useless extension candidates. Maximal degree in co-relation 2983. Up to 1429 conditions per place. [2023-08-26 20:23:18,590 INFO L140 encePairwiseOnDemand]: 313/315 looper letters, 34 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2023-08-26 20:23:18,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 155 flow [2023-08-26 20:23:18,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2023-08-26 20:23:18,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43492063492063493 [2023-08-26 20:23:18,593 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2023-08-26 20:23:18,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2023-08-26 20:23:18,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:18,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2023-08-26 20:23:18,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:18,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:18,597 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:18,597 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 87 flow. Second operand 3 states and 411 transitions. [2023-08-26 20:23:18,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 39 transitions, 155 flow [2023-08-26 20:23:18,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:23:18,599 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 86 flow [2023-08-26 20:23:18,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2023-08-26 20:23:18,601 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2023-08-26 20:23:18,601 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 86 flow [2023-08-26 20:23:18,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:18,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:18,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 20:23:18,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 20:23:18,602 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 20:23:18,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:18,602 INFO L85 PathProgramCache]: Analyzing trace with hash 612752218, now seen corresponding path program 1 times [2023-08-26 20:23:18,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:18,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61943659] [2023-08-26 20:23:18,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:18,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:18,702 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 20:23:18,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:18,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61943659] [2023-08-26 20:23:18,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61943659] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:18,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:18,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 20:23:18,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018425621] [2023-08-26 20:23:18,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:18,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 20:23:18,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:18,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 20:23:18,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 20:23:18,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 315 [2023-08-26 20:23:18,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:18,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:18,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 315 [2023-08-26 20:23:18,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:18,822 INFO L124 PetriNetUnfolderBase]: 611/1002 cut-off events. [2023-08-26 20:23:18,824 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-08-26 20:23:18,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1972 conditions, 1002 events. 611/1002 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4498 event pairs, 465 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 1968. Up to 936 conditions per place. [2023-08-26 20:23:18,829 INFO L140 encePairwiseOnDemand]: 313/315 looper letters, 33 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2023-08-26 20:23:18,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 152 flow [2023-08-26 20:23:18,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2023-08-26 20:23:18,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41798941798941797 [2023-08-26 20:23:18,831 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 395 transitions. [2023-08-26 20:23:18,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions. [2023-08-26 20:23:18,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:18,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions. [2023-08-26 20:23:18,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:18,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:18,837 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:18,837 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 86 flow. Second operand 3 states and 395 transitions. [2023-08-26 20:23:18,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 152 flow [2023-08-26 20:23:18,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 151 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:23:18,838 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 85 flow [2023-08-26 20:23:18,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2023-08-26 20:23:18,840 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2023-08-26 20:23:18,840 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 85 flow [2023-08-26 20:23:18,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:18,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:18,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 20:23:18,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 20:23:18,841 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 20:23:18,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:18,842 INFO L85 PathProgramCache]: Analyzing trace with hash 612734079, now seen corresponding path program 1 times [2023-08-26 20:23:18,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:18,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880101138] [2023-08-26 20:23:18,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:18,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:18,949 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 20:23:18,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:18,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880101138] [2023-08-26 20:23:18,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880101138] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:18,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:18,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:23:18,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640839541] [2023-08-26 20:23:18,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:18,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:23:18,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:18,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:23:18,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:23:18,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 315 [2023-08-26 20:23:18,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:18,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:18,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 315 [2023-08-26 20:23:18,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:19,043 INFO L124 PetriNetUnfolderBase]: 529/866 cut-off events. [2023-08-26 20:23:19,043 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 20:23:19,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1703 conditions, 866 events. 529/866 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3714 event pairs, 393 based on Foata normal form. 0/607 useless extension candidates. Maximal degree in co-relation 1699. Up to 804 conditions per place. [2023-08-26 20:23:19,048 INFO L140 encePairwiseOnDemand]: 312/315 looper letters, 31 selfloop transitions, 1 changer transitions 0/36 dead transitions. [2023-08-26 20:23:19,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 145 flow [2023-08-26 20:23:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:19,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2023-08-26 20:23:19,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4264550264550265 [2023-08-26 20:23:19,050 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2023-08-26 20:23:19,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2023-08-26 20:23:19,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:19,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2023-08-26 20:23:19,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:19,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:19,054 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:19,054 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 85 flow. Second operand 3 states and 403 transitions. [2023-08-26 20:23:19,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 145 flow [2023-08-26 20:23:19,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:23:19,056 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 82 flow [2023-08-26 20:23:19,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2023-08-26 20:23:19,058 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2023-08-26 20:23:19,058 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 82 flow [2023-08-26 20:23:19,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:19,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:19,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 20:23:19,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 20:23:19,059 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 20:23:19,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:19,059 INFO L85 PathProgramCache]: Analyzing trace with hash 612734077, now seen corresponding path program 1 times [2023-08-26 20:23:19,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:19,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489227390] [2023-08-26 20:23:19,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:19,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:19,232 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 20:23:19,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:19,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489227390] [2023-08-26 20:23:19,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489227390] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:19,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:19,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:23:19,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945870289] [2023-08-26 20:23:19,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:19,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:23:19,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:19,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:23:19,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:23:19,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 315 [2023-08-26 20:23:19,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:19,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:19,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 315 [2023-08-26 20:23:19,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:19,394 INFO L124 PetriNetUnfolderBase]: 796/1329 cut-off events. [2023-08-26 20:23:19,395 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 20:23:19,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2608 conditions, 1329 events. 796/1329 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5749 event pairs, 276 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 2604. Up to 753 conditions per place. [2023-08-26 20:23:19,401 INFO L140 encePairwiseOnDemand]: 309/315 looper letters, 53 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-26 20:23:19,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 60 transitions, 245 flow [2023-08-26 20:23:19,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:19,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:19,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-26 20:23:19,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4306878306878307 [2023-08-26 20:23:19,404 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-26 20:23:19,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-26 20:23:19,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:19,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-26 20:23:19,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:19,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:19,407 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:19,407 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 82 flow. Second operand 3 states and 407 transitions. [2023-08-26 20:23:19,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 60 transitions, 245 flow [2023-08-26 20:23:19,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:23:19,411 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 104 flow [2023-08-26 20:23:19,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2023-08-26 20:23:19,412 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2023-08-26 20:23:19,412 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 104 flow [2023-08-26 20:23:19,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:19,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:19,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:23:19,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 20:23:19,413 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 20:23:19,413 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:19,413 INFO L85 PathProgramCache]: Analyzing trace with hash 426927818, now seen corresponding path program 1 times [2023-08-26 20:23:19,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:19,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416971303] [2023-08-26 20:23:19,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:19,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:19,429 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 20:23:19,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1020603356] [2023-08-26 20:23:19,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:19,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:19,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:23:19,437 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:23:19,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 20:23:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:19,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-26 20:23:19,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:23:19,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:23:19,557 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 20:23:19,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:19,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416971303] [2023-08-26 20:23:19,558 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 20:23:19,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020603356] [2023-08-26 20:23:19,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020603356] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:19,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:19,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 20:23:19,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416045272] [2023-08-26 20:23:19,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:19,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:23:19,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:19,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:23:19,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:23:19,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 315 [2023-08-26 20:23:19,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:19,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:19,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 315 [2023-08-26 20:23:19,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:19,725 INFO L124 PetriNetUnfolderBase]: 759/1268 cut-off events. [2023-08-26 20:23:19,726 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-08-26 20:23:19,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2600 conditions, 1268 events. 759/1268 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5542 event pairs, 557 based on Foata normal form. 0/981 useless extension candidates. Maximal degree in co-relation 2595. Up to 1156 conditions per place. [2023-08-26 20:23:19,732 INFO L140 encePairwiseOnDemand]: 313/315 looper letters, 31 selfloop transitions, 1 changer transitions 0/36 dead transitions. [2023-08-26 20:23:19,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 159 flow [2023-08-26 20:23:19,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-08-26 20:23:19,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45925925925925926 [2023-08-26 20:23:19,734 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-08-26 20:23:19,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-08-26 20:23:19,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:19,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-08-26 20:23:19,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:19,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:19,738 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:19,738 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 104 flow. Second operand 3 states and 434 transitions. [2023-08-26 20:23:19,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 159 flow [2023-08-26 20:23:19,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 36 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:23:19,740 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 95 flow [2023-08-26 20:23:19,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-08-26 20:23:19,742 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2023-08-26 20:23:19,742 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 95 flow [2023-08-26 20:23:19,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:19,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:19,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:23:19,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 20:23:19,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:19,948 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 20:23:19,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:19,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1860296884, now seen corresponding path program 1 times [2023-08-26 20:23:19,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:19,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406619487] [2023-08-26 20:23:19,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:19,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:20,005 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 20:23:20,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:20,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406619487] [2023-08-26 20:23:20,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406619487] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:20,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:20,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 20:23:20,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113585420] [2023-08-26 20:23:20,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:20,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:23:20,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:20,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:23:20,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:23:20,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 315 [2023-08-26 20:23:20,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:20,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:20,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 315 [2023-08-26 20:23:20,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:20,179 INFO L124 PetriNetUnfolderBase]: 1117/1878 cut-off events. [2023-08-26 20:23:20,179 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-08-26 20:23:20,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3903 conditions, 1878 events. 1117/1878 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 8605 event pairs, 419 based on Foata normal form. 0/1480 useless extension candidates. Maximal degree in co-relation 3898. Up to 1161 conditions per place. [2023-08-26 20:23:20,189 INFO L140 encePairwiseOnDemand]: 311/315 looper letters, 53 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2023-08-26 20:23:20,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 59 transitions, 262 flow [2023-08-26 20:23:20,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:20,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2023-08-26 20:23:20,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.508994708994709 [2023-08-26 20:23:20,192 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 481 transitions. [2023-08-26 20:23:20,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 481 transitions. [2023-08-26 20:23:20,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:20,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 481 transitions. [2023-08-26 20:23:20,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:20,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:20,195 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:20,195 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 95 flow. Second operand 3 states and 481 transitions. [2023-08-26 20:23:20,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 59 transitions, 262 flow [2023-08-26 20:23:20,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:23:20,197 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 109 flow [2023-08-26 20:23:20,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-08-26 20:23:20,198 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2023-08-26 20:23:20,198 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 109 flow [2023-08-26 20:23:20,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:20,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:20,198 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:23:20,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 20:23:20,198 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 20:23:20,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:20,199 INFO L85 PathProgramCache]: Analyzing trace with hash -780043826, now seen corresponding path program 1 times [2023-08-26 20:23:20,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:20,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074150464] [2023-08-26 20:23:20,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:20,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:20,211 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 20:23:20,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [232983989] [2023-08-26 20:23:20,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:20,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:20,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:23:20,213 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:23:20,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 20:23:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:20,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-26 20:23:20,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:23:20,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:23:20,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:23:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:23:20,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:20,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074150464] [2023-08-26 20:23:20,388 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 20:23:20,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232983989] [2023-08-26 20:23:20,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232983989] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-26 20:23:20,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 20:23:20,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2023-08-26 20:23:20,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030428130] [2023-08-26 20:23:20,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:20,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:23:20,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:20,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:23:20,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:23:20,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 315 [2023-08-26 20:23:20,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:20,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:20,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 315 [2023-08-26 20:23:20,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:20,532 INFO L124 PetriNetUnfolderBase]: 763/1352 cut-off events. [2023-08-26 20:23:20,532 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-08-26 20:23:20,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2807 conditions, 1352 events. 763/1352 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6150 event pairs, 275 based on Foata normal form. 32/1165 useless extension candidates. Maximal degree in co-relation 2801. Up to 806 conditions per place. [2023-08-26 20:23:20,538 INFO L140 encePairwiseOnDemand]: 308/315 looper letters, 39 selfloop transitions, 3 changer transitions 5/50 dead transitions. [2023-08-26 20:23:20,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 230 flow [2023-08-26 20:23:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2023-08-26 20:23:20,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026455026455027 [2023-08-26 20:23:20,540 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 475 transitions. [2023-08-26 20:23:20,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 475 transitions. [2023-08-26 20:23:20,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:20,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 475 transitions. [2023-08-26 20:23:20,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:20,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:20,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:20,544 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 109 flow. Second operand 3 states and 475 transitions. [2023-08-26 20:23:20,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 230 flow [2023-08-26 20:23:20,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 20:23:20,546 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 119 flow [2023-08-26 20:23:20,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-08-26 20:23:20,549 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2023-08-26 20:23:20,549 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 119 flow [2023-08-26 20:23:20,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:20,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:20,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:23:20,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 20:23:20,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-26 20:23:20,755 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 20:23:20,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:20,756 INFO L85 PathProgramCache]: Analyzing trace with hash 235347345, now seen corresponding path program 1 times [2023-08-26 20:23:20,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:20,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431953293] [2023-08-26 20:23:20,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:20,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:20,813 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 20:23:20,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:20,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431953293] [2023-08-26 20:23:20,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431953293] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:20,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:20,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 20:23:20,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555743667] [2023-08-26 20:23:20,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:20,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:23:20,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:20,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:23:20,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:23:20,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 315 [2023-08-26 20:23:20,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:20,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:20,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 315 [2023-08-26 20:23:20,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:20,945 INFO L124 PetriNetUnfolderBase]: 532/965 cut-off events. [2023-08-26 20:23:20,945 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-08-26 20:23:20,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2161 conditions, 965 events. 532/965 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4223 event pairs, 147 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 2154. Up to 607 conditions per place. [2023-08-26 20:23:20,949 INFO L140 encePairwiseOnDemand]: 311/315 looper letters, 41 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2023-08-26 20:23:20,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 47 transitions, 234 flow [2023-08-26 20:23:20,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2023-08-26 20:23:20,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4740740740740741 [2023-08-26 20:23:20,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2023-08-26 20:23:20,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2023-08-26 20:23:20,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:20,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2023-08-26 20:23:20,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:20,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:20,955 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:20,955 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 119 flow. Second operand 3 states and 448 transitions. [2023-08-26 20:23:20,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 47 transitions, 234 flow [2023-08-26 20:23:20,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 20:23:20,957 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 121 flow [2023-08-26 20:23:20,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-08-26 20:23:20,958 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2023-08-26 20:23:20,958 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 121 flow [2023-08-26 20:23:20,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:20,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:20,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:23:20,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 20:23:20,958 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 20:23:20,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:20,959 INFO L85 PathProgramCache]: Analyzing trace with hash -122543660, now seen corresponding path program 1 times [2023-08-26 20:23:20,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:20,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301134476] [2023-08-26 20:23:20,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:20,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:21,064 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 20:23:21,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:21,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301134476] [2023-08-26 20:23:21,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301134476] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:21,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:21,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 20:23:21,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631523817] [2023-08-26 20:23:21,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:21,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:23:21,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:21,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:23:21,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:23:21,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 315 [2023-08-26 20:23:21,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:21,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:21,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 315 [2023-08-26 20:23:21,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:21,164 INFO L124 PetriNetUnfolderBase]: 330/625 cut-off events. [2023-08-26 20:23:21,165 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-08-26 20:23:21,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 625 events. 330/625 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2299 event pairs, 158 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 1430. Up to 416 conditions per place. [2023-08-26 20:23:21,168 INFO L140 encePairwiseOnDemand]: 312/315 looper letters, 40 selfloop transitions, 2 changer transitions 4/50 dead transitions. [2023-08-26 20:23:21,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 250 flow [2023-08-26 20:23:21,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-08-26 20:23:21,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47513227513227513 [2023-08-26 20:23:21,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-08-26 20:23:21,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-08-26 20:23:21,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:21,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-08-26 20:23:21,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:21,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:21,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 315.0) internal successors, (1260), 4 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:21,173 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 121 flow. Second operand 3 states and 449 transitions. [2023-08-26 20:23:21,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 250 flow [2023-08-26 20:23:21,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 240 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 20:23:21,175 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 121 flow [2023-08-26 20:23:21,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2023-08-26 20:23:21,176 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2023-08-26 20:23:21,176 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 121 flow [2023-08-26 20:23:21,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:21,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:21,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:23:21,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 20:23:21,177 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 20:23:21,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:21,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1314295106, now seen corresponding path program 1 times [2023-08-26 20:23:21,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:21,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102141083] [2023-08-26 20:23:21,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:21,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:21,191 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 20:23:21,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1032169332] [2023-08-26 20:23:21,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:21,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:21,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:23:21,193 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:23:21,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 20:23:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:21,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-26 20:23:21,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:23:21,456 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 20:23:21,457 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 20:23:21,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:21,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102141083] [2023-08-26 20:23:21,457 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 20:23:21,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032169332] [2023-08-26 20:23:21,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032169332] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:21,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:21,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 20:23:21,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496348628] [2023-08-26 20:23:21,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:21,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 20:23:21,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:21,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 20:23:21,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 20:23:21,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 315 [2023-08-26 20:23:21,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:21,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:21,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 315 [2023-08-26 20:23:21,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:21,623 INFO L124 PetriNetUnfolderBase]: 521/982 cut-off events. [2023-08-26 20:23:21,623 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2023-08-26 20:23:21,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2176 conditions, 982 events. 521/982 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3909 event pairs, 214 based on Foata normal form. 0/956 useless extension candidates. Maximal degree in co-relation 2167. Up to 373 conditions per place. [2023-08-26 20:23:21,628 INFO L140 encePairwiseOnDemand]: 311/315 looper letters, 62 selfloop transitions, 3 changer transitions 4/73 dead transitions. [2023-08-26 20:23:21,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 73 transitions, 364 flow [2023-08-26 20:23:21,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 20:23:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 20:23:21,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 522 transitions. [2023-08-26 20:23:21,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2023-08-26 20:23:21,630 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 522 transitions. [2023-08-26 20:23:21,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 522 transitions. [2023-08-26 20:23:21,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:21,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 522 transitions. [2023-08-26 20:23:21,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:21,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:21,634 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:21,634 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 121 flow. Second operand 4 states and 522 transitions. [2023-08-26 20:23:21,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 73 transitions, 364 flow [2023-08-26 20:23:21,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 73 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 20:23:21,637 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 131 flow [2023-08-26 20:23:21,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-08-26 20:23:21,637 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2023-08-26 20:23:21,637 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 131 flow [2023-08-26 20:23:21,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:21,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:21,638 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 20:23:21,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 20:23:21,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:21,852 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 20:23:21,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:21,852 INFO L85 PathProgramCache]: Analyzing trace with hash -2088442694, now seen corresponding path program 1 times [2023-08-26 20:23:21,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:21,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031167262] [2023-08-26 20:23:21,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:21,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:21,865 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 20:23:21,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [360841212] [2023-08-26 20:23:21,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:21,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:21,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:23:21,867 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:23:21,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 20:23:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:22,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-26 20:23:22,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:23:22,300 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 20:23:22,300 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 20:23:22,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:22,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031167262] [2023-08-26 20:23:22,300 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 20:23:22,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360841212] [2023-08-26 20:23:22,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360841212] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:22,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:22,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 20:23:22,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837613013] [2023-08-26 20:23:22,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:22,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 20:23:22,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:22,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 20:23:22,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 20:23:22,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 315 [2023-08-26 20:23:22,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:22,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:22,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 315 [2023-08-26 20:23:22,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:22,434 INFO L124 PetriNetUnfolderBase]: 412/779 cut-off events. [2023-08-26 20:23:22,434 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2023-08-26 20:23:22,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1761 conditions, 779 events. 412/779 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2817 event pairs, 158 based on Foata normal form. 8/778 useless extension candidates. Maximal degree in co-relation 1751. Up to 364 conditions per place. [2023-08-26 20:23:22,438 INFO L140 encePairwiseOnDemand]: 311/315 looper letters, 52 selfloop transitions, 3 changer transitions 5/64 dead transitions. [2023-08-26 20:23:22,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 64 transitions, 321 flow [2023-08-26 20:23:22,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 20:23:22,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 20:23:22,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2023-08-26 20:23:22,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4579365079365079 [2023-08-26 20:23:22,440 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 577 transitions. [2023-08-26 20:23:22,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 577 transitions. [2023-08-26 20:23:22,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:22,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 577 transitions. [2023-08-26 20:23:22,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.25) internal successors, (577), 4 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:22,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:22,444 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:22,444 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 131 flow. Second operand 4 states and 577 transitions. [2023-08-26 20:23:22,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 64 transitions, 321 flow [2023-08-26 20:23:22,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 64 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 20:23:22,446 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 137 flow [2023-08-26 20:23:22,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2023-08-26 20:23:22,447 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2023-08-26 20:23:22,447 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 137 flow [2023-08-26 20:23:22,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:22,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:22,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:23:22,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 20:23:22,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:22,653 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 20:23:22,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:22,654 INFO L85 PathProgramCache]: Analyzing trace with hash -317229367, now seen corresponding path program 1 times [2023-08-26 20:23:22,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:22,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627577787] [2023-08-26 20:23:22,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:22,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:22,668 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 20:23:22,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1988812481] [2023-08-26 20:23:22,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:22,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:22,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:23:22,669 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:23:22,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 20:23:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:22,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-26 20:23:22,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:23:23,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:23:23,033 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2023-08-26 20:23:23,052 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 20:23:23,053 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 20:23:23,084 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 20:23:23,161 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2023-08-26 20:23:23,379 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2023-08-26 20:23:23,510 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 20:23:23,510 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 20:23:23,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:23,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627577787] [2023-08-26 20:23:23,510 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 20:23:23,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988812481] [2023-08-26 20:23:23,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988812481] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:23,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:23,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 20:23:23,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922425956] [2023-08-26 20:23:23,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:23,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 20:23:23,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:23,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 20:23:23,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-26 20:23:23,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 315 [2023-08-26 20:23:23,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 137 flow. Second operand has 9 states, 9 states have (on average 97.77777777777777) internal successors, (880), 9 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:23,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:23,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 315 [2023-08-26 20:23:23,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:24,115 INFO L124 PetriNetUnfolderBase]: 885/1642 cut-off events. [2023-08-26 20:23:24,115 INFO L125 PetriNetUnfolderBase]: For 381/389 co-relation queries the response was YES. [2023-08-26 20:23:24,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3734 conditions, 1642 events. 885/1642 cut-off events. For 381/389 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 7779 event pairs, 311 based on Foata normal form. 59/1680 useless extension candidates. Maximal degree in co-relation 3723. Up to 578 conditions per place. [2023-08-26 20:23:24,124 INFO L140 encePairwiseOnDemand]: 301/315 looper letters, 108 selfloop transitions, 24 changer transitions 3/139 dead transitions. [2023-08-26 20:23:24,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 139 transitions, 722 flow [2023-08-26 20:23:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 20:23:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 20:23:24,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1100 transitions. [2023-08-26 20:23:24,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3492063492063492 [2023-08-26 20:23:24,128 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1100 transitions. [2023-08-26 20:23:24,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1100 transitions. [2023-08-26 20:23:24,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:24,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1100 transitions. [2023-08-26 20:23:24,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:24,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 315.0) internal successors, (3465), 11 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:24,135 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 315.0) internal successors, (3465), 11 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:24,135 INFO L175 Difference]: Start difference. First operand has 53 places, 37 transitions, 137 flow. Second operand 10 states and 1100 transitions. [2023-08-26 20:23:24,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 139 transitions, 722 flow [2023-08-26 20:23:24,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 139 transitions, 704 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 20:23:24,139 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 329 flow [2023-08-26 20:23:24,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=329, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2023-08-26 20:23:24,140 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2023-08-26 20:23:24,140 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 329 flow [2023-08-26 20:23:24,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 97.77777777777777) internal successors, (880), 9 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:24,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:24,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:23:24,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 20:23:24,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-26 20:23:24,346 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 20:23:24,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:24,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1461527893, now seen corresponding path program 2 times [2023-08-26 20:23:24,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:24,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795872301] [2023-08-26 20:23:24,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:24,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:24,360 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 20:23:24,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1315787636] [2023-08-26 20:23:24,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 20:23:24,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:24,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:23:24,362 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:23:24,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 20:23:24,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-26 20:23:24,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 20:23:24,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-26 20:23:24,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:23:24,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:23:24,646 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2023-08-26 20:23:24,659 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 20:23:24,659 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 20:23:24,677 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 20:23:24,745 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2023-08-26 20:23:24,868 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2023-08-26 20:23:24,968 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 20:23:24,969 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 20:23:24,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:24,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795872301] [2023-08-26 20:23:24,969 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 20:23:24,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315787636] [2023-08-26 20:23:24,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315787636] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:24,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:24,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 20:23:24,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500828519] [2023-08-26 20:23:24,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:24,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 20:23:24,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:24,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 20:23:24,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-26 20:23:24,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 315 [2023-08-26 20:23:24,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 329 flow. Second operand has 9 states, 9 states have (on average 97.77777777777777) internal successors, (880), 9 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:24,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:24,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 315 [2023-08-26 20:23:24,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:25,719 INFO L124 PetriNetUnfolderBase]: 1449/2710 cut-off events. [2023-08-26 20:23:25,719 INFO L125 PetriNetUnfolderBase]: For 4113/4137 co-relation queries the response was YES. [2023-08-26 20:23:25,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8680 conditions, 2710 events. 1449/2710 cut-off events. For 4113/4137 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 14435 event pairs, 296 based on Foata normal form. 45/2727 useless extension candidates. Maximal degree in co-relation 8662. Up to 742 conditions per place. [2023-08-26 20:23:25,736 INFO L140 encePairwiseOnDemand]: 302/315 looper letters, 130 selfloop transitions, 44 changer transitions 4/182 dead transitions. [2023-08-26 20:23:25,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 182 transitions, 1240 flow [2023-08-26 20:23:25,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 20:23:25,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 20:23:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1314 transitions. [2023-08-26 20:23:25,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3476190476190476 [2023-08-26 20:23:25,741 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1314 transitions. [2023-08-26 20:23:25,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1314 transitions. [2023-08-26 20:23:25,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:25,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1314 transitions. [2023-08-26 20:23:25,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 109.5) internal successors, (1314), 12 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:25,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 315.0) internal successors, (4095), 13 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:25,751 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 315.0) internal successors, (4095), 13 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:25,751 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 329 flow. Second operand 12 states and 1314 transitions. [2023-08-26 20:23:25,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 182 transitions, 1240 flow [2023-08-26 20:23:25,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 182 transitions, 1234 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-26 20:23:25,764 INFO L231 Difference]: Finished difference. Result has 84 places, 84 transitions, 662 flow [2023-08-26 20:23:25,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=662, PETRI_PLACES=84, PETRI_TRANSITIONS=84} [2023-08-26 20:23:25,765 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 36 predicate places. [2023-08-26 20:23:25,765 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 84 transitions, 662 flow [2023-08-26 20:23:25,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 97.77777777777777) internal successors, (880), 9 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:25,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:25,765 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:23:25,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 20:23:25,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-26 20:23:25,971 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-26 20:23:25,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:25,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1899533698, now seen corresponding path program 1 times [2023-08-26 20:23:25,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:25,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496839269] [2023-08-26 20:23:25,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:25,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:25,993 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 20:23:25,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [957656930] [2023-08-26 20:23:25,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:25,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:25,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:23:25,997 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:23:26,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 20:23:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 20:23:26,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 20:23:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 20:23:26,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 20:23:26,307 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 20:23:26,308 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONASSERT (21 of 22 remaining) [2023-08-26 20:23:26,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 22 remaining) [2023-08-26 20:23:26,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 22 remaining) [2023-08-26 20:23:26,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 22 remaining) [2023-08-26 20:23:26,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 22 remaining) [2023-08-26 20:23:26,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 22 remaining) [2023-08-26 20:23:26,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 22 remaining) [2023-08-26 20:23:26,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 22 remaining) [2023-08-26 20:23:26,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 22 remaining) [2023-08-26 20:23:26,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 22 remaining) [2023-08-26 20:23:26,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 22 remaining) [2023-08-26 20:23:26,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 22 remaining) [2023-08-26 20:23:26,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 22 remaining) [2023-08-26 20:23:26,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONASSERT (8 of 22 remaining) [2023-08-26 20:23:26,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 22 remaining) [2023-08-26 20:23:26,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 22 remaining) [2023-08-26 20:23:26,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONASSERT (5 of 22 remaining) [2023-08-26 20:23:26,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 22 remaining) [2023-08-26 20:23:26,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 22 remaining) [2023-08-26 20:23:26,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONASSERT (2 of 22 remaining) [2023-08-26 20:23:26,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 22 remaining) [2023-08-26 20:23:26,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 22 remaining) [2023-08-26 20:23:26,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 20:23:26,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:26,518 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:23:26,522 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 20:23:26,522 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 20:23:26,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 08:23:26 BasicIcfg [2023-08-26 20:23:26,560 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 20:23:26,560 INFO L158 Benchmark]: Toolchain (without parser) took 16898.41ms. Allocated memory was 377.5MB in the beginning and 654.3MB in the end (delta: 276.8MB). Free memory was 352.1MB in the beginning and 491.2MB in the end (delta: -139.1MB). Peak memory consumption was 137.5MB. Max. memory is 16.0GB. [2023-08-26 20:23:26,560 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 377.5MB. Free memory was 354.9MB in the beginning and 354.7MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 20:23:26,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.21ms. Allocated memory is still 377.5MB. Free memory was 352.1MB in the beginning and 331.9MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-26 20:23:26,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.31ms. Allocated memory is still 377.5MB. Free memory was 331.9MB in the beginning and 329.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 20:23:26,561 INFO L158 Benchmark]: Boogie Preprocessor took 41.12ms. Allocated memory is still 377.5MB. Free memory was 329.0MB in the beginning and 327.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 20:23:26,561 INFO L158 Benchmark]: RCFGBuilder took 539.28ms. Allocated memory is still 377.5MB. Free memory was 327.7MB in the beginning and 308.1MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-26 20:23:26,561 INFO L158 Benchmark]: TraceAbstraction took 15805.95ms. Allocated memory was 377.5MB in the beginning and 654.3MB in the end (delta: 276.8MB). Free memory was 307.3MB in the beginning and 491.2MB in the end (delta: -183.8MB). Peak memory consumption was 93.4MB. Max. memory is 16.0GB. [2023-08-26 20:23:26,563 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 377.5MB. Free memory was 354.9MB in the beginning and 354.7MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 459.21ms. Allocated memory is still 377.5MB. Free memory was 352.1MB in the beginning and 331.9MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 48.31ms. Allocated memory is still 377.5MB. Free memory was 331.9MB in the beginning and 329.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.12ms. Allocated memory is still 377.5MB. Free memory was 329.0MB in the beginning and 327.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 539.28ms. Allocated memory is still 377.5MB. Free memory was 327.7MB in the beginning and 308.1MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 15805.95ms. Allocated memory was 377.5MB in the beginning and 654.3MB in the end (delta: 276.8MB). Free memory was 307.3MB in the beginning and 491.2MB in the end (delta: -183.8MB). Peak memory consumption was 93.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 208]: Unsoundness Warning unspecified type, defaulting to int C: short [208] - GenericResultAtLocation [Line: 209]: Unsoundness Warning unspecified type, defaulting to int C: short [209] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 144 PlacesBefore, 48 PlacesAfterwards, 149 TransitionsBefore, 48 TransitionsAfterwards, 5668 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 18 ConcurrentYvCompositions, 5 ChoiceCompositions, 155 TotalNumberOfCompositions, 14419 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7622, independent: 7265, independent conditional: 0, independent unconditional: 7265, dependent: 357, dependent conditional: 0, dependent unconditional: 357, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3161, independent: 3112, independent conditional: 0, independent unconditional: 3112, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7622, independent: 4153, independent conditional: 0, independent unconditional: 4153, dependent: 308, dependent conditional: 0, dependent unconditional: 308, unknown: 3161, unknown conditional: 0, unknown unconditional: 3161] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 274, Positive conditional cache size: 0, Positive unconditional cache size: 274, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 681]: assertion can be violated assertion can be violated We found a FailurePath: [L682] 0 static char buffer[10]; [L683] 0 static unsigned int first; [L684] 0 static unsigned int next; [L685] 0 static int buffer_size; [L686] 0 _Bool send, receive; [L687] 0 pthread_mutex_t m; [L756] 0 pthread_t id1, id2; [L758] CALL 0 initLog(10) [L690] 0 buffer_size = max [L691] EXPR 0 next = 0 [L691] 0 first = next = 0 [L758] RET 0 initLog(10) [L759] 0 send=1 [L760] 0 receive=0 [L761] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1={5:0}, id2={6:0}, m={4:0}, next=0, pthread_create(&id1, ((void *)0), t1, ((void *)0))=-1, receive=0, send=1] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1={5:0}, id2={6:0}, m={4:0}, next=0, pthread_create(&id2, ((void *)0), t2, ((void *)0))=0, receive=0, send=1] [L739] 2 int i; [L740] 2 i=0 VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L740] COND TRUE 2 i<7 [L743] COND FALSE 2 !(\read(receive)) VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L740] 2 i++ VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=1, m={4:0}, next=0, receive=0, send=1] [L723] 1 int i; [L724] 1 i=0 VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L724] COND TRUE 1 i<7 [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 [L709] 1 buffer[next] = b VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L710] 1 next = (next+1)%buffer_size [L712] COND TRUE 1 next 0 && first < buffer_size [L697] 2 first++ [L698] EXPR 2 buffer[first-1] [L698] 2 return buffer[first-1]; [L745] RET, EXPR 2 removeLogElement() [L745] COND FALSE 2 !(removeLogElement()==i) [L746] CALL 2 reach_error() [L681] COND FALSE 2 !(0) [L681] 2 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={121:120}, buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] - 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: 762]: 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: 761]: 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: -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: 681]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 227 locations, 22 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: 15.6s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 685 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 685 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1536 IncrementalHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 2 mSDtfsCounter, 1536 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred in iteration=16, InterpolantAutomatonStates: 65, 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, 1.0s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 150 ConstructedInterpolants, 18 QuantifiedInterpolants, 1377 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1320 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 2/4 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 20:23:26,589 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...