/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_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 20:23:28,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 20:23:28,939 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:28,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 20:23:28,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 20:23:28,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 20:23:28,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 20:23:28,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 20:23:28,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 20:23:28,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 20:23:28,984 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 20:23:28,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 20:23:28,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 20:23:28,985 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 20:23:28,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 20:23:28,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 20:23:28,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 20:23:28,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 20:23:28,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 20:23:28,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 20:23:28,987 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 20:23:28,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 20:23:28,988 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 20:23:28,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 20:23:28,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 20:23:28,989 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 20:23:28,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 20:23:28,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 20:23:28,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 20:23:28,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 20:23:28,991 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 20:23:28,991 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 20:23:28,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 20:23:28,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 20:23:28,991 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 20:23:28,991 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:29,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 20:23:29,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 20:23:29,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 20:23:29,293 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 20:23:29,294 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 20:23:29,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2023-08-26 20:23:30,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 20:23:30,725 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 20:23:30,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2023-08-26 20:23:30,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e48c4d28f/0fc85316ed1f474294eb3aa119933b2c/FLAG946d70f31 [2023-08-26 20:23:30,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e48c4d28f/0fc85316ed1f474294eb3aa119933b2c [2023-08-26 20:23:30,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 20:23:30,761 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 20:23:30,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 20:23:30,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 20:23:30,764 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 20:23:30,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:23:30" (1/1) ... [2023-08-26 20:23:30,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b3aeb87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:23:30, skipping insertion in model container [2023-08-26 20:23:30,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:23:30" (1/1) ... [2023-08-26 20:23:30,816 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 20:23:31,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 20:23:31,157 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 20:23:31,181 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [208] [2023-08-26 20:23:31,182 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [209] [2023-08-26 20:23:31,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 20:23:31,255 INFO L206 MainTranslator]: Completed translation [2023-08-26 20:23:31,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:23:31 WrapperNode [2023-08-26 20:23:31,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 20:23:31,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 20:23:31,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 20:23:31,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 20:23:31,262 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:31" (1/1) ... [2023-08-26 20:23:31,284 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:31" (1/1) ... [2023-08-26 20:23:31,318 INFO L138 Inliner]: procedures = 168, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2023-08-26 20:23:31,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 20:23:31,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 20:23:31,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 20:23:31,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 20:23:31,335 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:31" (1/1) ... [2023-08-26 20:23:31,335 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:31" (1/1) ... [2023-08-26 20:23:31,349 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:31" (1/1) ... [2023-08-26 20:23:31,349 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:31" (1/1) ... [2023-08-26 20:23:31,355 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:31" (1/1) ... [2023-08-26 20:23:31,358 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:31" (1/1) ... [2023-08-26 20:23:31,385 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:31" (1/1) ... [2023-08-26 20:23:31,386 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:31" (1/1) ... [2023-08-26 20:23:31,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 20:23:31,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 20:23:31,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 20:23:31,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 20:23:31,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:23:31" (1/1) ... [2023-08-26 20:23:31,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 20:23:31,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:23:31,429 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:31,445 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:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 20:23:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-26 20:23:31,472 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-26 20:23:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-26 20:23:31,472 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-26 20:23:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 20:23:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 20:23:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 20:23:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 20:23:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 20:23:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-08-26 20:23:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 20:23:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 20:23:31,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 20:23:31,476 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:31,611 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 20:23:31,612 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 20:23:31,959 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 20:23:31,966 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 20:23:31,966 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-26 20:23:31,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:23:31 BoogieIcfgContainer [2023-08-26 20:23:31,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 20:23:31,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 20:23:31,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 20:23:31,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 20:23:31,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 08:23:30" (1/3) ... [2023-08-26 20:23:31,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a99f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:23:31, skipping insertion in model container [2023-08-26 20:23:31,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:23:31" (2/3) ... [2023-08-26 20:23:31,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a99f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:23:31, skipping insertion in model container [2023-08-26 20:23:31,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:23:31" (3/3) ... [2023-08-26 20:23:31,976 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2023-08-26 20:23:31,991 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 20:23:31,992 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2023-08-26 20:23:31,992 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 20:23:32,107 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 20:23:32,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 172 transitions, 360 flow [2023-08-26 20:23:32,197 INFO L124 PetriNetUnfolderBase]: 14/170 cut-off events. [2023-08-26 20:23:32,197 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 20:23:32,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 14/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 389 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2023-08-26 20:23:32,205 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 172 transitions, 360 flow [2023-08-26 20:23:32,210 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 161 transitions, 331 flow [2023-08-26 20:23:32,213 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 20:23:32,221 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 161 transitions, 331 flow [2023-08-26 20:23:32,223 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 161 transitions, 331 flow [2023-08-26 20:23:32,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 161 transitions, 331 flow [2023-08-26 20:23:32,252 INFO L124 PetriNetUnfolderBase]: 14/161 cut-off events. [2023-08-26 20:23:32,252 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 20:23:32,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 161 events. 14/161 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 366 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2023-08-26 20:23:32,257 INFO L119 LiptonReduction]: Number of co-enabled transitions 6922 [2023-08-26 20:23:37,745 INFO L134 LiptonReduction]: Checked pairs total: 17080 [2023-08-26 20:23:37,745 INFO L136 LiptonReduction]: Total number of compositions: 172 [2023-08-26 20:23:37,757 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 20:23:37,762 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;@7e9326ce, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 20:23:37,762 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-08-26 20:23:37,763 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 20:23:37,763 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 20:23:37,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 20:23:37,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:37,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 20:23:37,764 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 20:23:37,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:37,768 INFO L85 PathProgramCache]: Analyzing trace with hash 708, now seen corresponding path program 1 times [2023-08-26 20:23:37,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:37,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790677981] [2023-08-26 20:23:37,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:37,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:37,862 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:37,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:37,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790677981] [2023-08-26 20:23:37,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790677981] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:37,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:37,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 20:23:37,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151112322] [2023-08-26 20:23:37,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:37,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 20:23:37,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:37,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 20:23:37,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 20:23:37,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 344 [2023-08-26 20:23:37,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 51 transitions, 111 flow. Second operand has 2 states, 2 states have (on average 157.5) internal successors, (315), 2 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have 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:37,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:37,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 344 [2023-08-26 20:23:37,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:38,182 INFO L124 PetriNetUnfolderBase]: 1468/2378 cut-off events. [2023-08-26 20:23:38,183 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-08-26 20:23:38,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4612 conditions, 2378 events. 1468/2378 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 12410 event pairs, 1176 based on Foata normal form. 56/1307 useless extension candidates. Maximal degree in co-relation 4357. Up to 2190 conditions per place. [2023-08-26 20:23:38,208 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 41 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2023-08-26 20:23:38,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 47 transitions, 185 flow [2023-08-26 20:23:38,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 20:23:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 20:23:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 359 transitions. [2023-08-26 20:23:38,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5218023255813954 [2023-08-26 20:23:38,221 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 359 transitions. [2023-08-26 20:23:38,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 359 transitions. [2023-08-26 20:23:38,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:38,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 359 transitions. [2023-08-26 20:23:38,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 179.5) internal successors, (359), 2 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have 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:38,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have 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:38,232 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have 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:38,233 INFO L175 Difference]: Start difference. First operand has 50 places, 51 transitions, 111 flow. Second operand 2 states and 359 transitions. [2023-08-26 20:23:38,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 47 transitions, 185 flow [2023-08-26 20:23:38,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 20:23:38,238 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 98 flow [2023-08-26 20:23:38,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=98, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2023-08-26 20:23:38,242 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-26 20:23:38,242 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 98 flow [2023-08-26 20:23:38,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 157.5) internal successors, (315), 2 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have 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:38,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:38,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 20:23:38,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 20:23:38,243 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 20:23:38,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:38,244 INFO L85 PathProgramCache]: Analyzing trace with hash 698611, now seen corresponding path program 1 times [2023-08-26 20:23:38,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:38,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214797803] [2023-08-26 20:23:38,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:38,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:38,519 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:38,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:38,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214797803] [2023-08-26 20:23:38,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214797803] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:38,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:38,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:23:38,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392660792] [2023-08-26 20:23:38,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:38,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:23:38,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:38,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:23:38,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:23:38,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 344 [2023-08-26 20:23:38,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have 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:38,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:38,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 344 [2023-08-26 20:23:38,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:38,711 INFO L124 PetriNetUnfolderBase]: 1438/2318 cut-off events. [2023-08-26 20:23:38,712 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-08-26 20:23:38,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4482 conditions, 2318 events. 1438/2318 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 12025 event pairs, 1152 based on Foata normal form. 0/1230 useless extension candidates. Maximal degree in co-relation 4479. Up to 2134 conditions per place. [2023-08-26 20:23:38,725 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 38 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-08-26 20:23:38,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 172 flow [2023-08-26 20:23:38,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:38,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:38,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2023-08-26 20:23:38,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42926356589147285 [2023-08-26 20:23:38,729 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2023-08-26 20:23:38,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2023-08-26 20:23:38,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:38,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2023-08-26 20:23:38,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have 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:38,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:38,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:38,735 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 98 flow. Second operand 3 states and 443 transitions. [2023-08-26 20:23:38,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 172 flow [2023-08-26 20:23:38,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 20:23:38,737 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 96 flow [2023-08-26 20:23:38,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2023-08-26 20:23:38,738 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-26 20:23:38,738 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 96 flow [2023-08-26 20:23:38,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have 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:38,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:38,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 20:23:38,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 20:23:38,739 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 20:23:38,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:38,739 INFO L85 PathProgramCache]: Analyzing trace with hash 698610, now seen corresponding path program 1 times [2023-08-26 20:23:38,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:38,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030995671] [2023-08-26 20:23:38,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:38,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:38,797 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:38,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:38,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030995671] [2023-08-26 20:23:38,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030995671] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:38,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:38,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:23:38,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186786632] [2023-08-26 20:23:38,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:38,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:23:38,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:38,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:23:38,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:23:38,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 344 [2023-08-26 20:23:38,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have 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:38,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:38,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 344 [2023-08-26 20:23:38,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:38,984 INFO L124 PetriNetUnfolderBase]: 1408/2258 cut-off events. [2023-08-26 20:23:38,985 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-08-26 20:23:38,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4369 conditions, 2258 events. 1408/2258 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 11630 event pairs, 1128 based on Foata normal form. 0/1209 useless extension candidates. Maximal degree in co-relation 4365. Up to 2079 conditions per place. [2023-08-26 20:23:38,998 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 36 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-08-26 20:23:38,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 166 flow [2023-08-26 20:23:38,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-08-26 20:23:39,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42151162790697677 [2023-08-26 20:23:39,000 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-08-26 20:23:39,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-08-26 20:23:39,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:39,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-08-26 20:23:39,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:39,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:39,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:39,005 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 96 flow. Second operand 3 states and 435 transitions. [2023-08-26 20:23:39,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 166 flow [2023-08-26 20:23:39,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 165 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:23:39,006 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 93 flow [2023-08-26 20:23:39,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2023-08-26 20:23:39,007 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2023-08-26 20:23:39,007 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 93 flow [2023-08-26 20:23:39,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have 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:39,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:39,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 20:23:39,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 20:23:39,008 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 20:23:39,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:39,008 INFO L85 PathProgramCache]: Analyzing trace with hash 671354704, now seen corresponding path program 1 times [2023-08-26 20:23:39,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:39,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134665314] [2023-08-26 20:23:39,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:39,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:39,281 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:39,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:39,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134665314] [2023-08-26 20:23:39,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134665314] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:39,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:39,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:23:39,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35211159] [2023-08-26 20:23:39,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:39,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:23:39,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:39,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:23:39,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:23:39,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 344 [2023-08-26 20:23:39,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 93 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:39,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:39,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 344 [2023-08-26 20:23:39,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:39,618 INFO L124 PetriNetUnfolderBase]: 2169/3527 cut-off events. [2023-08-26 20:23:39,619 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-26 20:23:39,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6808 conditions, 3527 events. 2169/3527 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 18316 event pairs, 839 based on Foata normal form. 0/1942 useless extension candidates. Maximal degree in co-relation 6804. Up to 1933 conditions per place. [2023-08-26 20:23:39,638 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 63 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-26 20:23:39,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 286 flow [2023-08-26 20:23:39,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:39,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-26 20:23:39,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312015503875969 [2023-08-26 20:23:39,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-26 20:23:39,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-26 20:23:39,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:39,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-26 20:23:39,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have 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:39,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:39,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:39,647 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 93 flow. Second operand 3 states and 445 transitions. [2023-08-26 20:23:39,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 72 transitions, 286 flow [2023-08-26 20:23:39,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:23:39,650 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 117 flow [2023-08-26 20:23:39,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2023-08-26 20:23:39,651 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2023-08-26 20:23:39,651 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 117 flow [2023-08-26 20:23:39,652 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:39,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:39,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 20:23:39,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 20:23:39,652 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 20:23:39,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:39,653 INFO L85 PathProgramCache]: Analyzing trace with hash 671354706, now seen corresponding path program 1 times [2023-08-26 20:23:39,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:39,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814281244] [2023-08-26 20:23:39,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:39,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:39,789 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:39,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:39,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814281244] [2023-08-26 20:23:39,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814281244] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:39,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:39,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:23:39,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006520829] [2023-08-26 20:23:39,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:39,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:23:39,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:39,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:23:39,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:23:39,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 344 [2023-08-26 20:23:39,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have 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:39,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:39,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 344 [2023-08-26 20:23:39,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:40,018 INFO L124 PetriNetUnfolderBase]: 2005/3241 cut-off events. [2023-08-26 20:23:40,018 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2023-08-26 20:23:40,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6652 conditions, 3241 events. 2005/3241 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 16493 event pairs, 1535 based on Foata normal form. 0/1978 useless extension candidates. Maximal degree in co-relation 6647. Up to 2952 conditions per place. [2023-08-26 20:23:40,042 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 36 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-08-26 20:23:40,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 185 flow [2023-08-26 20:23:40,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-08-26 20:23:40,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41957364341085274 [2023-08-26 20:23:40,045 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-08-26 20:23:40,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-08-26 20:23:40,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:40,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-08-26 20:23:40,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have 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:40,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:40,049 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:40,050 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 117 flow. Second operand 3 states and 433 transitions. [2023-08-26 20:23:40,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 185 flow [2023-08-26 20:23:40,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:23:40,054 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 110 flow [2023-08-26 20:23:40,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2023-08-26 20:23:40,056 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-26 20:23:40,057 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 110 flow [2023-08-26 20:23:40,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have 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:40,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:40,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 20:23:40,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 20:23:40,057 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 20:23:40,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:40,058 INFO L85 PathProgramCache]: Analyzing trace with hash 671382345, now seen corresponding path program 1 times [2023-08-26 20:23:40,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:40,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015923036] [2023-08-26 20:23:40,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:40,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:40,162 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:40,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:40,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015923036] [2023-08-26 20:23:40,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015923036] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:40,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:40,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 20:23:40,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739140417] [2023-08-26 20:23:40,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:40,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 20:23:40,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:40,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 20:23:40,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 20:23:40,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 344 [2023-08-26 20:23:40,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have 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:40,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:40,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 344 [2023-08-26 20:23:40,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:40,389 INFO L124 PetriNetUnfolderBase]: 1472/2425 cut-off events. [2023-08-26 20:23:40,389 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2023-08-26 20:23:40,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4926 conditions, 2425 events. 1472/2425 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 11849 event pairs, 1114 based on Foata normal form. 0/1583 useless extension candidates. Maximal degree in co-relation 4921. Up to 2203 conditions per place. [2023-08-26 20:23:40,409 INFO L140 encePairwiseOnDemand]: 342/344 looper letters, 35 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2023-08-26 20:23:40,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 42 transitions, 180 flow [2023-08-26 20:23:40,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:40,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:40,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-26 20:23:40,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4118217054263566 [2023-08-26 20:23:40,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-26 20:23:40,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-26 20:23:40,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:40,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-26 20:23:40,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have 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:40,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:40,416 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:40,416 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 110 flow. Second operand 3 states and 425 transitions. [2023-08-26 20:23:40,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 42 transitions, 180 flow [2023-08-26 20:23:40,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 42 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:23:40,419 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 109 flow [2023-08-26 20:23:40,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=44, 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=109, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2023-08-26 20:23:40,422 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-26 20:23:40,422 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 109 flow [2023-08-26 20:23:40,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have 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:40,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:40,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 20:23:40,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 20:23:40,423 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 20:23:40,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:40,423 INFO L85 PathProgramCache]: Analyzing trace with hash 671382344, now seen corresponding path program 1 times [2023-08-26 20:23:40,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:40,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595564182] [2023-08-26 20:23:40,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:40,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:40,492 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:40,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:40,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595564182] [2023-08-26 20:23:40,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595564182] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:40,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:40,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 20:23:40,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822329582] [2023-08-26 20:23:40,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:40,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 20:23:40,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:40,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 20:23:40,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 20:23:40,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 344 [2023-08-26 20:23:40,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have 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:40,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:40,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 344 [2023-08-26 20:23:40,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:40,633 INFO L124 PetriNetUnfolderBase]: 939/1609 cut-off events. [2023-08-26 20:23:40,634 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-08-26 20:23:40,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 1609 events. 939/1609 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7549 event pairs, 693 based on Foata normal form. 0/1188 useless extension candidates. Maximal degree in co-relation 3279. Up to 1454 conditions per place. [2023-08-26 20:23:40,641 INFO L140 encePairwiseOnDemand]: 342/344 looper letters, 34 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-26 20:23:40,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 177 flow [2023-08-26 20:23:40,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-26 20:23:40,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40794573643410853 [2023-08-26 20:23:40,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-26 20:23:40,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-26 20:23:40,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:40,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-26 20:23:40,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have 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:40,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:40,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:40,647 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 109 flow. Second operand 3 states and 421 transitions. [2023-08-26 20:23:40,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 177 flow [2023-08-26 20:23:40,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:23:40,651 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 108 flow [2023-08-26 20:23:40,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-08-26 20:23:40,652 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-26 20:23:40,652 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 108 flow [2023-08-26 20:23:40,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have 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:40,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:40,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 20:23:40,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 20:23:40,653 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 20:23:40,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:40,654 INFO L85 PathProgramCache]: Analyzing trace with hash -662839985, now seen corresponding path program 1 times [2023-08-26 20:23:40,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:40,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435006705] [2023-08-26 20:23:40,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:40,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:40,764 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:40,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:40,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435006705] [2023-08-26 20:23:40,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435006705] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:40,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:40,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 20:23:40,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235161259] [2023-08-26 20:23:40,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:40,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:23:40,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:40,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:23:40,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:23:40,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 344 [2023-08-26 20:23:40,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 108 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:40,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:40,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 344 [2023-08-26 20:23:40,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:40,913 INFO L124 PetriNetUnfolderBase]: 765/1333 cut-off events. [2023-08-26 20:23:40,913 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-08-26 20:23:40,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2737 conditions, 1333 events. 765/1333 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5965 event pairs, 247 based on Foata normal form. 0/1012 useless extension candidates. Maximal degree in co-relation 2732. Up to 793 conditions per place. [2023-08-26 20:23:40,919 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 53 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-26 20:23:40,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 259 flow [2023-08-26 20:23:40,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2023-08-26 20:23:40,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47093023255813954 [2023-08-26 20:23:40,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2023-08-26 20:23:40,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2023-08-26 20:23:40,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:40,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2023-08-26 20:23:40,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have 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:40,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:40,925 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:40,926 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 108 flow. Second operand 3 states and 486 transitions. [2023-08-26 20:23:40,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 259 flow [2023-08-26 20:23:40,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:23:40,927 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 111 flow [2023-08-26 20:23:40,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-26 20:23:40,928 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-26 20:23:40,928 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 111 flow [2023-08-26 20:23:40,928 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:40,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:40,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:23:40,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 20:23:40,929 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 20:23:40,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:40,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1334678534, now seen corresponding path program 1 times [2023-08-26 20:23:40,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:40,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345291571] [2023-08-26 20:23:40,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:40,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:40,942 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 20:23:40,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [261545173] [2023-08-26 20:23:40,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:40,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:40,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:23:40,949 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:40,957 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:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:41,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-26 20:23:41,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:23:41,095 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:41,095 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 20:23:41,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:41,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345291571] [2023-08-26 20:23:41,096 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 20:23:41,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261545173] [2023-08-26 20:23:41,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261545173] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:41,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:41,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 20:23:41,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253261645] [2023-08-26 20:23:41,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:41,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 20:23:41,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:41,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 20:23:41,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 20:23:41,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 344 [2023-08-26 20:23:41,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have 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:41,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:41,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 344 [2023-08-26 20:23:41,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:41,338 INFO L124 PetriNetUnfolderBase]: 847/1490 cut-off events. [2023-08-26 20:23:41,339 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2023-08-26 20:23:41,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3104 conditions, 1490 events. 847/1490 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 7210 event pairs, 293 based on Foata normal form. 0/1176 useless extension candidates. Maximal degree in co-relation 3098. Up to 657 conditions per place. [2023-08-26 20:23:41,345 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 61 selfloop transitions, 7 changer transitions 0/74 dead transitions. [2023-08-26 20:23:41,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 74 transitions, 327 flow [2023-08-26 20:23:41,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 20:23:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 20:23:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 624 transitions. [2023-08-26 20:23:41,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45348837209302323 [2023-08-26 20:23:41,348 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 624 transitions. [2023-08-26 20:23:41,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 624 transitions. [2023-08-26 20:23:41,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:41,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 624 transitions. [2023-08-26 20:23:41,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:41,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have 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:41,354 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have 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:41,354 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 111 flow. Second operand 4 states and 624 transitions. [2023-08-26 20:23:41,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 74 transitions, 327 flow [2023-08-26 20:23:41,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 20:23:41,357 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 141 flow [2023-08-26 20:23:41,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-08-26 20:23:41,358 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-26 20:23:41,358 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 141 flow [2023-08-26 20:23:41,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have 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:41,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:41,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:23:41,367 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:41,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:41,564 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 20:23:41,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:41,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1345657928, now seen corresponding path program 1 times [2023-08-26 20:23:41,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:41,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327199325] [2023-08-26 20:23:41,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:41,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:41,613 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:41,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:41,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327199325] [2023-08-26 20:23:41,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327199325] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:41,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:41,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 20:23:41,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949884644] [2023-08-26 20:23:41,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:41,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:23:41,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:41,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:23:41,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:23:41,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 344 [2023-08-26 20:23:41,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have 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:41,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:41,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 344 [2023-08-26 20:23:41,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:41,795 INFO L124 PetriNetUnfolderBase]: 1040/1768 cut-off events. [2023-08-26 20:23:41,795 INFO L125 PetriNetUnfolderBase]: For 815/815 co-relation queries the response was YES. [2023-08-26 20:23:41,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4236 conditions, 1768 events. 1040/1768 cut-off events. For 815/815 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7933 event pairs, 445 based on Foata normal form. 0/1479 useless extension candidates. Maximal degree in co-relation 4228. Up to 1048 conditions per place. [2023-08-26 20:23:41,803 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 57 selfloop transitions, 3 changer transitions 3/67 dead transitions. [2023-08-26 20:23:41,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 354 flow [2023-08-26 20:23:41,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:41,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2023-08-26 20:23:41,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49612403100775193 [2023-08-26 20:23:41,806 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2023-08-26 20:23:41,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2023-08-26 20:23:41,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:41,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2023-08-26 20:23:41,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have 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:41,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:41,810 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:41,810 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 141 flow. Second operand 3 states and 512 transitions. [2023-08-26 20:23:41,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 354 flow [2023-08-26 20:23:41,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:23:41,813 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 152 flow [2023-08-26 20:23:41,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-08-26 20:23:41,813 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2023-08-26 20:23:41,814 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 152 flow [2023-08-26 20:23:41,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have 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:41,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:41,814 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:23:41,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 20:23:41,814 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 20:23:41,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:41,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1393609373, now seen corresponding path program 1 times [2023-08-26 20:23:41,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:41,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798651580] [2023-08-26 20:23:41,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:41,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:41,827 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 20:23:41,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1773668129] [2023-08-26 20:23:41,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:41,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:41,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:23:41,829 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:41,831 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:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:41,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-26 20:23:41,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:23:41,994 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:41,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:23:42,007 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:42,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:42,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798651580] [2023-08-26 20:23:42,007 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 20:23:42,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773668129] [2023-08-26 20:23:42,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773668129] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-26 20:23:42,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 20:23:42,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2023-08-26 20:23:42,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559995084] [2023-08-26 20:23:42,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:42,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:23:42,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:42,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:23:42,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:23:42,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 344 [2023-08-26 20:23:42,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have 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:42,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:42,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 344 [2023-08-26 20:23:42,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:42,148 INFO L124 PetriNetUnfolderBase]: 648/1175 cut-off events. [2023-08-26 20:23:42,149 INFO L125 PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES. [2023-08-26 20:23:42,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2627 conditions, 1175 events. 648/1175 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5050 event pairs, 273 based on Foata normal form. 118/1102 useless extension candidates. Maximal degree in co-relation 2618. Up to 637 conditions per place. [2023-08-26 20:23:42,154 INFO L140 encePairwiseOnDemand]: 338/344 looper letters, 45 selfloop transitions, 3 changer transitions 4/56 dead transitions. [2023-08-26 20:23:42,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 56 transitions, 287 flow [2023-08-26 20:23:42,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:42,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:42,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2023-08-26 20:23:42,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883720930232558 [2023-08-26 20:23:42,156 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2023-08-26 20:23:42,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2023-08-26 20:23:42,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:42,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2023-08-26 20:23:42,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:23:42,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:42,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:42,160 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 152 flow. Second operand 3 states and 504 transitions. [2023-08-26 20:23:42,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 56 transitions, 287 flow [2023-08-26 20:23:42,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 277 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 20:23:42,162 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 158 flow [2023-08-26 20:23:42,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-26 20:23:42,163 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2023-08-26 20:23:42,163 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 158 flow [2023-08-26 20:23:42,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have 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:42,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:42,164 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:42,171 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:42,368 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,SelfDestructingSolverStorable10 [2023-08-26 20:23:42,368 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 20:23:42,369 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:42,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1612164136, now seen corresponding path program 1 times [2023-08-26 20:23:42,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:42,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905422999] [2023-08-26 20:23:42,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:42,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:42,384 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 20:23:42,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1371473608] [2023-08-26 20:23:42,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:42,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:42,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:23:42,386 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:42,388 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:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:42,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 20:23:42,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:23:42,526 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 20:23:42,539 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:42,539 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 20:23:42,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:42,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905422999] [2023-08-26 20:23:42,540 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 20:23:42,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371473608] [2023-08-26 20:23:42,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371473608] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:42,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:42,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 20:23:42,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532055508] [2023-08-26 20:23:42,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:42,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:23:42,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:42,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:23:42,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:23:42,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 344 [2023-08-26 20:23:42,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have 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:42,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:42,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 344 [2023-08-26 20:23:42,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:42,698 INFO L124 PetriNetUnfolderBase]: 588/1089 cut-off events. [2023-08-26 20:23:42,698 INFO L125 PetriNetUnfolderBase]: For 218/218 co-relation queries the response was YES. [2023-08-26 20:23:42,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2529 conditions, 1089 events. 588/1089 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4781 event pairs, 184 based on Foata normal form. 0/967 useless extension candidates. Maximal degree in co-relation 2519. Up to 602 conditions per place. [2023-08-26 20:23:42,702 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 45 selfloop transitions, 4 changer transitions 1/54 dead transitions. [2023-08-26 20:23:42,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 289 flow [2023-08-26 20:23:42,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2023-08-26 20:23:42,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46124031007751937 [2023-08-26 20:23:42,704 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 476 transitions. [2023-08-26 20:23:42,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 476 transitions. [2023-08-26 20:23:42,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:42,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 476 transitions. [2023-08-26 20:23:42,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have 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:42,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:42,708 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:42,708 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 158 flow. Second operand 3 states and 476 transitions. [2023-08-26 20:23:42,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 289 flow [2023-08-26 20:23:42,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 20:23:42,711 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 156 flow [2023-08-26 20:23:42,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2023-08-26 20:23:42,711 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-08-26 20:23:42,711 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 156 flow [2023-08-26 20:23:42,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have 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:42,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:42,712 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:42,719 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:42,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:42,917 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 20:23:42,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:42,917 INFO L85 PathProgramCache]: Analyzing trace with hash 81236526, now seen corresponding path program 1 times [2023-08-26 20:23:42,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:42,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350860421] [2023-08-26 20:23:42,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:42,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:42,938 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 20:23:42,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1030012167] [2023-08-26 20:23:42,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:42,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:42,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:23:42,939 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:42,963 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:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:43,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-26 20:23:43,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:23:43,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:23:43,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:23:43,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:23:43,128 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-26 20:23:43,238 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:43,238 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 20:23:43,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:43,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350860421] [2023-08-26 20:23:43,239 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 20:23:43,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030012167] [2023-08-26 20:23:43,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030012167] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:43,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:43,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:23:43,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89881688] [2023-08-26 20:23:43,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:43,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:23:43,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:43,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:23:43,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:23:43,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 344 [2023-08-26 20:23:43,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have 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:43,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:43,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 344 [2023-08-26 20:23:43,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:43,390 INFO L124 PetriNetUnfolderBase]: 647/1250 cut-off events. [2023-08-26 20:23:43,391 INFO L125 PetriNetUnfolderBase]: For 432/436 co-relation queries the response was YES. [2023-08-26 20:23:43,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2999 conditions, 1250 events. 647/1250 cut-off events. For 432/436 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5385 event pairs, 360 based on Foata normal form. 0/1183 useless extension candidates. Maximal degree in co-relation 2989. Up to 633 conditions per place. [2023-08-26 20:23:43,399 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 60 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-26 20:23:43,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 380 flow [2023-08-26 20:23:43,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:23:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:23:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-26 20:23:43,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312015503875969 [2023-08-26 20:23:43,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-26 20:23:43,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-26 20:23:43,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:43,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-26 20:23:43,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have 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:43,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:43,404 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have 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:43,404 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 156 flow. Second operand 3 states and 445 transitions. [2023-08-26 20:23:43,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 380 flow [2023-08-26 20:23:43,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 374 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:23:43,408 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 164 flow [2023-08-26 20:23:43,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-08-26 20:23:43,408 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2023-08-26 20:23:43,408 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 164 flow [2023-08-26 20:23:43,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have 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:43,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:43,409 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:43,415 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:43,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:43,614 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 20:23:43,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:43,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1246773146, now seen corresponding path program 1 times [2023-08-26 20:23:43,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:43,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300718461] [2023-08-26 20:23:43,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:43,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:43,628 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 20:23:43,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828246105] [2023-08-26 20:23:43,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:43,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:43,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:23:43,630 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:43,632 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:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:43,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-26 20:23:43,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:23:44,074 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:44,074 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 20:23:44,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:44,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300718461] [2023-08-26 20:23:44,074 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 20:23:44,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828246105] [2023-08-26 20:23:44,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828246105] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:44,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:44,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 20:23:44,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663217090] [2023-08-26 20:23:44,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:44,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 20:23:44,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:44,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 20:23:44,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 20:23:44,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 344 [2023-08-26 20:23:44,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have 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:44,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:44,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 344 [2023-08-26 20:23:44,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:44,226 INFO L124 PetriNetUnfolderBase]: 488/963 cut-off events. [2023-08-26 20:23:44,226 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2023-08-26 20:23:44,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 963 events. 488/963 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3773 event pairs, 161 based on Foata normal form. 0/936 useless extension candidates. Maximal degree in co-relation 2264. Up to 454 conditions per place. [2023-08-26 20:23:44,230 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 55 selfloop transitions, 3 changer transitions 5/69 dead transitions. [2023-08-26 20:23:44,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 368 flow [2023-08-26 20:23:44,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 20:23:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 20:23:44,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 613 transitions. [2023-08-26 20:23:44,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44549418604651164 [2023-08-26 20:23:44,233 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 613 transitions. [2023-08-26 20:23:44,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 613 transitions. [2023-08-26 20:23:44,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:44,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 613 transitions. [2023-08-26 20:23:44,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 153.25) internal successors, (613), 4 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have 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:44,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have 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:44,239 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have 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:44,239 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 164 flow. Second operand 4 states and 613 transitions. [2023-08-26 20:23:44,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 368 flow [2023-08-26 20:23:44,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 366 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:23:44,242 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 172 flow [2023-08-26 20:23:44,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2023-08-26 20:23:44,243 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2023-08-26 20:23:44,243 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 172 flow [2023-08-26 20:23:44,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have 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:44,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:44,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:23:44,251 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:44,449 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,SelfDestructingSolverStorable13 [2023-08-26 20:23:44,449 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 20:23:44,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:44,449 INFO L85 PathProgramCache]: Analyzing trace with hash -4811213, now seen corresponding path program 1 times [2023-08-26 20:23:44,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:44,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934665878] [2023-08-26 20:23:44,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:44,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:44,464 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 20:23:44,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1894513485] [2023-08-26 20:23:44,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:44,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:44,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:23:44,466 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:44,493 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:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:44,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-26 20:23:44,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:23:44,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:23:44,792 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:44,806 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 20:23:44,807 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:44,860 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:44,921 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:45,012 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 51 treesize of output 45 [2023-08-26 20:23:45,079 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:45,080 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 20:23:45,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:45,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934665878] [2023-08-26 20:23:45,080 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 20:23:45,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894513485] [2023-08-26 20:23:45,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894513485] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:23:45,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:23:45,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 20:23:45,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301921854] [2023-08-26 20:23:45,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:23:45,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 20:23:45,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:45,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 20:23:45,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 20:23:45,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 344 [2023-08-26 20:23:45,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 172 flow. Second operand has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have 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:45,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:45,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 344 [2023-08-26 20:23:45,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:45,546 INFO L124 PetriNetUnfolderBase]: 821/1596 cut-off events. [2023-08-26 20:23:45,546 INFO L125 PetriNetUnfolderBase]: For 545/549 co-relation queries the response was YES. [2023-08-26 20:23:45,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3802 conditions, 1596 events. 821/1596 cut-off events. For 545/549 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 7074 event pairs, 305 based on Foata normal form. 12/1568 useless extension candidates. Maximal degree in co-relation 3789. Up to 456 conditions per place. [2023-08-26 20:23:45,554 INFO L140 encePairwiseOnDemand]: 334/344 looper letters, 94 selfloop transitions, 12 changer transitions 6/118 dead transitions. [2023-08-26 20:23:45,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 118 transitions, 646 flow [2023-08-26 20:23:45,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 20:23:45,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 20:23:45,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 968 transitions. [2023-08-26 20:23:45,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35174418604651164 [2023-08-26 20:23:45,557 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 968 transitions. [2023-08-26 20:23:45,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 968 transitions. [2023-08-26 20:23:45,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:45,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 968 transitions. [2023-08-26 20:23:45,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have 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:45,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 344.0) internal successors, (3096), 9 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have 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:45,564 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 344.0) internal successors, (3096), 9 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have 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:45,564 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 172 flow. Second operand 8 states and 968 transitions. [2023-08-26 20:23:45,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 118 transitions, 646 flow [2023-08-26 20:23:45,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 118 transitions, 638 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 20:23:45,569 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 266 flow [2023-08-26 20:23:45,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=266, PETRI_PLACES=69, PETRI_TRANSITIONS=51} [2023-08-26 20:23:45,570 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2023-08-26 20:23:45,570 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 266 flow [2023-08-26 20:23:45,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have 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:45,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:45,570 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, 1, 1, 1] [2023-08-26 20:23:45,581 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:45,780 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,SelfDestructingSolverStorable14 [2023-08-26 20:23:45,780 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 20:23:45,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:45,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1472832504, now seen corresponding path program 1 times [2023-08-26 20:23:45,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:45,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165974647] [2023-08-26 20:23:45,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:45,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:45,796 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 20:23:45,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1430431977] [2023-08-26 20:23:45,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:45,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:45,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:23:45,797 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:45,800 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:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:45,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-26 20:23:45,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:23:46,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:23:46,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:23:46,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:23:46,014 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-26 20:23:46,203 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:46,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:23:46,774 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:46,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:46,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165974647] [2023-08-26 20:23:46,775 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 20:23:46,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430431977] [2023-08-26 20:23:46,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430431977] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:23:46,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-26 20:23:46,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2023-08-26 20:23:46,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313542455] [2023-08-26 20:23:46,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-26 20:23:46,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 20:23:46,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:46,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 20:23:46,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-26 20:23:46,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 344 [2023-08-26 20:23:46,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 51 transitions, 266 flow. Second operand has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have 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:46,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:46,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 344 [2023-08-26 20:23:46,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:47,013 INFO L124 PetriNetUnfolderBase]: 623/1222 cut-off events. [2023-08-26 20:23:47,013 INFO L125 PetriNetUnfolderBase]: For 1211/1217 co-relation queries the response was YES. [2023-08-26 20:23:47,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3267 conditions, 1222 events. 623/1222 cut-off events. For 1211/1217 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4961 event pairs, 306 based on Foata normal form. 58/1274 useless extension candidates. Maximal degree in co-relation 3248. Up to 651 conditions per place. [2023-08-26 20:23:47,019 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 49 selfloop transitions, 3 changer transitions 2/60 dead transitions. [2023-08-26 20:23:47,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 60 transitions, 405 flow [2023-08-26 20:23:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 20:23:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 20:23:47,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-08-26 20:23:47,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39316860465116277 [2023-08-26 20:23:47,022 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-08-26 20:23:47,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-08-26 20:23:47,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:47,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-08-26 20:23:47,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have 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:47,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have 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:47,026 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have 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:47,026 INFO L175 Difference]: Start difference. First operand has 69 places, 51 transitions, 266 flow. Second operand 4 states and 541 transitions. [2023-08-26 20:23:47,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 60 transitions, 405 flow [2023-08-26 20:23:47,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 387 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-26 20:23:47,031 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 219 flow [2023-08-26 20:23:47,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2023-08-26 20:23:47,031 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2023-08-26 20:23:47,031 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 219 flow [2023-08-26 20:23:47,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have 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:47,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:47,032 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:23:47,043 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:47,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:47,237 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 20:23:47,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:47,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1003607629, now seen corresponding path program 1 times [2023-08-26 20:23:47,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:47,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094113260] [2023-08-26 20:23:47,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:47,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:47,255 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 20:23:47,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [364621537] [2023-08-26 20:23:47,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:47,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:47,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:23:47,257 INFO L229 MonitoredProcess]: Starting monitored process 9 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:47,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-26 20:23:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:47,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-26 20:23:47,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:23:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:23:47,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:23:48,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:23:48,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:23:48,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094113260] [2023-08-26 20:23:48,517 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 20:23:48,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364621537] [2023-08-26 20:23:48,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364621537] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:23:48,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-26 20:23:48,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-08-26 20:23:48,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727687451] [2023-08-26 20:23:48,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-26 20:23:48,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 20:23:48,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:23:48,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 20:23:48,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-08-26 20:23:48,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 344 [2023-08-26 20:23:48,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 219 flow. Second operand has 12 states, 12 states have (on average 140.58333333333334) internal successors, (1687), 12 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have 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:48,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:23:48,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 344 [2023-08-26 20:23:48,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:23:49,882 INFO L124 PetriNetUnfolderBase]: 738/1503 cut-off events. [2023-08-26 20:23:49,882 INFO L125 PetriNetUnfolderBase]: For 1161/1161 co-relation queries the response was YES. [2023-08-26 20:23:49,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3946 conditions, 1503 events. 738/1503 cut-off events. For 1161/1161 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5298 event pairs, 160 based on Foata normal form. 20/1523 useless extension candidates. Maximal degree in co-relation 3929. Up to 419 conditions per place. [2023-08-26 20:23:49,890 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 105 selfloop transitions, 11 changer transitions 7/129 dead transitions. [2023-08-26 20:23:49,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 129 transitions, 790 flow [2023-08-26 20:23:49,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 20:23:49,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 20:23:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1473 transitions. [2023-08-26 20:23:49,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281976744186046 [2023-08-26 20:23:49,895 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1473 transitions. [2023-08-26 20:23:49,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1473 transitions. [2023-08-26 20:23:49,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:23:49,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1473 transitions. [2023-08-26 20:23:49,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 147.3) internal successors, (1473), 10 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have 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:49,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 344.0) internal successors, (3784), 11 states have internal predecessors, (3784), 0 states have call successors, (0), 0 states have 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:49,905 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 344.0) internal successors, (3784), 11 states have internal predecessors, (3784), 0 states have call successors, (0), 0 states have 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:49,905 INFO L175 Difference]: Start difference. First operand has 63 places, 43 transitions, 219 flow. Second operand 10 states and 1473 transitions. [2023-08-26 20:23:49,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 129 transitions, 790 flow [2023-08-26 20:23:49,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 129 transitions, 775 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-26 20:23:49,911 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 276 flow [2023-08-26 20:23:49,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=276, PETRI_PLACES=71, PETRI_TRANSITIONS=49} [2023-08-26 20:23:49,911 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2023-08-26 20:23:49,911 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 276 flow [2023-08-26 20:23:49,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 140.58333333333334) internal successors, (1687), 12 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have 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:49,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:23:49,924 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:23:49,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-26 20:23:50,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-26 20:23:50,125 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 20:23:50,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:23:50,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2005504330, now seen corresponding path program 1 times [2023-08-26 20:23:50,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:23:50,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167426700] [2023-08-26 20:23:50,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:50,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:23:50,144 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 20:23:50,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [392945712] [2023-08-26 20:23:50,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:23:50,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:23:50,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:23:50,147 INFO L229 MonitoredProcess]: Starting monitored process 10 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:50,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-26 20:23:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:23:50,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 76 conjunts are in the unsatisfiable core [2023-08-26 20:23:50,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:23:50,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:23:50,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:23:50,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:23:50,507 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-26 20:23:50,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 20:23:50,513 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:50,527 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 20:23:50,527 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:50,643 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:50,741 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 18 treesize of output 13 [2023-08-26 20:23:52,412 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 74 treesize of output 65 [2023-08-26 20:23:53,032 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 24 treesize of output 20 [2023-08-26 20:23:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:23:53,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:24:28,001 WARN L234 SmtUtils]: Spent 24.30s on a formula simplification that was a NOOP. DAG size: 119 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 20:24:58,788 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#length| |c_~#buffer~0.base|)) (.cse4 (mod (+ c_~first~0 1) 4294967296)) (.cse7 (mod c_~next~0 4294967296))) (let ((.cse8 (< 2147483647 .cse7)) (.cse6 (+ .cse7 |c_~#buffer~0.offset|)) (.cse2 (<= .cse4 2147483647)) (.cse0 (+ .cse3 4294967295)) (.cse5 (<= .cse7 2147483647)) (.cse22 (< 2147483647 .cse4)) (.cse1 (+ |c_~#buffer~0.offset| .cse4))) (or (and (or (< .cse0 .cse1) .cse2) (< .cse3 (+ |c_~#buffer~0.offset| .cse4 1))) (and (or .cse5 (< .cse0 .cse6)) (< .cse3 (+ .cse7 |c_~#buffer~0.offset| 1))) (and (< .cse6 4294967296) (or .cse8 (< .cse6 0))) (let ((.cse13 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1))) (let ((.cse39 (mod .cse13 256)) (.cse87 (mod c_~first~0 4294967296))) (let ((.cse21 (+ |c_~#buffer~0.offset| .cse87 (- 4294967296))) (.cse18 (<= .cse87 2147483647)) (.cse17 (< 2147483647 .cse87)) (.cse9 (<= .cse39 127)) (.cse12 (+ (- 256) .cse39)) (.cse36 (< 127 .cse39)) (.cse14 (+ |c_~#buffer~0.offset| .cse87)) (.cse29 (+ |c_~#buffer~0.offset| .cse4 (- 4294967296))) (.cse15 (mod (+ c_~next~0 1) 4294967296)) (.cse16 (select |c_#memory_int| |c_~#buffer~0.base|))) (and (or .cse8 (and (or .cse9 (and (or (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse10 (store .cse16 .cse6 v_ArrVal_819)) (.cse11 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse10 (+ |c_~#buffer~0.offset| (- 4294967296) .cse11) .cse12) .cse1) .cse13) (not (= (select .cse10 .cse14) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= .cse11 2147483647) (<= v_z_29 .cse11)))) .cse17) (or .cse18 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse19 (store .cse16 .cse6 v_ArrVal_819)) (.cse20 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse19 (+ |c_~#buffer~0.offset| (- 4294967296) .cse20) .cse12) .cse1) .cse13) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse19 .cse21))) (<= .cse20 2147483647) (<= v_z_29 .cse20)))))) .cse22) (or (and (or .cse17 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse23 (store .cse16 .cse6 v_ArrVal_819)) (.cse24 (mod (mod .cse15 v_z_29) 4294967296))) (or (= (select (store .cse23 (+ |c_~#buffer~0.offset| .cse24) .cse12) .cse1) .cse13) (<= 4294967296 v_z_29) (not (= (select .cse23 .cse14) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= .cse24 0) (<= v_z_29 .cse4) (< 2147483647 .cse24) (< .cse3 (+ |c_~#buffer~0.offset| .cse24 1)))))) (or .cse18 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse25 (store .cse16 .cse6 v_ArrVal_819)) (.cse26 (mod (mod .cse15 v_z_29) 4294967296))) (or (= (select (store .cse25 (+ |c_~#buffer~0.offset| .cse26) .cse12) .cse1) .cse13) (<= 4294967296 v_z_29) (<= .cse26 0) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse25 .cse21))) (<= v_z_29 .cse4) (< 2147483647 .cse26) (< .cse3 (+ |c_~#buffer~0.offset| .cse26 1))))))) .cse22) (or (and (or .cse17 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse27 (store .cse16 .cse6 v_ArrVal_819)) (.cse28 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse27 (+ |c_~#buffer~0.offset| (- 4294967296) .cse28) .cse12) .cse29) .cse13) (not (= (select .cse27 .cse14) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= v_z_29 .cse4) (<= .cse28 2147483647))))) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse30 (store .cse16 .cse6 v_ArrVal_819)) (.cse31 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse30 (+ |c_~#buffer~0.offset| (- 4294967296) .cse31) .cse12) .cse29) .cse13) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse30 .cse21))) (<= v_z_29 .cse4) (<= .cse31 2147483647)))) .cse18)) .cse2) (or (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse32 (store .cse16 .cse6 v_ArrVal_819)) (.cse33 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse32 .cse21))) (<= v_z_29 .cse4) (< 2147483647 .cse33) (= (select (store .cse32 (+ |c_~#buffer~0.offset| .cse33) .cse12) .cse29) .cse13) (< .cse3 (+ |c_~#buffer~0.offset| .cse33 1))))) .cse18) (or .cse17 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse34 (store .cse16 .cse6 v_ArrVal_819)) (.cse35 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse34 .cse14) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= v_z_29 .cse4) (< 2147483647 .cse35) (= (select (store .cse34 (+ |c_~#buffer~0.offset| .cse35) .cse12) .cse29) .cse13) (< .cse3 (+ |c_~#buffer~0.offset| .cse35 1))))))) .cse2))) (or .cse36 (and (or (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse37 (store .cse16 .cse6 v_ArrVal_819)) (.cse38 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= .cse13 (select (store .cse37 (+ |c_~#buffer~0.offset| (- 4294967296) .cse38) .cse39) .cse1)) (not (= (select .cse37 .cse14) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= .cse38 2147483647) (<= v_z_29 .cse38)))) .cse17) (or .cse18 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse40 (store .cse16 .cse6 v_ArrVal_819)) (.cse41 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= .cse13 (select (store .cse40 (+ |c_~#buffer~0.offset| (- 4294967296) .cse41) .cse39) .cse1)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse40 .cse21))) (<= .cse41 2147483647) (<= v_z_29 .cse41)))))) .cse22) (or .cse2 (and (or .cse17 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse42 (store .cse16 .cse6 v_ArrVal_819)) (.cse43 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse42 (+ |c_~#buffer~0.offset| (- 4294967296) .cse43) .cse39) .cse29) .cse13) (not (= (select .cse42 .cse14) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= v_z_29 .cse4) (<= .cse43 2147483647))))) (or .cse18 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse44 (store .cse16 .cse6 v_ArrVal_819)) (.cse45 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse44 (+ |c_~#buffer~0.offset| (- 4294967296) .cse45) .cse39) .cse29) .cse13) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse44 .cse21))) (<= v_z_29 .cse4) (<= .cse45 2147483647))))))) (or (and (or .cse18 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse47 (store .cse16 .cse6 v_ArrVal_819)) (.cse46 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (<= .cse46 0) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse47 .cse21))) (<= v_z_29 .cse4) (< 2147483647 .cse46) (= .cse13 (select (store .cse47 (+ |c_~#buffer~0.offset| .cse46) .cse39) .cse1)) (< .cse3 (+ |c_~#buffer~0.offset| .cse46 1)))))) (or .cse17 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse48 (store .cse16 .cse6 v_ArrVal_819)) (.cse49 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse48 .cse14) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= .cse49 0) (<= v_z_29 .cse4) (< 2147483647 .cse49) (= .cse13 (select (store .cse48 (+ |c_~#buffer~0.offset| .cse49) .cse39) .cse1)) (< .cse3 (+ |c_~#buffer~0.offset| .cse49 1))))))) .cse22) (or (and (or .cse17 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse50 (store .cse16 .cse6 v_ArrVal_819)) (.cse51 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse50 .cse14) |c_t1Thread1of1ForFork1_~i~0#1|)) (= .cse13 (select (store .cse50 (+ |c_~#buffer~0.offset| .cse51) .cse39) .cse29)) (<= v_z_29 .cse4) (< 2147483647 .cse51) (< .cse3 (+ |c_~#buffer~0.offset| .cse51 1)))))) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse52 (store .cse16 .cse6 v_ArrVal_819)) (.cse53 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= .cse13 (select (store .cse52 (+ |c_~#buffer~0.offset| .cse53) .cse39) .cse29)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse52 .cse21))) (<= v_z_29 .cse4) (< 2147483647 .cse53) (< .cse3 (+ |c_~#buffer~0.offset| .cse53 1))))) .cse18)) .cse2))))) (or (let ((.cse56 (+ .cse7 |c_~#buffer~0.offset| (- 4294967296)))) (and (or (and (or (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse54 (store .cse16 .cse56 v_ArrVal_819)) (.cse55 (mod (mod .cse15 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse54 .cse21))) (<= .cse55 0) (<= v_z_29 .cse4) (< 2147483647 .cse55) (= (select (store .cse54 (+ |c_~#buffer~0.offset| .cse55) .cse39) .cse29) .cse13) (< .cse3 (+ |c_~#buffer~0.offset| .cse55 1))))) .cse2) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse57 (store .cse16 .cse56 v_ArrVal_819)) (.cse58 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse57 (+ |c_~#buffer~0.offset| (- 4294967296) .cse58) .cse39) .cse1) .cse13) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse57 .cse21))) (<= .cse58 2147483647) (<= v_z_29 .cse58)))) .cse22) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse60 (store .cse16 .cse56 v_ArrVal_819)) (.cse59 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (< .cse0 (+ |c_~#buffer~0.offset| .cse59)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse60 .cse21))) (<= v_z_29 .cse4) (<= .cse59 2147483647) (= (select (store .cse60 (+ |c_~#buffer~0.offset| (- 4294967296) .cse59) .cse39) .cse29) .cse13)))) .cse2) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse61 (store .cse16 .cse56 v_ArrVal_819)) (.cse62 (mod (mod .cse15 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse61 .cse21))) (<= .cse62 0) (= .cse13 (select (store .cse61 (+ |c_~#buffer~0.offset| .cse62) .cse39) .cse1)) (<= v_z_29 .cse4) (< 2147483647 .cse62) (< .cse3 (+ |c_~#buffer~0.offset| .cse62 1))))) .cse22)) .cse36) (or .cse9 (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse64 (store .cse16 .cse56 v_ArrVal_819)) (.cse63 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (< .cse0 (+ |c_~#buffer~0.offset| .cse63)) (= .cse13 (select (store .cse64 (+ |c_~#buffer~0.offset| (- 4294967296) .cse63) .cse12) .cse29)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse64 .cse21))) (<= v_z_29 .cse4) (<= .cse63 2147483647)))) .cse2) (or .cse22 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse65 (store .cse16 .cse56 v_ArrVal_819)) (.cse66 (mod (mod .cse15 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse65 .cse21))) (<= .cse66 0) (= (select (store .cse65 (+ |c_~#buffer~0.offset| .cse66) .cse12) .cse1) .cse13) (<= v_z_29 .cse4) (< 2147483647 .cse66) (< .cse3 (+ |c_~#buffer~0.offset| .cse66 1)))))) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse67 (store .cse16 .cse56 v_ArrVal_819)) (.cse68 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse67 .cse21))) (= (select (store .cse67 (+ |c_~#buffer~0.offset| (- 4294967296) .cse68) .cse12) .cse1) .cse13) (<= .cse68 2147483647) (<= v_z_29 .cse68)))) .cse22) (or .cse2 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse69 (store .cse16 .cse56 v_ArrVal_819)) (.cse70 (mod (mod .cse15 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse69 .cse21))) (<= .cse70 0) (= (select (store .cse69 (+ |c_~#buffer~0.offset| .cse70) .cse12) .cse29) .cse13) (<= v_z_29 .cse4) (< 2147483647 .cse70) (< .cse3 (+ |c_~#buffer~0.offset| .cse70 1))))))))) .cse18) (or .cse17 (and (or .cse9 (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse71 (store .cse16 .cse56 v_ArrVal_819)) (.cse72 (mod (mod .cse15 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse71 .cse14))) (<= .cse72 0) (= (select (store .cse71 (+ |c_~#buffer~0.offset| .cse72) .cse12) .cse1) .cse13) (<= v_z_29 .cse4) (< 2147483647 .cse72) (< .cse3 (+ |c_~#buffer~0.offset| .cse72 1))))) .cse22) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse73 (store .cse16 .cse56 v_ArrVal_819)) (.cse74 (mod (mod .cse15 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse73 .cse14))) (<= .cse74 0) (= (select (store .cse73 (+ |c_~#buffer~0.offset| .cse74) .cse12) .cse29) .cse13) (<= v_z_29 .cse4) (< 2147483647 .cse74) (< .cse3 (+ |c_~#buffer~0.offset| .cse74 1))))) .cse2) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse75 (store .cse16 .cse56 v_ArrVal_819)) (.cse76 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse75 .cse14))) (= (select (store .cse75 (+ |c_~#buffer~0.offset| (- 4294967296) .cse76) .cse12) .cse1) .cse13) (<= .cse76 2147483647) (<= v_z_29 .cse76)))) .cse22) (or .cse2 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse78 (store .cse16 .cse56 v_ArrVal_819)) (.cse77 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (< .cse0 (+ |c_~#buffer~0.offset| .cse77)) (= .cse13 (select (store .cse78 (+ |c_~#buffer~0.offset| (- 4294967296) .cse77) .cse12) .cse29)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse78 .cse14))) (<= v_z_29 .cse4) (<= .cse77 2147483647))))))) (or .cse36 (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse79 (store .cse16 .cse56 v_ArrVal_819)) (.cse80 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse79 (+ |c_~#buffer~0.offset| (- 4294967296) .cse80) .cse39) .cse1) .cse13) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse79 .cse14))) (<= .cse80 2147483647) (<= v_z_29 .cse80)))) .cse22) (or .cse2 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse81 (store .cse16 .cse56 v_ArrVal_819)) (.cse82 (mod (mod .cse15 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse81 .cse14))) (<= .cse82 0) (<= v_z_29 .cse4) (< 2147483647 .cse82) (= (select (store .cse81 (+ |c_~#buffer~0.offset| .cse82) .cse39) .cse29) .cse13) (< .cse3 (+ |c_~#buffer~0.offset| .cse82 1)))))) (or .cse22 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse83 (store .cse16 .cse56 v_ArrVal_819)) (.cse84 (mod (mod .cse15 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse83 .cse14))) (<= .cse84 0) (= .cse13 (select (store .cse83 (+ |c_~#buffer~0.offset| .cse84) .cse39) .cse1)) (<= v_z_29 .cse4) (< 2147483647 .cse84) (< .cse3 (+ |c_~#buffer~0.offset| .cse84 1)))))) (or .cse2 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse86 (store .cse16 .cse56 v_ArrVal_819)) (.cse85 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (< .cse0 (+ |c_~#buffer~0.offset| .cse85)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse86 .cse14))) (<= v_z_29 .cse4) (<= .cse85 2147483647) (= (select (store .cse86 (+ |c_~#buffer~0.offset| (- 4294967296) .cse85) .cse39) .cse29) .cse13))))))))))) .cse5))))) (and (or (< .cse1 0) .cse22) (< .cse1 4294967296))))) is different from true [2023-08-26 20:27:20,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:27:20,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167426700] [2023-08-26 20:27:20,711 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 20:27:20,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392945712] [2023-08-26 20:27:20,711 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-08-26 20:27:20,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 139 [2023-08-26 20:27:20,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-26 20:27:20,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-26 20:27:20,912 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:196) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:311) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 52 more [2023-08-26 20:27:20,915 INFO L158 Benchmark]: Toolchain (without parser) took 230154.22ms. Allocated memory was 343.9MB in the beginning and 717.2MB in the end (delta: 373.3MB). Free memory was 319.0MB in the beginning and 484.8MB in the end (delta: -165.7MB). Peak memory consumption was 209.4MB. Max. memory is 16.0GB. [2023-08-26 20:27:20,915 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 343.9MB. Free memory is still 320.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 20:27:20,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.34ms. Allocated memory is still 343.9MB. Free memory was 318.7MB in the beginning and 298.5MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-26 20:27:20,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.49ms. Allocated memory is still 343.9MB. Free memory was 298.5MB in the beginning and 296.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 20:27:20,916 INFO L158 Benchmark]: Boogie Preprocessor took 69.62ms. Allocated memory is still 343.9MB. Free memory was 296.3MB in the beginning and 294.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 20:27:20,916 INFO L158 Benchmark]: RCFGBuilder took 578.66ms. Allocated memory is still 343.9MB. Free memory was 294.3MB in the beginning and 274.3MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-26 20:27:20,916 INFO L158 Benchmark]: TraceAbstraction took 228943.85ms. Allocated memory was 343.9MB in the beginning and 717.2MB in the end (delta: 373.3MB). Free memory was 273.7MB in the beginning and 484.8MB in the end (delta: -211.1MB). Peak memory consumption was 165.4MB. Max. memory is 16.0GB. [2023-08-26 20:27:20,917 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 343.9MB. Free memory is still 320.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 494.34ms. Allocated memory is still 343.9MB. Free memory was 318.7MB in the beginning and 298.5MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 62.49ms. Allocated memory is still 343.9MB. Free memory was 298.5MB in the beginning and 296.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 69.62ms. Allocated memory is still 343.9MB. Free memory was 296.3MB in the beginning and 294.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 578.66ms. Allocated memory is still 343.9MB. Free memory was 294.3MB in the beginning and 274.3MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 228943.85ms. Allocated memory was 343.9MB in the beginning and 717.2MB in the end (delta: 373.3MB). Free memory was 273.7MB in the beginning and 484.8MB in the end (delta: -211.1MB). Peak memory consumption was 165.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: 5.5s, 154 PlacesBefore, 50 PlacesAfterwards, 161 TransitionsBefore, 51 TransitionsAfterwards, 6922 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 91 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 21 ConcurrentYvCompositions, 6 ChoiceCompositions, 172 TotalNumberOfCompositions, 17080 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11110, independent: 10743, independent conditional: 0, independent unconditional: 10743, dependent: 367, dependent conditional: 0, dependent unconditional: 367, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4167, independent: 4098, independent conditional: 0, independent unconditional: 4098, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11110, independent: 6645, independent conditional: 0, independent unconditional: 6645, dependent: 298, dependent conditional: 0, dependent unconditional: 298, unknown: 4167, unknown conditional: 0, unknown unconditional: 4167] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 387, Positive conditional cache size: 0, Positive unconditional cache size: 387, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...