/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.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 09:24:16,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 09:24:16,582 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-27 09:24:16,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 09:24:16,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 09:24:16,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 09:24:16,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 09:24:16,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 09:24:16,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 09:24:16,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 09:24:16,616 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 09:24:16,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 09:24:16,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 09:24:16,617 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 09:24:16,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 09:24:16,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 09:24:16,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 09:24:16,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 09:24:16,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 09:24:16,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 09:24:16,618 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 09:24:16,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 09:24:16,619 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 09:24:16,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 09:24:16,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 09:24:16,620 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 09:24:16,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 09:24:16,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 09:24:16,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 09:24:16,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 09:24:16,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 09:24:16,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 09:24:16,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 09:24:16,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 09:24:16,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 09:24:16,622 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: Check absence of signed integer overflows -> true [2023-08-27 09:24:16,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 09:24:16,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 09:24:16,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 09:24:16,854 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 09:24:16,854 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 09:24:16,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-08-27 09:24:17,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 09:24:18,103 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 09:24:18,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-08-27 09:24:18,130 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ec5ea486/d9433d816f5346389258a8d88f115a0d/FLAG29ce5cc33 [2023-08-27 09:24:18,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ec5ea486/d9433d816f5346389258a8d88f115a0d [2023-08-27 09:24:18,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 09:24:18,149 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 09:24:18,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 09:24:18,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 09:24:18,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 09:24:18,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:24:18" (1/1) ... [2023-08-27 09:24:18,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b52073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:24:18, skipping insertion in model container [2023-08-27 09:24:18,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:24:18" (1/1) ... [2023-08-27 09:24:18,210 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 09:24:18,554 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 09:24:18,565 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 09:24:18,587 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-27 09:24:18,589 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-27 09:24:18,593 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-08-27 09:24:18,611 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 09:24:18,658 INFO L206 MainTranslator]: Completed translation [2023-08-27 09:24:18,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:24:18 WrapperNode [2023-08-27 09:24:18,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 09:24:18,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 09:24:18,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 09:24:18,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 09:24:18,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:24:18" (1/1) ... [2023-08-27 09:24:18,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:24:18" (1/1) ... [2023-08-27 09:24:18,727 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 221 [2023-08-27 09:24:18,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 09:24:18,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 09:24:18,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 09:24:18,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 09:24:18,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:24:18" (1/1) ... [2023-08-27 09:24:18,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:24:18" (1/1) ... [2023-08-27 09:24:18,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:24:18" (1/1) ... [2023-08-27 09:24:18,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:24:18" (1/1) ... [2023-08-27 09:24:18,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:24:18" (1/1) ... [2023-08-27 09:24:18,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:24:18" (1/1) ... [2023-08-27 09:24:18,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:24:18" (1/1) ... [2023-08-27 09:24:18,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:24:18" (1/1) ... [2023-08-27 09:24:18,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 09:24:18,771 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 09:24:18,771 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 09:24:18,771 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 09:24:18,771 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:24:18" (1/1) ... [2023-08-27 09:24:18,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 09:24:18,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:24:18,791 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-27 09:24:18,798 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-27 09:24:18,832 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-27 09:24:18,832 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-27 09:24:18,832 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-27 09:24:18,832 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-27 09:24:18,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 09:24:18,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 09:24:18,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 09:24:18,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 09:24:18,833 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-27 09:24:18,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 09:24:18,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 09:24:18,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 09:24:18,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 09:24:18,834 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 09:24:18,930 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 09:24:18,931 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 09:24:19,140 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 09:24:19,146 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 09:24:19,146 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-27 09:24:19,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:24:19 BoogieIcfgContainer [2023-08-27 09:24:19,148 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 09:24:19,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 09:24:19,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 09:24:19,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 09:24:19,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 09:24:18" (1/3) ... [2023-08-27 09:24:19,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c13c903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:24:19, skipping insertion in model container [2023-08-27 09:24:19,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:24:18" (2/3) ... [2023-08-27 09:24:19,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c13c903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:24:19, skipping insertion in model container [2023-08-27 09:24:19,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:24:19" (3/3) ... [2023-08-27 09:24:19,153 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-08-27 09:24:19,164 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 09:24:19,164 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-08-27 09:24:19,164 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 09:24:19,227 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-27 09:24:19,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 240 places, 248 transitions, 512 flow [2023-08-27 09:24:19,346 INFO L124 PetriNetUnfolderBase]: 15/246 cut-off events. [2023-08-27 09:24:19,346 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 09:24:19,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 246 events. 15/246 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 462 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2023-08-27 09:24:19,353 INFO L82 GeneralOperation]: Start removeDead. Operand has 240 places, 248 transitions, 512 flow [2023-08-27 09:24:19,361 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 237 transitions, 483 flow [2023-08-27 09:24:19,364 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 09:24:19,374 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 229 places, 237 transitions, 483 flow [2023-08-27 09:24:19,378 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 229 places, 237 transitions, 483 flow [2023-08-27 09:24:19,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 237 transitions, 483 flow [2023-08-27 09:24:19,431 INFO L124 PetriNetUnfolderBase]: 15/237 cut-off events. [2023-08-27 09:24:19,431 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-27 09:24:19,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 237 events. 15/237 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 385 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2023-08-27 09:24:19,440 INFO L119 LiptonReduction]: Number of co-enabled transitions 14312 [2023-08-27 09:24:25,788 INFO L134 LiptonReduction]: Checked pairs total: 33711 [2023-08-27 09:24:25,789 INFO L136 LiptonReduction]: Total number of compositions: 237 [2023-08-27 09:24:25,806 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 09:24:25,812 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;@629a1986, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 09:24:25,812 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-08-27 09:24:25,816 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 09:24:25,816 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-27 09:24:25,816 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:24:25,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:24:25,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-27 09:24:25,817 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:24:25,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:24:25,821 INFO L85 PathProgramCache]: Analyzing trace with hash 991, now seen corresponding path program 1 times [2023-08-27 09:24:25,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:24:25,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583514134] [2023-08-27 09:24:25,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:24:25,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:24:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:24:25,917 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-27 09:24:25,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:24:25,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583514134] [2023-08-27 09:24:25,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583514134] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:24:25,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:24:25,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-27 09:24:25,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315500656] [2023-08-27 09:24:25,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:24:25,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-27 09:24:25,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:24:25,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-27 09:24:25,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-27 09:24:25,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 485 [2023-08-27 09:24:25,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 127 flow. Second operand has 2 states, 2 states have (on average 235.5) internal successors, (471), 2 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:25,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:24:25,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 485 [2023-08-27 09:24:25,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:24:26,204 INFO L124 PetriNetUnfolderBase]: 1466/2404 cut-off events. [2023-08-27 09:24:26,205 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-08-27 09:24:26,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4797 conditions, 2404 events. 1466/2404 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12371 event pairs, 1185 based on Foata normal form. 0/1674 useless extension candidates. Maximal degree in co-relation 4577. Up to 2330 conditions per place. [2023-08-27 09:24:26,213 INFO L140 encePairwiseOnDemand]: 484/485 looper letters, 50 selfloop transitions, 0 changer transitions 0/58 dead transitions. [2023-08-27 09:24:26,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 225 flow [2023-08-27 09:24:26,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-27 09:24:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-27 09:24:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 521 transitions. [2023-08-27 09:24:26,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5371134020618556 [2023-08-27 09:24:26,223 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 521 transitions. [2023-08-27 09:24:26,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 521 transitions. [2023-08-27 09:24:26,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:24:26,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 521 transitions. [2023-08-27 09:24:26,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 260.5) internal successors, (521), 2 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-27 09:24:26,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 485.0) internal successors, (1455), 3 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:26,233 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 485.0) internal successors, (1455), 3 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:26,234 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 127 flow. Second operand 2 states and 521 transitions. [2023-08-27 09:24:26,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 225 flow [2023-08-27 09:24:26,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 220 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 09:24:26,238 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 120 flow [2023-08-27 09:24:26,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=120, PETRI_PLACES=56, PETRI_TRANSITIONS=58} [2023-08-27 09:24:26,241 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-08-27 09:24:26,241 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 120 flow [2023-08-27 09:24:26,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 235.5) internal successors, (471), 2 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:26,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:24:26,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:24:26,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 09:24:26,242 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:24:26,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:24:26,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1865824386, now seen corresponding path program 1 times [2023-08-27 09:24:26,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:24:26,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379015730] [2023-08-27 09:24:26,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:24:26,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:24:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:24:26,964 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-27 09:24:26,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:24:26,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379015730] [2023-08-27 09:24:26,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379015730] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:24:26,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:24:26,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 09:24:26,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187510868] [2023-08-27 09:24:26,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:24:26,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 09:24:26,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:24:26,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 09:24:26,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 09:24:26,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 485 [2023-08-27 09:24:26,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 189.4) internal successors, (947), 5 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:26,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:24:26,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 485 [2023-08-27 09:24:26,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:24:27,325 INFO L124 PetriNetUnfolderBase]: 1511/2489 cut-off events. [2023-08-27 09:24:27,325 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-27 09:24:27,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4962 conditions, 2489 events. 1511/2489 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 12463 event pairs, 1057 based on Foata normal form. 0/1742 useless extension candidates. Maximal degree in co-relation 4959. Up to 2422 conditions per place. [2023-08-27 09:24:27,334 INFO L140 encePairwiseOnDemand]: 477/485 looper letters, 54 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2023-08-27 09:24:27,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 274 flow [2023-08-27 09:24:27,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 09:24:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 09:24:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1193 transitions. [2023-08-27 09:24:27,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4099656357388316 [2023-08-27 09:24:27,338 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1193 transitions. [2023-08-27 09:24:27,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1193 transitions. [2023-08-27 09:24:27,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:24:27,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1193 transitions. [2023-08-27 09:24:27,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 198.83333333333334) internal successors, (1193), 6 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:27,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:27,345 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:27,345 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 120 flow. Second operand 6 states and 1193 transitions. [2023-08-27 09:24:27,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 274 flow [2023-08-27 09:24:27,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 71 transitions, 274 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 09:24:27,347 INFO L231 Difference]: Finished difference. Result has 65 places, 67 transitions, 186 flow [2023-08-27 09:24:27,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=65, PETRI_TRANSITIONS=67} [2023-08-27 09:24:27,348 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 6 predicate places. [2023-08-27 09:24:27,348 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 67 transitions, 186 flow [2023-08-27 09:24:27,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 189.4) internal successors, (947), 5 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:27,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:24:27,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:24:27,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 09:24:27,349 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:24:27,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:24:27,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1865824368, now seen corresponding path program 1 times [2023-08-27 09:24:27,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:24:27,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534482283] [2023-08-27 09:24:27,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:24:27,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:24:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:24:27,675 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-27 09:24:27,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:24:27,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534482283] [2023-08-27 09:24:27,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534482283] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:24:27,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:24:27,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 09:24:27,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792200482] [2023-08-27 09:24:27,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:24:27,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 09:24:27,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:24:27,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 09:24:27,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 09:24:27,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 485 [2023-08-27 09:24:27,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 67 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 189.4) internal successors, (947), 5 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:27,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:24:27,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 485 [2023-08-27 09:24:27,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:24:27,933 INFO L124 PetriNetUnfolderBase]: 1510/2487 cut-off events. [2023-08-27 09:24:27,933 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2023-08-27 09:24:27,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5281 conditions, 2487 events. 1510/2487 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12431 event pairs, 1057 based on Foata normal form. 0/1788 useless extension candidates. Maximal degree in co-relation 5273. Up to 2421 conditions per place. [2023-08-27 09:24:27,943 INFO L140 encePairwiseOnDemand]: 479/485 looper letters, 55 selfloop transitions, 8 changer transitions 0/70 dead transitions. [2023-08-27 09:24:27,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 70 transitions, 314 flow [2023-08-27 09:24:27,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 09:24:27,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 09:24:27,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1003 transitions. [2023-08-27 09:24:27,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41360824742268043 [2023-08-27 09:24:27,945 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1003 transitions. [2023-08-27 09:24:27,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1003 transitions. [2023-08-27 09:24:27,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:24:27,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1003 transitions. [2023-08-27 09:24:27,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 200.6) internal successors, (1003), 5 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:27,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:27,951 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:27,951 INFO L175 Difference]: Start difference. First operand has 65 places, 67 transitions, 186 flow. Second operand 5 states and 1003 transitions. [2023-08-27 09:24:27,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 70 transitions, 314 flow [2023-08-27 09:24:27,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 70 transitions, 314 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 09:24:27,955 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 196 flow [2023-08-27 09:24:27,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2023-08-27 09:24:27,956 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places. [2023-08-27 09:24:27,956 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 196 flow [2023-08-27 09:24:27,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 189.4) internal successors, (947), 5 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:27,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:24:27,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:24:27,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 09:24:27,957 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:24:27,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:24:27,957 INFO L85 PathProgramCache]: Analyzing trace with hash -2006802610, now seen corresponding path program 1 times [2023-08-27 09:24:27,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:24:27,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776491505] [2023-08-27 09:24:27,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:24:27,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:24:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:24:28,273 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-27 09:24:28,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:24:28,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776491505] [2023-08-27 09:24:28,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776491505] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:24:28,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:24:28,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 09:24:28,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727744789] [2023-08-27 09:24:28,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:24:28,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 09:24:28,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:24:28,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 09:24:28,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 09:24:28,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 09:24:28,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 185.33333333333334) internal successors, (1112), 6 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:28,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:24:28,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 09:24:28,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:24:28,654 INFO L124 PetriNetUnfolderBase]: 2181/3625 cut-off events. [2023-08-27 09:24:28,654 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2023-08-27 09:24:28,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7779 conditions, 3625 events. 2181/3625 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 20327 event pairs, 512 based on Foata normal form. 0/2716 useless extension candidates. Maximal degree in co-relation 7770. Up to 2528 conditions per place. [2023-08-27 09:24:28,682 INFO L140 encePairwiseOnDemand]: 476/485 looper letters, 110 selfloop transitions, 15 changer transitions 0/132 dead transitions. [2023-08-27 09:24:28,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 132 transitions, 603 flow [2023-08-27 09:24:28,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 09:24:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 09:24:28,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1042 transitions. [2023-08-27 09:24:28,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4296907216494845 [2023-08-27 09:24:28,684 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1042 transitions. [2023-08-27 09:24:28,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1042 transitions. [2023-08-27 09:24:28,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:24:28,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1042 transitions. [2023-08-27 09:24:28,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 208.4) internal successors, (1042), 5 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:28,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:28,690 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:28,690 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 196 flow. Second operand 5 states and 1042 transitions. [2023-08-27 09:24:28,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 132 transitions, 603 flow [2023-08-27 09:24:28,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 132 transitions, 587 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 09:24:28,695 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 266 flow [2023-08-27 09:24:28,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2023-08-27 09:24:28,696 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 12 predicate places. [2023-08-27 09:24:28,696 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 266 flow [2023-08-27 09:24:28,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.33333333333334) internal successors, (1112), 6 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:28,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:24:28,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:24:28,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 09:24:28,697 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:24:28,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:24:28,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2005979560, now seen corresponding path program 2 times [2023-08-27 09:24:28,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:24:28,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920892209] [2023-08-27 09:24:28,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:24:28,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:24:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:24:29,180 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-27 09:24:29,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:24:29,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920892209] [2023-08-27 09:24:29,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920892209] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:24:29,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:24:29,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 09:24:29,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245476956] [2023-08-27 09:24:29,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:24:29,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 09:24:29,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:24:29,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 09:24:29,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 09:24:29,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 09:24:29,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 185.33333333333334) internal successors, (1112), 6 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:29,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:24:29,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 09:24:29,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:24:29,623 INFO L124 PetriNetUnfolderBase]: 2181/3621 cut-off events. [2023-08-27 09:24:29,623 INFO L125 PetriNetUnfolderBase]: For 825/825 co-relation queries the response was YES. [2023-08-27 09:24:29,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8519 conditions, 3621 events. 2181/3621 cut-off events. For 825/825 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 20236 event pairs, 389 based on Foata normal form. 0/2785 useless extension candidates. Maximal degree in co-relation 8508. Up to 2528 conditions per place. [2023-08-27 09:24:29,640 INFO L140 encePairwiseOnDemand]: 477/485 looper letters, 124 selfloop transitions, 22 changer transitions 0/153 dead transitions. [2023-08-27 09:24:29,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 153 transitions, 753 flow [2023-08-27 09:24:29,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 09:24:29,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 09:24:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1239 transitions. [2023-08-27 09:24:29,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42577319587628865 [2023-08-27 09:24:29,643 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1239 transitions. [2023-08-27 09:24:29,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1239 transitions. [2023-08-27 09:24:29,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:24:29,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1239 transitions. [2023-08-27 09:24:29,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 206.5) internal successors, (1239), 6 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:29,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:29,649 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:29,649 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 266 flow. Second operand 6 states and 1239 transitions. [2023-08-27 09:24:29,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 153 transitions, 753 flow [2023-08-27 09:24:29,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 153 transitions, 735 flow, removed 9 selfloop flow, removed 0 redundant places. [2023-08-27 09:24:29,659 INFO L231 Difference]: Finished difference. Result has 79 places, 83 transitions, 376 flow [2023-08-27 09:24:29,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=79, PETRI_TRANSITIONS=83} [2023-08-27 09:24:29,661 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places. [2023-08-27 09:24:29,661 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 83 transitions, 376 flow [2023-08-27 09:24:29,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.33333333333334) internal successors, (1112), 6 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:29,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:24:29,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:24:29,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 09:24:29,662 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:24:29,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:24:29,662 INFO L85 PathProgramCache]: Analyzing trace with hash 752218327, now seen corresponding path program 1 times [2023-08-27 09:24:29,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:24:29,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824584531] [2023-08-27 09:24:29,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:24:29,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:24:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:24:29,692 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-27 09:24:29,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:24:29,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824584531] [2023-08-27 09:24:29,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824584531] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:24:29,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:24:29,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 09:24:29,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294385856] [2023-08-27 09:24:29,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:24:29,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:24:29,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:24:29,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:24:29,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:24:29,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 485 [2023-08-27 09:24:29,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 83 transitions, 376 flow. Second operand has 4 states, 4 states have (on average 225.25) internal successors, (901), 4 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:29,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:24:29,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 485 [2023-08-27 09:24:29,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:24:30,140 INFO L124 PetriNetUnfolderBase]: 3557/5851 cut-off events. [2023-08-27 09:24:30,140 INFO L125 PetriNetUnfolderBase]: For 3122/3173 co-relation queries the response was YES. [2023-08-27 09:24:30,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14120 conditions, 5851 events. 3557/5851 cut-off events. For 3122/3173 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 35750 event pairs, 1602 based on Foata normal form. 51/4420 useless extension candidates. Maximal degree in co-relation 14105. Up to 3438 conditions per place. [2023-08-27 09:24:30,168 INFO L140 encePairwiseOnDemand]: 478/485 looper letters, 153 selfloop transitions, 4 changer transitions 0/167 dead transitions. [2023-08-27 09:24:30,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 167 transitions, 1034 flow [2023-08-27 09:24:30,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 09:24:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 09:24:30,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1009 transitions. [2023-08-27 09:24:30,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5201030927835052 [2023-08-27 09:24:30,171 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1009 transitions. [2023-08-27 09:24:30,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1009 transitions. [2023-08-27 09:24:30,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:24:30,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1009 transitions. [2023-08-27 09:24:30,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 252.25) internal successors, (1009), 4 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:30,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:30,175 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:30,175 INFO L175 Difference]: Start difference. First operand has 79 places, 83 transitions, 376 flow. Second operand 4 states and 1009 transitions. [2023-08-27 09:24:30,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 167 transitions, 1034 flow [2023-08-27 09:24:30,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 167 transitions, 1032 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-27 09:24:30,182 INFO L231 Difference]: Finished difference. Result has 84 places, 86 transitions, 406 flow [2023-08-27 09:24:30,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=406, PETRI_PLACES=84, PETRI_TRANSITIONS=86} [2023-08-27 09:24:30,184 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 25 predicate places. [2023-08-27 09:24:30,184 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 86 transitions, 406 flow [2023-08-27 09:24:30,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 225.25) internal successors, (901), 4 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:30,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:24:30,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:24:30,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 09:24:30,185 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:24:30,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:24:30,186 INFO L85 PathProgramCache]: Analyzing trace with hash 693783489, now seen corresponding path program 1 times [2023-08-27 09:24:30,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:24:30,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760080925] [2023-08-27 09:24:30,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:24:30,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:24:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:24:30,429 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-27 09:24:30,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:24:30,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760080925] [2023-08-27 09:24:30,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760080925] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:24:30,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:24:30,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 09:24:30,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030613117] [2023-08-27 09:24:30,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:24:30,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 09:24:30,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:24:30,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 09:24:30,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 09:24:30,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 485 [2023-08-27 09:24:30,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 86 transitions, 406 flow. Second operand has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:30,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:24:30,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 485 [2023-08-27 09:24:30,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:24:30,819 INFO L124 PetriNetUnfolderBase]: 3602/6015 cut-off events. [2023-08-27 09:24:30,819 INFO L125 PetriNetUnfolderBase]: For 3921/3929 co-relation queries the response was YES. [2023-08-27 09:24:30,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15567 conditions, 6015 events. 3602/6015 cut-off events. For 3921/3929 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 36577 event pairs, 2530 based on Foata normal form. 0/4858 useless extension candidates. Maximal degree in co-relation 15549. Up to 5806 conditions per place. [2023-08-27 09:24:30,845 INFO L140 encePairwiseOnDemand]: 476/485 looper letters, 77 selfloop transitions, 10 changer transitions 0/94 dead transitions. [2023-08-27 09:24:30,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 94 transitions, 598 flow [2023-08-27 09:24:30,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 09:24:30,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 09:24:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1197 transitions. [2023-08-27 09:24:30,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.411340206185567 [2023-08-27 09:24:30,848 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1197 transitions. [2023-08-27 09:24:30,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1197 transitions. [2023-08-27 09:24:30,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:24:30,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1197 transitions. [2023-08-27 09:24:30,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 199.5) internal successors, (1197), 6 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:30,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:30,853 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:30,853 INFO L175 Difference]: Start difference. First operand has 84 places, 86 transitions, 406 flow. Second operand 6 states and 1197 transitions. [2023-08-27 09:24:30,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 94 transitions, 598 flow [2023-08-27 09:24:30,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 94 transitions, 596 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 09:24:30,860 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 444 flow [2023-08-27 09:24:30,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=444, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2023-08-27 09:24:30,861 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places. [2023-08-27 09:24:30,862 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 444 flow [2023-08-27 09:24:30,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:30,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:24:30,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:24:30,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 09:24:30,865 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:24:30,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:24:30,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1288991555, now seen corresponding path program 1 times [2023-08-27 09:24:30,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:24:30,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868042518] [2023-08-27 09:24:30,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:24:30,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:24:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:24:31,481 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-27 09:24:31,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:24:31,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868042518] [2023-08-27 09:24:31,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868042518] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:24:31,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:24:31,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 09:24:31,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648939757] [2023-08-27 09:24:31,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:24:31,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 09:24:31,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:24:31,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 09:24:31,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 09:24:31,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 09:24:31,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 444 flow. Second operand has 6 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:31,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:24:31,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 09:24:31,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:24:32,150 INFO L124 PetriNetUnfolderBase]: 3916/6452 cut-off events. [2023-08-27 09:24:32,151 INFO L125 PetriNetUnfolderBase]: For 3113/3143 co-relation queries the response was YES. [2023-08-27 09:24:32,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16860 conditions, 6452 events. 3916/6452 cut-off events. For 3113/3143 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 39632 event pairs, 726 based on Foata normal form. 94/5527 useless extension candidates. Maximal degree in co-relation 16841. Up to 4791 conditions per place. [2023-08-27 09:24:32,178 INFO L140 encePairwiseOnDemand]: 475/485 looper letters, 143 selfloop transitions, 20 changer transitions 0/170 dead transitions. [2023-08-27 09:24:32,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 170 transitions, 1013 flow [2023-08-27 09:24:32,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 09:24:32,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 09:24:32,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1244 transitions. [2023-08-27 09:24:32,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4274914089347079 [2023-08-27 09:24:32,182 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1244 transitions. [2023-08-27 09:24:32,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1244 transitions. [2023-08-27 09:24:32,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:24:32,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1244 transitions. [2023-08-27 09:24:32,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 207.33333333333334) internal successors, (1244), 6 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:32,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:32,187 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:32,187 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 444 flow. Second operand 6 states and 1244 transitions. [2023-08-27 09:24:32,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 170 transitions, 1013 flow [2023-08-27 09:24:32,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 170 transitions, 997 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 09:24:32,203 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 496 flow [2023-08-27 09:24:32,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=496, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2023-08-27 09:24:32,204 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 32 predicate places. [2023-08-27 09:24:32,205 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 496 flow [2023-08-27 09:24:32,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:32,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:24:32,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:24:32,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 09:24:32,205 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:24:32,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:24:32,206 INFO L85 PathProgramCache]: Analyzing trace with hash 38670329, now seen corresponding path program 2 times [2023-08-27 09:24:32,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:24:32,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191338946] [2023-08-27 09:24:32,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:24:32,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:24:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:24:32,623 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-27 09:24:32,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:24:32,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191338946] [2023-08-27 09:24:32,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191338946] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:24:32,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:24:32,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 09:24:32,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339830989] [2023-08-27 09:24:32,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:24:32,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 09:24:32,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:24:32,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 09:24:32,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 09:24:32,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 09:24:32,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 496 flow. Second operand has 6 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:32,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:24:32,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 09:24:32,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:24:33,293 INFO L124 PetriNetUnfolderBase]: 4146/6845 cut-off events. [2023-08-27 09:24:33,293 INFO L125 PetriNetUnfolderBase]: For 4591/4615 co-relation queries the response was YES. [2023-08-27 09:24:33,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18567 conditions, 6845 events. 4146/6845 cut-off events. For 4591/4615 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 41941 event pairs, 730 based on Foata normal form. 94/5889 useless extension candidates. Maximal degree in co-relation 18547. Up to 4332 conditions per place. [2023-08-27 09:24:33,336 INFO L140 encePairwiseOnDemand]: 476/485 looper letters, 142 selfloop transitions, 23 changer transitions 0/172 dead transitions. [2023-08-27 09:24:33,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 172 transitions, 1073 flow [2023-08-27 09:24:33,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 09:24:33,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 09:24:33,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1243 transitions. [2023-08-27 09:24:33,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42714776632302404 [2023-08-27 09:24:33,339 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1243 transitions. [2023-08-27 09:24:33,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1243 transitions. [2023-08-27 09:24:33,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:24:33,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1243 transitions. [2023-08-27 09:24:33,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 207.16666666666666) internal successors, (1243), 6 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:33,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:33,345 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:33,345 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 496 flow. Second operand 6 states and 1243 transitions. [2023-08-27 09:24:33,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 172 transitions, 1073 flow [2023-08-27 09:24:33,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 172 transitions, 1050 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-27 09:24:33,365 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 554 flow [2023-08-27 09:24:33,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=554, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2023-08-27 09:24:33,366 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 36 predicate places. [2023-08-27 09:24:33,366 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 554 flow [2023-08-27 09:24:33,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:33,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:24:33,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:24:33,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 09:24:33,366 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:24:33,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:24:33,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1327212761, now seen corresponding path program 1 times [2023-08-27 09:24:33,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:24:33,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273908803] [2023-08-27 09:24:33,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:24:33,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:24:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:24:33,397 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-27 09:24:33,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:24:33,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273908803] [2023-08-27 09:24:33,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273908803] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:24:33,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:24:33,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:24:33,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924979691] [2023-08-27 09:24:33,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:24:33,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 09:24:33,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:24:33,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 09:24:33,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 09:24:33,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 485 [2023-08-27 09:24:33,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:33,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:24:33,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 485 [2023-08-27 09:24:33,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:24:33,552 INFO L124 PetriNetUnfolderBase]: 852/1653 cut-off events. [2023-08-27 09:24:33,552 INFO L125 PetriNetUnfolderBase]: For 1280/1287 co-relation queries the response was YES. [2023-08-27 09:24:33,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4260 conditions, 1653 events. 852/1653 cut-off events. For 1280/1287 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 9260 event pairs, 565 based on Foata normal form. 73/1571 useless extension candidates. Maximal degree in co-relation 4239. Up to 813 conditions per place. [2023-08-27 09:24:33,560 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 75 selfloop transitions, 2 changer transitions 7/92 dead transitions. [2023-08-27 09:24:33,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 92 transitions, 645 flow [2023-08-27 09:24:33,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 09:24:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 09:24:33,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2023-08-27 09:24:33,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147766323024054 [2023-08-27 09:24:33,562 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 749 transitions. [2023-08-27 09:24:33,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 749 transitions. [2023-08-27 09:24:33,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:24:33,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 749 transitions. [2023-08-27 09:24:33,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:33,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:33,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:33,566 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 554 flow. Second operand 3 states and 749 transitions. [2023-08-27 09:24:33,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 92 transitions, 645 flow [2023-08-27 09:24:33,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 613 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-27 09:24:33,570 INFO L231 Difference]: Finished difference. Result has 94 places, 80 transitions, 419 flow [2023-08-27 09:24:33,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=94, PETRI_TRANSITIONS=80} [2023-08-27 09:24:33,570 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 35 predicate places. [2023-08-27 09:24:33,571 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 80 transitions, 419 flow [2023-08-27 09:24:33,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:33,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:24:33,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:24:33,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 09:24:33,571 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:24:33,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:24:33,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1005879036, now seen corresponding path program 1 times [2023-08-27 09:24:33,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:24:33,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230271308] [2023-08-27 09:24:33,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:24:33,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:24:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:24:33,599 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-27 09:24:33,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:24:33,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230271308] [2023-08-27 09:24:33,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230271308] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:24:33,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:24:33,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:24:33,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429478289] [2023-08-27 09:24:33,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:24:33,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 09:24:33,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:24:33,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 09:24:33,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 09:24:33,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 09:24:33,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 80 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:33,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:24:33,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 09:24:33,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:24:33,740 INFO L124 PetriNetUnfolderBase]: 548/1083 cut-off events. [2023-08-27 09:24:33,740 INFO L125 PetriNetUnfolderBase]: For 622/627 co-relation queries the response was YES. [2023-08-27 09:24:33,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 1083 events. 548/1083 cut-off events. For 622/627 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5347 event pairs, 410 based on Foata normal form. 13/971 useless extension candidates. Maximal degree in co-relation 2823. Up to 804 conditions per place. [2023-08-27 09:24:33,745 INFO L140 encePairwiseOnDemand]: 480/485 looper letters, 76 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2023-08-27 09:24:33,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 594 flow [2023-08-27 09:24:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 09:24:33,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 09:24:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2023-08-27 09:24:33,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5140893470790378 [2023-08-27 09:24:33,747 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 748 transitions. [2023-08-27 09:24:33,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 748 transitions. [2023-08-27 09:24:33,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:24:33,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 748 transitions. [2023-08-27 09:24:33,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:33,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:33,750 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:33,751 INFO L175 Difference]: Start difference. First operand has 94 places, 80 transitions, 419 flow. Second operand 3 states and 748 transitions. [2023-08-27 09:24:33,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 594 flow [2023-08-27 09:24:33,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 88 transitions, 581 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-27 09:24:33,754 INFO L231 Difference]: Finished difference. Result has 93 places, 80 transitions, 414 flow [2023-08-27 09:24:33,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=93, PETRI_TRANSITIONS=80} [2023-08-27 09:24:33,755 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 34 predicate places. [2023-08-27 09:24:33,755 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 80 transitions, 414 flow [2023-08-27 09:24:33,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:33,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:24:33,755 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:24:33,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 09:24:33,756 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:24:33,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:24:33,756 INFO L85 PathProgramCache]: Analyzing trace with hash 156498137, now seen corresponding path program 1 times [2023-08-27 09:24:33,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:24:33,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638646777] [2023-08-27 09:24:33,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:24:33,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:24:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:24:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:24:34,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:24:34,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638646777] [2023-08-27 09:24:34,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638646777] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:24:34,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298102444] [2023-08-27 09:24:34,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:24:34,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:24:34,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:24:34,634 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-27 09:24:34,671 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-27 09:24:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:24:34,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 68 conjunts are in the unsatisfiable core [2023-08-27 09:24:34,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:24:34,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:24:34,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:24:34,829 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 09:24:34,830 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-27 09:24:34,838 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 09:24:34,838 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 09:24:34,908 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 36 treesize of output 29 [2023-08-27 09:24:34,997 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 41 treesize of output 34 [2023-08-27 09:24:35,106 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 44 treesize of output 37 [2023-08-27 09:24:35,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:24:35,156 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 33 treesize of output 35 [2023-08-27 09:24:35,248 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 47 treesize of output 40 [2023-08-27 09:24:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:24:35,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:24:35,630 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_405 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_404) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_405) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)))) is different from false [2023-08-27 09:24:35,687 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_402)) |c_~#stored_elements~0.base| v_ArrVal_404) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_405) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_402) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|))))) is different from false [2023-08-27 09:24:35,715 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_400) .cse1 v_ArrVal_402)) |c_~#stored_elements~0.base| v_ArrVal_404) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_400) (< (+ (select .cse0 .cse1) 1) v_ArrVal_402) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_405) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|))))) is different from false [2023-08-27 09:24:35,815 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_400 Int) (v_ArrVal_398 Int) (v_ArrVal_404 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_398)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_400) .cse3 v_ArrVal_402)) |c_~#stored_elements~0.base| v_ArrVal_404) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_400) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|) (< (+ (select .cse0 .cse3) 1) v_ArrVal_402) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_405) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-27 09:24:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-27 09:24:40,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298102444] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:24:40,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:24:40,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-08-27 09:24:40,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307209584] [2023-08-27 09:24:40,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:24:40,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-27 09:24:40,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:24:40,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-27 09:24:40,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=573, Unknown=12, NotChecked=220, Total=992 [2023-08-27 09:24:40,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 485 [2023-08-27 09:24:40,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 80 transitions, 414 flow. Second operand has 32 states, 32 states have (on average 180.40625) internal successors, (5773), 32 states have internal predecessors, (5773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:40,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:24:40,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 485 [2023-08-27 09:24:40,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:24:45,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:24:47,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:24:47,822 INFO L124 PetriNetUnfolderBase]: 612/1198 cut-off events. [2023-08-27 09:24:47,822 INFO L125 PetriNetUnfolderBase]: For 702/702 co-relation queries the response was YES. [2023-08-27 09:24:47,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3221 conditions, 1198 events. 612/1198 cut-off events. For 702/702 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 6016 event pairs, 436 based on Foata normal form. 0/1070 useless extension candidates. Maximal degree in co-relation 3199. Up to 1046 conditions per place. [2023-08-27 09:24:47,827 INFO L140 encePairwiseOnDemand]: 468/485 looper letters, 69 selfloop transitions, 52 changer transitions 1/128 dead transitions. [2023-08-27 09:24:47,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 128 transitions, 889 flow [2023-08-27 09:24:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-27 09:24:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-27 09:24:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3868 transitions. [2023-08-27 09:24:47,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.379774177712322 [2023-08-27 09:24:47,833 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3868 transitions. [2023-08-27 09:24:47,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3868 transitions. [2023-08-27 09:24:47,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:24:47,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3868 transitions. [2023-08-27 09:24:47,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 184.1904761904762) internal successors, (3868), 21 states have internal predecessors, (3868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:47,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 485.0) internal successors, (10670), 22 states have internal predecessors, (10670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:47,847 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 485.0) internal successors, (10670), 22 states have internal predecessors, (10670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:47,847 INFO L175 Difference]: Start difference. First operand has 93 places, 80 transitions, 414 flow. Second operand 21 states and 3868 transitions. [2023-08-27 09:24:47,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 128 transitions, 889 flow [2023-08-27 09:24:47,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 128 transitions, 885 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 09:24:47,851 INFO L231 Difference]: Finished difference. Result has 119 places, 115 transitions, 777 flow [2023-08-27 09:24:47,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=777, PETRI_PLACES=119, PETRI_TRANSITIONS=115} [2023-08-27 09:24:47,852 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 60 predicate places. [2023-08-27 09:24:47,852 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 115 transitions, 777 flow [2023-08-27 09:24:47,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 180.40625) internal successors, (5773), 32 states have internal predecessors, (5773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:47,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:24:47,853 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:24:47,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-27 09:24:48,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-27 09:24:48,058 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:24:48,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:24:48,058 INFO L85 PathProgramCache]: Analyzing trace with hash 156498119, now seen corresponding path program 1 times [2023-08-27 09:24:48,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:24:48,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597747688] [2023-08-27 09:24:48,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:24:48,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:24:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:24:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:24:48,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:24:48,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597747688] [2023-08-27 09:24:48,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597747688] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:24:48,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383790120] [2023-08-27 09:24:48,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:24:48,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:24:48,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:24:48,389 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-27 09:24:48,390 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-27 09:24:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:24:48,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-27 09:24:48,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:24:48,563 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-27 09:24:48,613 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 21 treesize of output 20 [2023-08-27 09:24:48,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:24:48,634 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 16 treesize of output 18 [2023-08-27 09:24:48,686 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-27 09:24:48,686 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 1 case distinctions, treesize of input 23 treesize of output 26 [2023-08-27 09:24:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:24:48,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:24:48,768 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_487 Int) (v_ArrVal_485 (Array Int Int))) (or (< (+ v_ArrVal_487 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_485) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_487) (+ 3208 |c_~#queue~0.offset|)))))) is different from false [2023-08-27 09:24:48,821 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:24:48,821 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2023-08-27 09:24:48,828 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:24:48,829 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2023-08-27 09:24:48,833 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 24 [2023-08-27 09:24:48,843 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 5 [2023-08-27 09:24:48,851 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:24:48,851 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2023-08-27 09:24:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:24:48,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383790120] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:24:48,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:24:48,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-08-27 09:24:48,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745771108] [2023-08-27 09:24:48,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:24:48,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-27 09:24:48,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:24:48,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-27 09:24:48,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=475, Unknown=3, NotChecked=46, Total=650 [2023-08-27 09:24:48,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 485 [2023-08-27 09:24:48,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 115 transitions, 777 flow. Second operand has 26 states, 26 states have (on average 181.73076923076923) internal successors, (4725), 26 states have internal predecessors, (4725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:48,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:24:48,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 485 [2023-08-27 09:24:48,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:24:49,654 INFO L124 PetriNetUnfolderBase]: 1367/2659 cut-off events. [2023-08-27 09:24:49,655 INFO L125 PetriNetUnfolderBase]: For 1601/1601 co-relation queries the response was YES. [2023-08-27 09:24:49,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7089 conditions, 2659 events. 1367/2659 cut-off events. For 1601/1601 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 15854 event pairs, 646 based on Foata normal form. 0/2361 useless extension candidates. Maximal degree in co-relation 7060. Up to 845 conditions per place. [2023-08-27 09:24:49,664 INFO L140 encePairwiseOnDemand]: 475/485 looper letters, 173 selfloop transitions, 50 changer transitions 4/233 dead transitions. [2023-08-27 09:24:49,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 233 transitions, 1652 flow [2023-08-27 09:24:49,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 09:24:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 09:24:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2146 transitions. [2023-08-27 09:24:49,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022492970946579 [2023-08-27 09:24:49,668 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2146 transitions. [2023-08-27 09:24:49,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2146 transitions. [2023-08-27 09:24:49,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:24:49,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2146 transitions. [2023-08-27 09:24:49,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 195.0909090909091) internal successors, (2146), 11 states have internal predecessors, (2146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:49,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 485.0) internal successors, (5820), 12 states have internal predecessors, (5820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:49,676 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 485.0) internal successors, (5820), 12 states have internal predecessors, (5820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:49,676 INFO L175 Difference]: Start difference. First operand has 119 places, 115 transitions, 777 flow. Second operand 11 states and 2146 transitions. [2023-08-27 09:24:49,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 233 transitions, 1652 flow [2023-08-27 09:24:49,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 233 transitions, 1514 flow, removed 54 selfloop flow, removed 8 redundant places. [2023-08-27 09:24:49,684 INFO L231 Difference]: Finished difference. Result has 123 places, 124 transitions, 836 flow [2023-08-27 09:24:49,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=836, PETRI_PLACES=123, PETRI_TRANSITIONS=124} [2023-08-27 09:24:49,684 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 64 predicate places. [2023-08-27 09:24:49,685 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 124 transitions, 836 flow [2023-08-27 09:24:49,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 181.73076923076923) internal successors, (4725), 26 states have internal predecessors, (4725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:49,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:24:49,686 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:24:49,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-27 09:24:49,890 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,SelfDestructingSolverStorable12 [2023-08-27 09:24:49,890 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:24:49,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:24:49,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1827680919, now seen corresponding path program 1 times [2023-08-27 09:24:49,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:24:49,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705127945] [2023-08-27 09:24:49,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:24:49,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:24:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:24:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:24:50,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:24:50,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705127945] [2023-08-27 09:24:50,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705127945] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:24:50,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388008800] [2023-08-27 09:24:50,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:24:50,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:24:50,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:24:50,532 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-27 09:24:50,534 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-27 09:24:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:24:50,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 72 conjunts are in the unsatisfiable core [2023-08-27 09:24:50,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:24:50,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:24:50,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:24:50,659 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 09:24:50,659 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-27 09:24:50,673 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 09:24:50,674 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-27 09:24:50,736 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 22 treesize of output 24 [2023-08-27 09:24:50,832 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 36 treesize of output 29 [2023-08-27 09:24:50,938 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 41 treesize of output 34 [2023-08-27 09:24:51,111 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 44 treesize of output 37 [2023-08-27 09:24:51,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:24:51,176 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 33 treesize of output 35 [2023-08-27 09:24:51,285 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 47 treesize of output 40 [2023-08-27 09:24:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:24:51,397 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:24:51,466 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (v_ArrVal_587 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_587) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_588) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 09:24:51,507 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (v_ArrVal_585 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (v_ArrVal_587 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_585)) |c_~#stored_elements~0.base| v_ArrVal_587) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_588) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_585) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|)))) is different from false [2023-08-27 09:24:51,621 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (v_ArrVal_585 Int) (v_ArrVal_584 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (v_ArrVal_587 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_584) .cse2 v_ArrVal_585)) |c_~#stored_elements~0.base| v_ArrVal_587) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_584) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_588) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_585) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|))))) is different from false [2023-08-27 09:24:51,703 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (v_ArrVal_585 Int) (v_ArrVal_584 Int) (v_ArrVal_582 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (v_ArrVal_587 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_582)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_584) .cse2 v_ArrVal_585)) |c_~#stored_elements~0.base| v_ArrVal_587) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_584) (< (+ (select .cse0 .cse2) 1) v_ArrVal_585) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_588) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse3 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|))))) is different from false [2023-08-27 09:24:57,809 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (v_ArrVal_585 Int) (v_ArrVal_584 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int) (v_ArrVal_587 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_580))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)) v_ArrVal_582)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_584) .cse1 v_ArrVal_585)) |c_~#stored_elements~0.base| v_ArrVal_587) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_585) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_588) .cse3) 2147483647) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (< (+ 1 (select .cse0 .cse3)) v_ArrVal_584))))))) is different from false [2023-08-27 09:24:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-27 09:24:57,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388008800] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:24:57,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:24:57,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-27 09:24:57,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984375820] [2023-08-27 09:24:57,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:24:57,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-27 09:24:57,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:24:57,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-27 09:24:57,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=645, Unknown=17, NotChecked=300, Total=1190 [2023-08-27 09:24:57,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 09:24:57,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 124 transitions, 836 flow. Second operand has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:24:57,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:24:57,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 09:24:57,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:25:01,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:01,930 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_588 Int) (v_ArrVal_585 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (v_ArrVal_587 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_585)) |c_~#stored_elements~0.base| v_ArrVal_587) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_588) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_585)))) (forall ((v_ArrVal_588 Int) (v_ArrVal_585 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (v_ArrVal_587 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_585)) |c_~#stored_elements~0.base| v_ArrVal_587) |c_~#queue~0.base|))) (or (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_588) .cse1) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_585) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|)))))) is different from false [2023-08-27 09:25:03,759 INFO L124 PetriNetUnfolderBase]: 1812/3517 cut-off events. [2023-08-27 09:25:03,759 INFO L125 PetriNetUnfolderBase]: For 2835/2835 co-relation queries the response was YES. [2023-08-27 09:25:03,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9623 conditions, 3517 events. 1812/3517 cut-off events. For 2835/2835 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 22554 event pairs, 837 based on Foata normal form. 14/3161 useless extension candidates. Maximal degree in co-relation 9593. Up to 2239 conditions per place. [2023-08-27 09:25:03,776 INFO L140 encePairwiseOnDemand]: 465/485 looper letters, 170 selfloop transitions, 82 changer transitions 3/261 dead transitions. [2023-08-27 09:25:03,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 261 transitions, 1827 flow [2023-08-27 09:25:03,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-27 09:25:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-27 09:25:03,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3882 transitions. [2023-08-27 09:25:03,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3811487481590574 [2023-08-27 09:25:03,783 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3882 transitions. [2023-08-27 09:25:03,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3882 transitions. [2023-08-27 09:25:03,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:25:03,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3882 transitions. [2023-08-27 09:25:03,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 184.85714285714286) internal successors, (3882), 21 states have internal predecessors, (3882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:25:03,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 485.0) internal successors, (10670), 22 states have internal predecessors, (10670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:25:03,799 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 485.0) internal successors, (10670), 22 states have internal predecessors, (10670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:25:03,799 INFO L175 Difference]: Start difference. First operand has 123 places, 124 transitions, 836 flow. Second operand 21 states and 3882 transitions. [2023-08-27 09:25:03,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 261 transitions, 1827 flow [2023-08-27 09:25:03,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 261 transitions, 1773 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-08-27 09:25:03,812 INFO L231 Difference]: Finished difference. Result has 148 places, 156 transitions, 1250 flow [2023-08-27 09:25:03,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1250, PETRI_PLACES=148, PETRI_TRANSITIONS=156} [2023-08-27 09:25:03,812 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 89 predicate places. [2023-08-27 09:25:03,813 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 156 transitions, 1250 flow [2023-08-27 09:25:03,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:25:03,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:25:03,814 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:25:03,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-27 09:25:04,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:25:04,019 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:25:04,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:25:04,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1968124107, now seen corresponding path program 2 times [2023-08-27 09:25:04,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:25:04,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715594974] [2023-08-27 09:25:04,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:25:04,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:25:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:25:04,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:25:04,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:25:04,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715594974] [2023-08-27 09:25:04,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715594974] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:25:04,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720974462] [2023-08-27 09:25:04,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 09:25:04,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:25:04,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:25:04,773 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-27 09:25:04,790 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-27 09:25:04,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 09:25:04,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 09:25:04,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 80 conjunts are in the unsatisfiable core [2023-08-27 09:25:04,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:25:04,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:25:04,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:25:04,941 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 09:25:04,941 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-27 09:25:04,954 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 09:25:04,955 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-27 09:25:05,050 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 33 treesize of output 26 [2023-08-27 09:25:05,115 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 39 treesize of output 32 [2023-08-27 09:25:05,152 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 28 treesize of output 30 [2023-08-27 09:25:05,234 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 42 treesize of output 35 [2023-08-27 09:25:05,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:25:05,267 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 31 treesize of output 33 [2023-08-27 09:25:05,332 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 45 treesize of output 38 [2023-08-27 09:25:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:25:05,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:25:05,430 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_690) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_692) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 09:25:05,441 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 Int) (v_ArrVal_688 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_690) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_688) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_692) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)))) is different from false [2023-08-27 09:25:07,564 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_690) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_692) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_688)))))) is different from false [2023-08-27 09:25:07,582 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_686 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_686)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_690) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_686) (< (+ (select .cse0 .cse1) 1) v_ArrVal_688) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_692) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)))))) is different from false [2023-08-27 09:25:07,600 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_686 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_686)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687))) (let ((.cse2 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_690) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_686) (< (+ (select .cse2 .cse3) 1) v_ArrVal_688) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_692) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse4 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|))))))) is different from false [2023-08-27 09:25:07,619 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_686 Int) (v_ArrVal_684 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_684)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_686)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_690) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_686) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_692) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_688))))))) is different from false [2023-08-27 09:25:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-27 09:25:07,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720974462] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:25:07,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:25:07,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-27 09:25:07,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027481078] [2023-08-27 09:25:07,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:25:07,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-27 09:25:07,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:25:07,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-27 09:25:07,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=586, Unknown=18, NotChecked=354, Total=1190 [2023-08-27 09:25:07,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 09:25:07,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 156 transitions, 1250 flow. Second operand has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:25:07,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:25:07,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 09:25:07,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:25:13,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:15,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:17,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:19,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:21,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:23,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:25,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:27,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:29,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:31,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:32,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:36,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:39,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:41,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:43,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:45,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:47,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:49,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:51,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:53,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:55,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:57,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:59,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:26:01,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:26:10,064 WARN L234 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 108 DAG size of output: 106 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:26:11,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:26:20,187 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_687))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_690) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_692) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_688)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 Int) (v_ArrVal_688 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse7 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse4 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_690) |c_~#queue~0.base|))) (or (< (+ (select .cse6 .cse4) 1) v_ArrVal_688) (< (select (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_692) .cse1) 2147483647) (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|))))))) is different from false [2023-08-27 09:26:20,613 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_692 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_692) .cse2) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_692 Int) (v_ArrVal_688 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_690) |c_~#queue~0.base|))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_688) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_692) .cse2) 2147483647) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|))))))) is different from false [2023-08-27 09:26:22,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:26:25,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:26:28,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:26:30,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:26:31,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:26:32,254 INFO L124 PetriNetUnfolderBase]: 2866/5554 cut-off events. [2023-08-27 09:26:32,255 INFO L125 PetriNetUnfolderBase]: For 12754/12956 co-relation queries the response was YES. [2023-08-27 09:26:32,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20877 conditions, 5554 events. 2866/5554 cut-off events. For 12754/12956 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 39491 event pairs, 1035 based on Foata normal form. 29/4999 useless extension candidates. Maximal degree in co-relation 20839. Up to 2769 conditions per place. [2023-08-27 09:26:32,284 INFO L140 encePairwiseOnDemand]: 463/485 looper letters, 187 selfloop transitions, 144 changer transitions 3/340 dead transitions. [2023-08-27 09:26:32,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 340 transitions, 3289 flow [2023-08-27 09:26:32,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-27 09:26:32,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-27 09:26:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4432 transitions. [2023-08-27 09:26:32,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38075601374570445 [2023-08-27 09:26:32,290 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4432 transitions. [2023-08-27 09:26:32,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4432 transitions. [2023-08-27 09:26:32,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:26:32,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4432 transitions. [2023-08-27 09:26:32,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 184.66666666666666) internal successors, (4432), 24 states have internal predecessors, (4432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:26:32,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 485.0) internal successors, (12125), 25 states have internal predecessors, (12125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:26:32,303 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 485.0) internal successors, (12125), 25 states have internal predecessors, (12125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:26:32,303 INFO L175 Difference]: Start difference. First operand has 148 places, 156 transitions, 1250 flow. Second operand 24 states and 4432 transitions. [2023-08-27 09:26:32,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 340 transitions, 3289 flow [2023-08-27 09:26:32,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 340 transitions, 3132 flow, removed 62 selfloop flow, removed 7 redundant places. [2023-08-27 09:26:32,334 INFO L231 Difference]: Finished difference. Result has 176 places, 237 transitions, 2382 flow [2023-08-27 09:26:32,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2382, PETRI_PLACES=176, PETRI_TRANSITIONS=237} [2023-08-27 09:26:32,335 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 117 predicate places. [2023-08-27 09:26:32,335 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 237 transitions, 2382 flow [2023-08-27 09:26:32,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:26:32,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:26:32,336 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:26:32,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-27 09:26:32,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-27 09:26:32,540 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:26:32,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:26:32,540 INFO L85 PathProgramCache]: Analyzing trace with hash -882310050, now seen corresponding path program 1 times [2023-08-27 09:26:32,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:26:32,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826079491] [2023-08-27 09:26:32,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:26:32,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:26:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:26:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:26:32,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:26:32,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826079491] [2023-08-27 09:26:32,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826079491] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:26:32,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210558055] [2023-08-27 09:26:32,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:26:32,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:26:32,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:26:32,935 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-27 09:26:32,937 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-27 09:26:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:26:33,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 56 conjunts are in the unsatisfiable core [2023-08-27 09:26:33,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:26:33,064 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 09:26:33,064 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-27 09:26:33,170 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-27 09:26:33,203 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 16 treesize of output 18 [2023-08-27 09:26:33,252 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 21 treesize of output 20 [2023-08-27 09:26:33,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:26:33,292 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 16 treesize of output 18 [2023-08-27 09:26:33,344 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-27 09:26:33,345 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 1 case distinctions, treesize of input 23 treesize of output 26 [2023-08-27 09:26:33,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:26:33,387 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:26:33,620 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:26:33,620 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 48 [2023-08-27 09:26:33,632 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:26:33,632 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2233 treesize of output 2187 [2023-08-27 09:26:33,648 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 516 treesize of output 500 [2023-08-27 09:26:33,662 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 498 treesize of output 466 [2023-08-27 09:26:34,467 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:26:34,470 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 5 [2023-08-27 09:26:34,475 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:26:34,477 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 5 [2023-08-27 09:26:34,484 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:26:34,487 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 5 [2023-08-27 09:26:34,502 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:26:34,504 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 5 [2023-08-27 09:26:34,526 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-27 09:26:34,625 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:26:34,626 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 466 treesize of output 434 [2023-08-27 09:26:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:26:34,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210558055] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:26:34,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:26:34,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-08-27 09:26:34,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179158492] [2023-08-27 09:26:34,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:26:34,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-27 09:26:34,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:26:34,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-27 09:26:34,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=646, Unknown=16, NotChecked=0, Total=812 [2023-08-27 09:26:34,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 485 [2023-08-27 09:26:34,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 237 transitions, 2382 flow. Second operand has 29 states, 29 states have (on average 177.75862068965517) internal successors, (5155), 29 states have internal predecessors, (5155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:26:34,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:26:34,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 485 [2023-08-27 09:26:34,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:26:35,870 INFO L124 PetriNetUnfolderBase]: 2975/5863 cut-off events. [2023-08-27 09:26:35,870 INFO L125 PetriNetUnfolderBase]: For 64513/64549 co-relation queries the response was YES. [2023-08-27 09:26:35,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31663 conditions, 5863 events. 2975/5863 cut-off events. For 64513/64549 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 42514 event pairs, 1522 based on Foata normal form. 35/5347 useless extension candidates. Maximal degree in co-relation 31615. Up to 4757 conditions per place. [2023-08-27 09:26:35,906 INFO L140 encePairwiseOnDemand]: 477/485 looper letters, 223 selfloop transitions, 38 changer transitions 3/270 dead transitions. [2023-08-27 09:26:35,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 270 transitions, 3113 flow [2023-08-27 09:26:35,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 09:26:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 09:26:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1144 transitions. [2023-08-27 09:26:35,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.393127147766323 [2023-08-27 09:26:35,909 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1144 transitions. [2023-08-27 09:26:35,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1144 transitions. [2023-08-27 09:26:35,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:26:35,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1144 transitions. [2023-08-27 09:26:35,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 190.66666666666666) internal successors, (1144), 6 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:26:35,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:26:35,913 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:26:35,913 INFO L175 Difference]: Start difference. First operand has 176 places, 237 transitions, 2382 flow. Second operand 6 states and 1144 transitions. [2023-08-27 09:26:35,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 270 transitions, 3113 flow [2023-08-27 09:26:35,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 270 transitions, 2848 flow, removed 94 selfloop flow, removed 7 redundant places. [2023-08-27 09:26:35,955 INFO L231 Difference]: Finished difference. Result has 174 places, 234 transitions, 2177 flow [2023-08-27 09:26:35,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=2058, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2177, PETRI_PLACES=174, PETRI_TRANSITIONS=234} [2023-08-27 09:26:35,956 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 115 predicate places. [2023-08-27 09:26:35,956 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 234 transitions, 2177 flow [2023-08-27 09:26:35,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 177.75862068965517) internal successors, (5155), 29 states have internal predecessors, (5155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:26:35,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:26:35,957 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:26:35,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-27 09:26:36,161 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,SelfDestructingSolverStorable15 [2023-08-27 09:26:36,162 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:26:36,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:26:36,162 INFO L85 PathProgramCache]: Analyzing trace with hash 555652901, now seen corresponding path program 3 times [2023-08-27 09:26:36,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:26:36,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21126142] [2023-08-27 09:26:36,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:26:36,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:26:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:26:36,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:26:36,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:26:36,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21126142] [2023-08-27 09:26:36,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21126142] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:26:36,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126595769] [2023-08-27 09:26:36,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 09:26:36,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:26:36,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:26:36,781 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-27 09:26:36,782 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-27 09:26:36,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-27 09:26:36,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 09:26:36,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 80 conjunts are in the unsatisfiable core [2023-08-27 09:26:36,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:26:36,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:26:36,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:26:36,923 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2023-08-27 09:26:36,967 INFO L322 Elim1Store]: treesize reduction 37, result has 49.3 percent of original size [2023-08-27 09:26:36,967 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 44 treesize of output 67 [2023-08-27 09:26:37,096 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 36 treesize of output 29 [2023-08-27 09:26:37,209 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 41 treesize of output 34 [2023-08-27 09:26:37,370 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 44 treesize of output 37 [2023-08-27 09:26:37,440 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 33 treesize of output 35 [2023-08-27 09:26:37,505 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-08-27 09:26:37,613 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 47 treesize of output 40 [2023-08-27 09:26:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:26:37,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:26:37,757 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_882 Int) (v_ArrVal_880 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_880) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_~#queue~0.offset|) v_ArrVal_882) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 09:26:37,767 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_882 Int) (v_ArrVal_879 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_879) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_880) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_~#queue~0.offset|) v_ArrVal_882) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 09:26:37,847 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_882 Int) (v_ArrVal_879 (Array Int Int)) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_877 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_877)) |c_~#stored_elements~0.base| v_ArrVal_879) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_880) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_877) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_~#queue~0.offset|) v_ArrVal_882) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-27 09:26:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:26:39,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126595769] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:26:39,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:26:39,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-27 09:26:39,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495982760] [2023-08-27 09:26:39,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:26:39,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-27 09:26:39,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:26:39,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-27 09:26:39,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=744, Unknown=22, NotChecked=186, Total=1190 [2023-08-27 09:26:39,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 09:26:39,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 234 transitions, 2177 flow. Second operand has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:26:39,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:26:39,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 09:26:39,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:26:48,895 WARN L234 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 92 DAG size of output: 90 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:26:57,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:26:59,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:27:07,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:27:09,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:27:13,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:27:15,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:27:17,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:27:20,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:27:22,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:27:23,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:27:25,106 INFO L124 PetriNetUnfolderBase]: 3740/7219 cut-off events. [2023-08-27 09:27:25,106 INFO L125 PetriNetUnfolderBase]: For 80182/80254 co-relation queries the response was YES. [2023-08-27 09:27:25,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39172 conditions, 7219 events. 3740/7219 cut-off events. For 80182/80254 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 53394 event pairs, 1217 based on Foata normal form. 22/6579 useless extension candidates. Maximal degree in co-relation 39124. Up to 4621 conditions per place. [2023-08-27 09:27:25,150 INFO L140 encePairwiseOnDemand]: 463/485 looper letters, 278 selfloop transitions, 155 changer transitions 3/442 dead transitions. [2023-08-27 09:27:25,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 442 transitions, 5894 flow [2023-08-27 09:27:25,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-27 09:27:25,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-27 09:27:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4960 transitions. [2023-08-27 09:27:25,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37877052310042003 [2023-08-27 09:27:25,155 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4960 transitions. [2023-08-27 09:27:25,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4960 transitions. [2023-08-27 09:27:25,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:27:25,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4960 transitions. [2023-08-27 09:27:25,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 183.7037037037037) internal successors, (4960), 27 states have internal predecessors, (4960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:27:25,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 485.0) internal successors, (13580), 28 states have internal predecessors, (13580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:27:25,166 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 485.0) internal successors, (13580), 28 states have internal predecessors, (13580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:27:25,166 INFO L175 Difference]: Start difference. First operand has 174 places, 234 transitions, 2177 flow. Second operand 27 states and 4960 transitions. [2023-08-27 09:27:25,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 442 transitions, 5894 flow [2023-08-27 09:27:25,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 442 transitions, 5846 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 09:27:25,209 INFO L231 Difference]: Finished difference. Result has 206 places, 312 transitions, 3652 flow [2023-08-27 09:27:25,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=2141, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3652, PETRI_PLACES=206, PETRI_TRANSITIONS=312} [2023-08-27 09:27:25,210 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 147 predicate places. [2023-08-27 09:27:25,210 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 312 transitions, 3652 flow [2023-08-27 09:27:25,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:27:25,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:27:25,211 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:27:25,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-27 09:27:25,415 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,SelfDestructingSolverStorable16 [2023-08-27 09:27:25,415 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:27:25,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:27:25,415 INFO L85 PathProgramCache]: Analyzing trace with hash 556475951, now seen corresponding path program 4 times [2023-08-27 09:27:25,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:27:25,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242445115] [2023-08-27 09:27:25,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:27:25,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:27:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:27:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:27:26,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:27:26,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242445115] [2023-08-27 09:27:26,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242445115] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:27:26,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792933582] [2023-08-27 09:27:26,095 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 09:27:26,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:27:26,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:27:26,096 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-27 09:27:26,098 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-27 09:27:26,211 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 09:27:26,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 09:27:26,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-27 09:27:26,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:27:26,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:27:26,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:27:26,235 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 09:27:26,235 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-27 09:27:26,247 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 09:27:26,248 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-27 09:27:26,339 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 36 treesize of output 29 [2023-08-27 09:27:26,422 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 41 treesize of output 34 [2023-08-27 09:27:26,528 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 44 treesize of output 37 [2023-08-27 09:27:26,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:27:26,576 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 33 treesize of output 35 [2023-08-27 09:27:26,667 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 47 treesize of output 40 [2023-08-27 09:27:26,949 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 38 treesize of output 40 [2023-08-27 09:27:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:27:27,394 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:27:27,544 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_981)) |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_981) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-27 09:27:27,667 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_978 Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_978) .cse1 v_ArrVal_981)) |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_981) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_978) (< (select .cse3 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)))))) is different from false [2023-08-27 09:27:27,695 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_978 Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse4 v_ArrVal_978) .cse1 v_ArrVal_981)) |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_981) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_978) (< (select .cse3 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)))))) is different from false [2023-08-27 09:27:27,716 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_978 Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_976 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_976)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_978) .cse3 v_ArrVal_981)) |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_978) (< (+ (select .cse1 .cse3) 1) v_ArrVal_981) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-08-27 09:27:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-27 09:27:30,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792933582] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:27:30,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:27:30,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-27 09:27:30,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22586998] [2023-08-27 09:27:30,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:27:30,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-27 09:27:30,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:27:30,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-27 09:27:30,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=664, Unknown=27, NotChecked=244, Total=1190 [2023-08-27 09:27:30,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 09:27:30,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 312 transitions, 3652 flow. Second operand has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:27:30,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:27:30,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 09:27:30,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:27:43,655 WARN L234 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 87 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:27:45,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:27:47,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:27:49,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:27:51,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:27:55,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:27:55,911 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_981)) |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_981) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) .cse5) 2147483647)))))) (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) .cse5) 2147483647))))))) is different from false [2023-08-27 09:27:56,113 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_981)) |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_981) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) .cse3) 2147483647))))) (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_981)) |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (< (+ (select .cse4 .cse5) 1) v_ArrVal_981) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) .cse3) 2147483647))))))) is different from false [2023-08-27 09:27:57,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:27:59,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:27:59,451 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)))) (< (select .cse1 .cse2) 2147483647) (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2) 2147483647)))) is different from false [2023-08-27 09:28:01,039 INFO L124 PetriNetUnfolderBase]: 4502/8591 cut-off events. [2023-08-27 09:28:01,039 INFO L125 PetriNetUnfolderBase]: For 180165/181485 co-relation queries the response was YES. [2023-08-27 09:28:01,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58408 conditions, 8591 events. 4502/8591 cut-off events. For 180165/181485 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 65050 event pairs, 1519 based on Foata normal form. 35/7826 useless extension candidates. Maximal degree in co-relation 58351. Up to 3718 conditions per place. [2023-08-27 09:28:01,097 INFO L140 encePairwiseOnDemand]: 464/485 looper letters, 295 selfloop transitions, 219 changer transitions 3/523 dead transitions. [2023-08-27 09:28:01,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 523 transitions, 8485 flow [2023-08-27 09:28:01,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-27 09:28:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-27 09:28:01,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4606 transitions. [2023-08-27 09:28:01,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37987628865979384 [2023-08-27 09:28:01,102 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4606 transitions. [2023-08-27 09:28:01,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4606 transitions. [2023-08-27 09:28:01,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:28:01,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4606 transitions. [2023-08-27 09:28:01,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 184.24) internal successors, (4606), 25 states have internal predecessors, (4606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:01,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 485.0) internal successors, (12610), 26 states have internal predecessors, (12610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:01,112 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 485.0) internal successors, (12610), 26 states have internal predecessors, (12610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:01,112 INFO L175 Difference]: Start difference. First operand has 206 places, 312 transitions, 3652 flow. Second operand 25 states and 4606 transitions. [2023-08-27 09:28:01,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 523 transitions, 8485 flow [2023-08-27 09:28:01,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 523 transitions, 7796 flow, removed 309 selfloop flow, removed 10 redundant places. [2023-08-27 09:28:01,209 INFO L231 Difference]: Finished difference. Result has 232 places, 397 transitions, 5490 flow [2023-08-27 09:28:01,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=3207, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=5490, PETRI_PLACES=232, PETRI_TRANSITIONS=397} [2023-08-27 09:28:01,210 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 173 predicate places. [2023-08-27 09:28:01,210 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 397 transitions, 5490 flow [2023-08-27 09:28:01,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:01,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:28:01,211 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:28:01,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-27 09:28:01,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:28:01,415 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:28:01,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:28:01,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2097698344, now seen corresponding path program 1 times [2023-08-27 09:28:01,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:28:01,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848139366] [2023-08-27 09:28:01,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:28:01,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:28:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:28:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:28:01,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:28:01,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848139366] [2023-08-27 09:28:01,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848139366] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:28:01,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207783814] [2023-08-27 09:28:01,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:28:01,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:28:01,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:28:01,718 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-27 09:28:01,728 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-27 09:28:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:28:01,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-27 09:28:01,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:28:01,941 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 35 treesize of output 19 [2023-08-27 09:28:01,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:28:01,966 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 24 treesize of output 24 [2023-08-27 09:28:02,017 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-27 09:28:02,017 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2023-08-27 09:28:02,047 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 29 treesize of output 24 [2023-08-27 09:28:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:28:02,055 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:28:02,186 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:28:02,187 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 51 [2023-08-27 09:28:02,193 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:28:02,193 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 74 [2023-08-27 09:28:02,197 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 24 [2023-08-27 09:28:02,203 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 9 [2023-08-27 09:28:02,217 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:28:02,217 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 47 [2023-08-27 09:28:02,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:28:02,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207783814] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:28:02,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:28:02,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 22 [2023-08-27 09:28:02,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135024563] [2023-08-27 09:28:02,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:28:02,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-27 09:28:02,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:28:02,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-27 09:28:02,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=451, Unknown=5, NotChecked=0, Total=552 [2023-08-27 09:28:02,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 09:28:02,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 397 transitions, 5490 flow. Second operand has 24 states, 24 states have (on average 186.25) internal successors, (4470), 24 states have internal predecessors, (4470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:02,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:28:02,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 09:28:02,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:28:05,436 INFO L124 PetriNetUnfolderBase]: 6420/12274 cut-off events. [2023-08-27 09:28:05,437 INFO L125 PetriNetUnfolderBase]: For 527651/529808 co-relation queries the response was YES. [2023-08-27 09:28:05,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102120 conditions, 12274 events. 6420/12274 cut-off events. For 527651/529808 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 99672 event pairs, 2156 based on Foata normal form. 171/11348 useless extension candidates. Maximal degree in co-relation 102053. Up to 4560 conditions per place. [2023-08-27 09:28:05,536 INFO L140 encePairwiseOnDemand]: 470/485 looper letters, 448 selfloop transitions, 216 changer transitions 4/674 dead transitions. [2023-08-27 09:28:05,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 674 transitions, 11427 flow [2023-08-27 09:28:05,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-27 09:28:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-27 09:28:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3527 transitions. [2023-08-27 09:28:05,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40400916380297824 [2023-08-27 09:28:05,540 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3527 transitions. [2023-08-27 09:28:05,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3527 transitions. [2023-08-27 09:28:05,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:28:05,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3527 transitions. [2023-08-27 09:28:05,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 195.94444444444446) internal successors, (3527), 18 states have internal predecessors, (3527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:05,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 485.0) internal successors, (9215), 19 states have internal predecessors, (9215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:05,547 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 485.0) internal successors, (9215), 19 states have internal predecessors, (9215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:05,547 INFO L175 Difference]: Start difference. First operand has 232 places, 397 transitions, 5490 flow. Second operand 18 states and 3527 transitions. [2023-08-27 09:28:05,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 674 transitions, 11427 flow [2023-08-27 09:28:05,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 674 transitions, 10341 flow, removed 496 selfloop flow, removed 10 redundant places. [2023-08-27 09:28:05,782 INFO L231 Difference]: Finished difference. Result has 243 places, 483 transitions, 6678 flow [2023-08-27 09:28:05,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=4767, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6678, PETRI_PLACES=243, PETRI_TRANSITIONS=483} [2023-08-27 09:28:05,783 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 184 predicate places. [2023-08-27 09:28:05,783 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 483 transitions, 6678 flow [2023-08-27 09:28:05,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 186.25) internal successors, (4470), 24 states have internal predecessors, (4470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:05,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:28:05,783 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:28:05,789 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-27 09:28:05,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:28:05,988 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:28:05,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:28:05,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2097698327, now seen corresponding path program 1 times [2023-08-27 09:28:05,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:28:05,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910295218] [2023-08-27 09:28:05,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:28:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:28:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:28:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:28:06,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:28:06,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910295218] [2023-08-27 09:28:06,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910295218] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:28:06,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605787297] [2023-08-27 09:28:06,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:28:06,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:28:06,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:28:06,480 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-27 09:28:06,482 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-27 09:28:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:28:06,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 67 conjunts are in the unsatisfiable core [2023-08-27 09:28:06,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:28:06,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:28:06,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:28:06,624 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 09:28:06,624 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-27 09:28:06,630 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 09:28:06,631 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 09:28:06,701 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 36 treesize of output 29 [2023-08-27 09:28:06,747 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 32 treesize of output 27 [2023-08-27 09:28:06,827 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 44 treesize of output 37 [2023-08-27 09:28:06,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:28:06,861 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 33 treesize of output 35 [2023-08-27 09:28:06,928 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 47 treesize of output 40 [2023-08-27 09:28:07,010 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 43 treesize of output 38 [2023-08-27 09:28:07,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:28:07,116 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:28:07,173 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1169 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1168) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1169) .cse1) 2147483647)))) is different from false [2023-08-27 09:28:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:28:10,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605787297] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:28:10,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:28:10,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2023-08-27 09:28:10,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583718204] [2023-08-27 09:28:10,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:28:10,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-27 09:28:10,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:28:10,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-27 09:28:10,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=510, Unknown=18, NotChecked=50, Total=756 [2023-08-27 09:28:10,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 485 [2023-08-27 09:28:10,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 483 transitions, 6678 flow. Second operand has 28 states, 28 states have (on average 186.92857142857142) internal successors, (5234), 28 states have internal predecessors, (5234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:10,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:28:10,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 485 [2023-08-27 09:28:10,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:28:18,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:28:20,795 INFO L124 PetriNetUnfolderBase]: 7545/14374 cut-off events. [2023-08-27 09:28:20,796 INFO L125 PetriNetUnfolderBase]: For 621095/623484 co-relation queries the response was YES. [2023-08-27 09:28:20,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119611 conditions, 14374 events. 7545/14374 cut-off events. For 621095/623484 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 119747 event pairs, 4394 based on Foata normal form. 97/13153 useless extension candidates. Maximal degree in co-relation 119539. Up to 11470 conditions per place. [2023-08-27 09:28:20,931 INFO L140 encePairwiseOnDemand]: 464/485 looper letters, 532 selfloop transitions, 155 changer transitions 1/694 dead transitions. [2023-08-27 09:28:20,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 694 transitions, 11354 flow [2023-08-27 09:28:20,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-27 09:28:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-27 09:28:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4631 transitions. [2023-08-27 09:28:20,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978522336769759 [2023-08-27 09:28:20,951 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4631 transitions. [2023-08-27 09:28:20,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4631 transitions. [2023-08-27 09:28:20,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:28:20,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4631 transitions. [2023-08-27 09:28:20,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 192.95833333333334) internal successors, (4631), 24 states have internal predecessors, (4631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:20,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 485.0) internal successors, (12125), 25 states have internal predecessors, (12125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:20,973 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 485.0) internal successors, (12125), 25 states have internal predecessors, (12125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:20,973 INFO L175 Difference]: Start difference. First operand has 243 places, 483 transitions, 6678 flow. Second operand 24 states and 4631 transitions. [2023-08-27 09:28:20,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 694 transitions, 11354 flow [2023-08-27 09:28:21,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 694 transitions, 10954 flow, removed 196 selfloop flow, removed 4 redundant places. [2023-08-27 09:28:21,363 INFO L231 Difference]: Finished difference. Result has 272 places, 567 transitions, 8431 flow [2023-08-27 09:28:21,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=6362, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=8431, PETRI_PLACES=272, PETRI_TRANSITIONS=567} [2023-08-27 09:28:21,364 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 213 predicate places. [2023-08-27 09:28:21,364 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 567 transitions, 8431 flow [2023-08-27 09:28:21,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 186.92857142857142) internal successors, (5234), 28 states have internal predecessors, (5234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:21,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:28:21,364 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:28:21,378 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-27 09:28:21,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:28:21,569 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:28:21,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:28:21,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1785928179, now seen corresponding path program 1 times [2023-08-27 09:28:21,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:28:21,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641744283] [2023-08-27 09:28:21,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:28:21,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:28:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:28:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:28:22,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:28:22,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641744283] [2023-08-27 09:28:22,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641744283] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:28:22,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102872541] [2023-08-27 09:28:22,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:28:22,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:28:22,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:28:22,078 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 09:28:22,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-27 09:28:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:28:22,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 74 conjunts are in the unsatisfiable core [2023-08-27 09:28:22,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:28:22,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:28:22,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:28:22,246 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 09:28:22,246 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-27 09:28:22,259 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 09:28:22,259 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-27 09:28:22,346 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 36 treesize of output 29 [2023-08-27 09:28:22,387 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 32 treesize of output 27 [2023-08-27 09:28:22,434 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 30 treesize of output 32 [2023-08-27 09:28:22,545 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 44 treesize of output 37 [2023-08-27 09:28:22,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:28:22,591 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 33 treesize of output 35 [2023-08-27 09:28:22,678 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 47 treesize of output 40 [2023-08-27 09:28:22,759 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 43 treesize of output 38 [2023-08-27 09:28:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:28:22,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:28:23,011 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1276 Int) (v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1278 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1276)) |c_~#stored_elements~0.base| v_ArrVal_1277) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1278) .cse1) 2147483647) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1276)))) is different from false [2023-08-27 09:28:23,025 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1276 Int) (v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1278 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1276)) |c_~#stored_elements~0.base| v_ArrVal_1277) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1278) .cse1) 2147483647) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1276))))) is different from false [2023-08-27 09:28:23,100 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1272 Int) (v_ArrVal_1276 Int) (v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1278 Int) (v_ArrVal_1274 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1272)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1274))) (let ((.cse0 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1276)) |c_~#stored_elements~0.base| v_ArrVal_1277) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1276) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1278) .cse3) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|)))))) is different from false [2023-08-27 09:28:23,136 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1272 Int) (v_ArrVal_1276 Int) (v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1278 Int) (v_ArrVal_1274 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1270) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1272)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1274))) (let ((.cse2 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1276)) |c_~#stored_elements~0.base| v_ArrVal_1277) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1276) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1278) .cse1) 2147483647)))))) is different from false [2023-08-27 09:28:23,156 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1272 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (v_ArrVal_1276 Int) (v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1278 Int) (v_ArrVal_1274 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_1270) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1272)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1274))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1276)) |c_~#stored_elements~0.base| v_ArrVal_1277) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1276) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1278) .cse1) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|))))))) is different from false [2023-08-27 09:28:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-08-27 09:28:23,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102872541] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:28:23,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:28:23,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2023-08-27 09:28:23,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229764879] [2023-08-27 09:28:23,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:28:23,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-27 09:28:23,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:28:23,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-27 09:28:23,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=466, Unknown=13, NotChecked=260, Total=930 [2023-08-27 09:28:23,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 485 [2023-08-27 09:28:23,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 567 transitions, 8431 flow. Second operand has 31 states, 31 states have (on average 182.83870967741936) internal successors, (5668), 31 states have internal predecessors, (5668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:23,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:28:23,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 485 [2023-08-27 09:28:23,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:28:27,953 INFO L124 PetriNetUnfolderBase]: 7678/14957 cut-off events. [2023-08-27 09:28:27,953 INFO L125 PetriNetUnfolderBase]: For 586766/587150 co-relation queries the response was YES. [2023-08-27 09:28:28,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120799 conditions, 14957 events. 7678/14957 cut-off events. For 586766/587150 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 126505 event pairs, 3103 based on Foata normal form. 322/13966 useless extension candidates. Maximal degree in co-relation 120718. Up to 10496 conditions per place. [2023-08-27 09:28:28,162 INFO L140 encePairwiseOnDemand]: 465/485 looper letters, 539 selfloop transitions, 125 changer transitions 3/673 dead transitions. [2023-08-27 09:28:28,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 673 transitions, 11888 flow [2023-08-27 09:28:28,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-27 09:28:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-27 09:28:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3255 transitions. [2023-08-27 09:28:28,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3947847180109157 [2023-08-27 09:28:28,165 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3255 transitions. [2023-08-27 09:28:28,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3255 transitions. [2023-08-27 09:28:28,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:28:28,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3255 transitions. [2023-08-27 09:28:28,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 191.47058823529412) internal successors, (3255), 17 states have internal predecessors, (3255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:28,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 485.0) internal successors, (8730), 18 states have internal predecessors, (8730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:28,172 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 485.0) internal successors, (8730), 18 states have internal predecessors, (8730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:28,172 INFO L175 Difference]: Start difference. First operand has 272 places, 567 transitions, 8431 flow. Second operand 17 states and 3255 transitions. [2023-08-27 09:28:28,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 673 transitions, 11888 flow [2023-08-27 09:28:28,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 673 transitions, 11683 flow, removed 87 selfloop flow, removed 9 redundant places. [2023-08-27 09:28:28,688 INFO L231 Difference]: Finished difference. Result has 287 places, 555 transitions, 8461 flow [2023-08-27 09:28:28,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=7704, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=8461, PETRI_PLACES=287, PETRI_TRANSITIONS=555} [2023-08-27 09:28:28,689 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 228 predicate places. [2023-08-27 09:28:28,689 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 555 transitions, 8461 flow [2023-08-27 09:28:28,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 182.83870967741936) internal successors, (5668), 31 states have internal predecessors, (5668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:28,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:28:28,690 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:28:28,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-27 09:28:28,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-27 09:28:28,895 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:28:28,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:28:28,896 INFO L85 PathProgramCache]: Analyzing trace with hash 2041639567, now seen corresponding path program 1 times [2023-08-27 09:28:28,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:28:28,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950196720] [2023-08-27 09:28:28,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:28:28,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:28:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:28:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:28:29,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:28:29,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950196720] [2023-08-27 09:28:29,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950196720] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:28:29,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157903215] [2023-08-27 09:28:29,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:28:29,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:28:29,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:28:29,532 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 09:28:29,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-27 09:28:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:28:29,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 54 conjunts are in the unsatisfiable core [2023-08-27 09:28:29,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:28:29,676 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 09:28:29,677 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-27 09:28:29,816 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 43 treesize of output 21 [2023-08-27 09:28:29,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:28:29,846 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 28 treesize of output 28 [2023-08-27 09:28:29,899 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 37 treesize of output 35 [2023-08-27 09:28:29,935 INFO L322 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-08-27 09:28:29,936 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 33 [2023-08-27 09:28:29,967 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 35 treesize of output 28 [2023-08-27 09:28:29,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:28:29,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:28:30,037 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1370 Int) (v_ArrVal_1369 (Array Int Int))) (< 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1369) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1370) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483650))) is different from false [2023-08-27 09:28:30,043 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1370 Int) (v_ArrVal_1369 (Array Int Int))) (< 0 (+ 2147483650 (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1369) |c_~#queue~0.base|) (+ (* (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_1370) .cse0))))) is different from false [2023-08-27 09:28:30,049 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1370 Int) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1368 (Array Int Int))) (< 0 (+ (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1368))) (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1369) |c_~#queue~0.base|) (+ (* (select (select .cse0 |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1370)) .cse1)) 2147483650))) is different from false [2023-08-27 09:28:30,133 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:28:30,133 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 54 [2023-08-27 09:28:30,185 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:28:30,185 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 262 treesize of output 254 [2023-08-27 09:28:30,193 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 134 treesize of output 126 [2023-08-27 09:28:30,200 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 74 treesize of output 54 [2023-08-27 09:28:30,211 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 9 [2023-08-27 09:28:30,260 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:28:30,260 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 79 [2023-08-27 09:28:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-27 09:28:30,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157903215] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:28:30,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:28:30,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-08-27 09:28:30,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659820323] [2023-08-27 09:28:30,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:28:30,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-27 09:28:30,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:28:30,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-27 09:28:30,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=540, Unknown=3, NotChecked=150, Total=812 [2023-08-27 09:28:30,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 485 [2023-08-27 09:28:30,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 555 transitions, 8461 flow. Second operand has 29 states, 29 states have (on average 183.06896551724137) internal successors, (5309), 29 states have internal predecessors, (5309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:30,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:28:30,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 485 [2023-08-27 09:28:30,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:28:41,332 INFO L124 PetriNetUnfolderBase]: 9101/17912 cut-off events. [2023-08-27 09:28:41,333 INFO L125 PetriNetUnfolderBase]: For 736620/737102 co-relation queries the response was YES. [2023-08-27 09:28:41,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146852 conditions, 17912 events. 9101/17912 cut-off events. For 736620/737102 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 151316 event pairs, 3348 based on Foata normal form. 367/16641 useless extension candidates. Maximal degree in co-relation 146763. Up to 6323 conditions per place. [2023-08-27 09:28:41,658 INFO L140 encePairwiseOnDemand]: 472/485 looper letters, 473 selfloop transitions, 223 changer transitions 3/705 dead transitions. [2023-08-27 09:28:41,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 705 transitions, 12381 flow [2023-08-27 09:28:41,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-27 09:28:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-27 09:28:41,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3105 transitions. [2023-08-27 09:28:41,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40012886597938147 [2023-08-27 09:28:41,667 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3105 transitions. [2023-08-27 09:28:41,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3105 transitions. [2023-08-27 09:28:41,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:28:41,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3105 transitions. [2023-08-27 09:28:41,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 194.0625) internal successors, (3105), 16 states have internal predecessors, (3105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:41,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 485.0) internal successors, (8245), 17 states have internal predecessors, (8245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:41,708 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 485.0) internal successors, (8245), 17 states have internal predecessors, (8245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:41,708 INFO L175 Difference]: Start difference. First operand has 287 places, 555 transitions, 8461 flow. Second operand 16 states and 3105 transitions. [2023-08-27 09:28:41,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 705 transitions, 12381 flow [2023-08-27 09:28:42,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 705 transitions, 11986 flow, removed 108 selfloop flow, removed 11 redundant places. [2023-08-27 09:28:42,242 INFO L231 Difference]: Finished difference. Result has 290 places, 563 transitions, 9052 flow [2023-08-27 09:28:42,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=7800, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=192, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=9052, PETRI_PLACES=290, PETRI_TRANSITIONS=563} [2023-08-27 09:28:42,243 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 231 predicate places. [2023-08-27 09:28:42,243 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 563 transitions, 9052 flow [2023-08-27 09:28:42,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 183.06896551724137) internal successors, (5309), 29 states have internal predecessors, (5309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:42,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:28:42,244 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:28:42,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-27 09:28:42,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-27 09:28:42,449 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:28:42,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:28:42,449 INFO L85 PathProgramCache]: Analyzing trace with hash -793926021, now seen corresponding path program 1 times [2023-08-27 09:28:42,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:28:42,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159463963] [2023-08-27 09:28:42,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:28:42,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:28:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:28:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 09:28:42,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:28:42,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159463963] [2023-08-27 09:28:42,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159463963] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:28:42,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:28:42,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:28:42,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33075324] [2023-08-27 09:28:42,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:28:42,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 09:28:42,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:28:42,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 09:28:42,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 09:28:42,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 09:28:42,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 563 transitions, 9052 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:42,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:28:42,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 09:28:42,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:28:46,312 INFO L124 PetriNetUnfolderBase]: 8724/17430 cut-off events. [2023-08-27 09:28:46,312 INFO L125 PetriNetUnfolderBase]: For 637263/637663 co-relation queries the response was YES. [2023-08-27 09:28:46,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137806 conditions, 17430 events. 8724/17430 cut-off events. For 637263/637663 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 149028 event pairs, 5292 based on Foata normal form. 37/16067 useless extension candidates. Maximal degree in co-relation 137715. Up to 11189 conditions per place. [2023-08-27 09:28:46,729 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 447 selfloop transitions, 68 changer transitions 0/546 dead transitions. [2023-08-27 09:28:46,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 546 transitions, 9912 flow [2023-08-27 09:28:46,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 09:28:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 09:28:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 737 transitions. [2023-08-27 09:28:46,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5065292096219931 [2023-08-27 09:28:46,730 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 737 transitions. [2023-08-27 09:28:46,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 737 transitions. [2023-08-27 09:28:46,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:28:46,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 737 transitions. [2023-08-27 09:28:46,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:46,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:46,732 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:46,732 INFO L175 Difference]: Start difference. First operand has 290 places, 563 transitions, 9052 flow. Second operand 3 states and 737 transitions. [2023-08-27 09:28:46,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 546 transitions, 9912 flow [2023-08-27 09:28:47,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 546 transitions, 9536 flow, removed 119 selfloop flow, removed 9 redundant places. [2023-08-27 09:28:47,303 INFO L231 Difference]: Finished difference. Result has 282 places, 539 transitions, 8456 flow [2023-08-27 09:28:47,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=8320, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=8456, PETRI_PLACES=282, PETRI_TRANSITIONS=539} [2023-08-27 09:28:47,304 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 223 predicate places. [2023-08-27 09:28:47,304 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 539 transitions, 8456 flow [2023-08-27 09:28:47,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:47,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:28:47,304 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 09:28:47,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-27 09:28:47,304 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:28:47,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:28:47,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1548569773, now seen corresponding path program 1 times [2023-08-27 09:28:47,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:28:47,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964284870] [2023-08-27 09:28:47,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:28:47,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:28:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:28:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:28:47,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:28:47,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964284870] [2023-08-27 09:28:47,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964284870] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:28:47,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:28:47,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:28:47,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777713345] [2023-08-27 09:28:47,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:28:47,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 09:28:47,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:28:47,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 09:28:47,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 09:28:47,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 09:28:47,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 539 transitions, 8456 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:47,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:28:47,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 09:28:47,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:28:50,917 INFO L124 PetriNetUnfolderBase]: 8460/16983 cut-off events. [2023-08-27 09:28:50,918 INFO L125 PetriNetUnfolderBase]: For 615977/616297 co-relation queries the response was YES. [2023-08-27 09:28:51,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131748 conditions, 16983 events. 8460/16983 cut-off events. For 615977/616297 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 145324 event pairs, 5341 based on Foata normal form. 285/16004 useless extension candidates. Maximal degree in co-relation 131660. Up to 15671 conditions per place. [2023-08-27 09:28:51,090 INFO L140 encePairwiseOnDemand]: 483/485 looper letters, 487 selfloop transitions, 1 changer transitions 3/522 dead transitions. [2023-08-27 09:28:51,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 522 transitions, 9231 flow [2023-08-27 09:28:51,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 09:28:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 09:28:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 738 transitions. [2023-08-27 09:28:51,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072164948453608 [2023-08-27 09:28:51,091 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 738 transitions. [2023-08-27 09:28:51,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 738 transitions. [2023-08-27 09:28:51,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:28:51,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 738 transitions. [2023-08-27 09:28:51,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:51,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:51,093 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:51,093 INFO L175 Difference]: Start difference. First operand has 282 places, 539 transitions, 8456 flow. Second operand 3 states and 738 transitions. [2023-08-27 09:28:51,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 522 transitions, 9231 flow [2023-08-27 09:28:51,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 522 transitions, 9140 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-27 09:28:51,526 INFO L231 Difference]: Finished difference. Result has 280 places, 514 transitions, 7999 flow [2023-08-27 09:28:51,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=7997, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7999, PETRI_PLACES=280, PETRI_TRANSITIONS=514} [2023-08-27 09:28:51,527 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 221 predicate places. [2023-08-27 09:28:51,527 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 514 transitions, 7999 flow [2023-08-27 09:28:51,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:51,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:28:51,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:28:51,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-27 09:28:51,527 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:28:51,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:28:51,528 INFO L85 PathProgramCache]: Analyzing trace with hash -166271194, now seen corresponding path program 1 times [2023-08-27 09:28:51,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:28:51,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769302098] [2023-08-27 09:28:51,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:28:51,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:28:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:28:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 09:28:51,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:28:51,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769302098] [2023-08-27 09:28:51,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769302098] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:28:51,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:28:51,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 09:28:51,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064449875] [2023-08-27 09:28:51,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:28:51,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 09:28:51,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:28:51,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 09:28:51,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 09:28:51,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 485 [2023-08-27 09:28:51,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 514 transitions, 7999 flow. Second operand has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:51,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:28:51,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 485 [2023-08-27 09:28:51,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:28:54,389 INFO L124 PetriNetUnfolderBase]: 6683/13799 cut-off events. [2023-08-27 09:28:54,390 INFO L125 PetriNetUnfolderBase]: For 481976/481994 co-relation queries the response was YES. [2023-08-27 09:28:54,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92969 conditions, 13799 events. 6683/13799 cut-off events. For 481976/481994 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 109694 event pairs, 692 based on Foata normal form. 773/13384 useless extension candidates. Maximal degree in co-relation 92882. Up to 11939 conditions per place. [2023-08-27 09:28:54,526 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 453 selfloop transitions, 4 changer transitions 0/486 dead transitions. [2023-08-27 09:28:54,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 486 transitions, 8698 flow [2023-08-27 09:28:54,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 09:28:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 09:28:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2023-08-27 09:28:54,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5003436426116838 [2023-08-27 09:28:54,528 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 728 transitions. [2023-08-27 09:28:54,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 728 transitions. [2023-08-27 09:28:54,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:28:54,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 728 transitions. [2023-08-27 09:28:54,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:54,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:54,530 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:54,530 INFO L175 Difference]: Start difference. First operand has 280 places, 514 transitions, 7999 flow. Second operand 3 states and 728 transitions. [2023-08-27 09:28:54,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 486 transitions, 8698 flow [2023-08-27 09:28:54,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 486 transitions, 8697 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 09:28:54,887 INFO L231 Difference]: Finished difference. Result has 281 places, 475 transitions, 7599 flow [2023-08-27 09:28:54,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=7591, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7599, PETRI_PLACES=281, PETRI_TRANSITIONS=475} [2023-08-27 09:28:54,888 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 222 predicate places. [2023-08-27 09:28:54,888 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 475 transitions, 7599 flow [2023-08-27 09:28:54,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:54,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:28:54,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:28:54,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-27 09:28:54,889 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:28:54,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:28:54,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1896232006, now seen corresponding path program 1 times [2023-08-27 09:28:54,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:28:54,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811595610] [2023-08-27 09:28:54,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:28:54,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:28:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:28:54,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:28:54,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:28:54,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811595610] [2023-08-27 09:28:54,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811595610] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:28:54,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349403082] [2023-08-27 09:28:54,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:28:54,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:28:54,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:28:54,985 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 09:28:54,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-27 09:28:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:28:55,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-27 09:28:55,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:28:55,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:28:55,152 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:28:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:28:55,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349403082] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:28:55,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:28:55,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-27 09:28:55,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065512250] [2023-08-27 09:28:55,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:28:55,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 09:28:55,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:28:55,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 09:28:55,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-27 09:28:55,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 09:28:55,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 475 transitions, 7599 flow. Second operand has 7 states, 7 states have (on average 233.42857142857142) internal successors, (1634), 7 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:55,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:28:55,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 09:28:55,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:28:57,000 INFO L124 PetriNetUnfolderBase]: 4016/8538 cut-off events. [2023-08-27 09:28:57,001 INFO L125 PetriNetUnfolderBase]: For 290517/290585 co-relation queries the response was YES. [2023-08-27 09:28:57,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64935 conditions, 8538 events. 4016/8538 cut-off events. For 290517/290585 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 61180 event pairs, 2739 based on Foata normal form. 122/7939 useless extension candidates. Maximal degree in co-relation 64848. Up to 5776 conditions per place. [2023-08-27 09:28:57,105 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 445 selfloop transitions, 43 changer transitions 0/519 dead transitions. [2023-08-27 09:28:57,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 519 transitions, 9499 flow [2023-08-27 09:28:57,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 09:28:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 09:28:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2023-08-27 09:28:57,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5003436426116838 [2023-08-27 09:28:57,106 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1456 transitions. [2023-08-27 09:28:57,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1456 transitions. [2023-08-27 09:28:57,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:28:57,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1456 transitions. [2023-08-27 09:28:57,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 242.66666666666666) internal successors, (1456), 6 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:57,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:57,109 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:57,109 INFO L175 Difference]: Start difference. First operand has 281 places, 475 transitions, 7599 flow. Second operand 6 states and 1456 transitions. [2023-08-27 09:28:57,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 519 transitions, 9499 flow [2023-08-27 09:28:57,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 519 transitions, 9449 flow, removed 23 selfloop flow, removed 1 redundant places. [2023-08-27 09:28:57,423 INFO L231 Difference]: Finished difference. Result has 289 places, 467 transitions, 7605 flow [2023-08-27 09:28:57,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=7239, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7605, PETRI_PLACES=289, PETRI_TRANSITIONS=467} [2023-08-27 09:28:57,424 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 230 predicate places. [2023-08-27 09:28:57,424 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 467 transitions, 7605 flow [2023-08-27 09:28:57,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 233.42857142857142) internal successors, (1634), 7 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:57,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:28:57,425 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:28:57,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-27 09:28:57,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-27 09:28:57,630 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:28:57,630 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:28:57,630 INFO L85 PathProgramCache]: Analyzing trace with hash 339738295, now seen corresponding path program 1 times [2023-08-27 09:28:57,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:28:57,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720880282] [2023-08-27 09:28:57,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:28:57,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:28:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:28:58,597 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:28:58,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:28:58,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720880282] [2023-08-27 09:28:58,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720880282] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:28:58,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472651203] [2023-08-27 09:28:58,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:28:58,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:28:58,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:28:58,599 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 09:28:58,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-27 09:28:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:28:58,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 96 conjunts are in the unsatisfiable core [2023-08-27 09:28:58,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:28:58,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:28:58,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:28:58,769 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 09:28:58,769 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-27 09:28:58,781 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 09:28:58,781 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-27 09:28:58,869 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 36 treesize of output 29 [2023-08-27 09:28:58,946 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 41 treesize of output 34 [2023-08-27 09:28:59,066 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 44 treesize of output 37 [2023-08-27 09:28:59,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:28:59,116 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 33 treesize of output 35 [2023-08-27 09:28:59,192 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 47 treesize of output 40 [2023-08-27 09:28:59,491 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 52 treesize of output 45 [2023-08-27 09:28:59,787 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 55 treesize of output 48 [2023-08-27 09:29:02,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:29:02,416 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 44 treesize of output 46 [2023-08-27 09:29:04,454 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 51 treesize of output 51 [2023-08-27 09:29:04,675 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 58 treesize of output 51 [2023-08-27 09:29:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:29:11,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:29:11,209 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1708 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_1706 (Array Int Int))) (or (< (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1706) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1708) (+ 3208 |c_~#queue~0.offset|)) 2147483647))) is different from false [2023-08-27 09:29:11,528 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1708 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1705 (Array Int Int)) (v_ArrVal_1702 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_1702) .cse1 v_ArrVal_1704)) |c_~#stored_elements~0.base| v_ArrVal_1705))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1704) (< (select (store (select (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1706) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1708) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select (select .cse2 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1702))))) is different from false [2023-08-27 09:29:11,557 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1708 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_1700 Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1705 (Array Int Int)) (v_ArrVal_1702 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1700)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_1702) .cse2 v_ArrVal_1704)) |c_~#stored_elements~0.base| v_ArrVal_1705))) (or (< (select (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1704) (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1706) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1708) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1702))))) is different from false [2023-08-27 09:29:18,386 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1708 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_1696 Int) (v_ArrVal_1700 Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1705 (Array Int Int)) (v_ArrVal_1702 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1696)) |c_~#stored_elements~0.base| v_ArrVal_1698))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_1700)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_1702) .cse1 v_ArrVal_1704)) |c_~#stored_elements~0.base| v_ArrVal_1705))) (or (< (select (select .cse0 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1706) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1708) .cse2) 2147483647) (< (+ 1 (select .cse3 .cse1)) v_ArrVal_1704) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1696) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1702) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101|))))))) is different from false [2023-08-27 09:29:18,417 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1708 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_1696 Int) (v_ArrVal_1700 Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1705 (Array Int Int)) (v_ArrVal_1702 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1696)) |c_~#stored_elements~0.base| v_ArrVal_1698))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_1700)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_1702) .cse1 v_ArrVal_1704)) |c_~#stored_elements~0.base| v_ArrVal_1705))) (or (< (select (select .cse0 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1696) (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1706) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1708) .cse4) 2147483647) (< (+ 1 (select .cse5 .cse1)) v_ArrVal_1704) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1702) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101|)))))))) is different from false [2023-08-27 09:29:18,483 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1708 Int) (v_ArrVal_1695 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_1696 Int) (v_ArrVal_1700 Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1705 (Array Int Int)) (v_ArrVal_1702 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1695) .cse3 v_ArrVal_1696)) |c_~#stored_elements~0.base| v_ArrVal_1698))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_1700)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_1702) .cse1 v_ArrVal_1704)) |c_~#stored_elements~0.base| v_ArrVal_1705))) (or (< (select (select .cse0 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1696) (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1706) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1708) .cse4) 2147483647) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1702) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1704) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1695)))))))) is different from false [2023-08-27 09:29:18,523 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1708 Int) (v_ArrVal_1695 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_1696 Int) (v_ArrVal_1700 Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1705 (Array Int Int)) (v_ArrVal_1702 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse4 v_ArrVal_1695) .cse3 v_ArrVal_1696)) |c_~#stored_elements~0.base| v_ArrVal_1698))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_1700)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_1702) .cse1 v_ArrVal_1704)) |c_~#stored_elements~0.base| v_ArrVal_1705))) (or (< (select (select .cse0 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1696) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1695) (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1706) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1708) .cse5) 2147483647) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1702) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101|) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1704)))))))) is different from false [2023-08-27 09:29:18,576 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1708 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_1693 Int) (v_ArrVal_1695 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int) (v_ArrVal_1696 Int) (v_ArrVal_1700 Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1705 (Array Int Int)) (v_ArrVal_1702 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1693)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse7 v_ArrVal_1695) .cse5 v_ArrVal_1696)) |c_~#stored_elements~0.base| v_ArrVal_1698))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_1700)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_1702) .cse1 v_ArrVal_1704)) |c_~#stored_elements~0.base| v_ArrVal_1705))) (or (< (select (select .cse0 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1706) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1708) .cse2) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1704) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1696) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101|) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1702) (< (+ (select .cse4 .cse7) 1) v_ArrVal_1695)))))))) is different from false [2023-08-27 09:29:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 12 not checked. [2023-08-27 09:29:27,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472651203] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:29:27,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:29:27,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2023-08-27 09:29:27,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535148985] [2023-08-27 09:29:27,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:29:27,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-08-27 09:29:27,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:29:27,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-08-27 09:29:27,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=1566, Unknown=54, NotChecked=760, Total=2862 [2023-08-27 09:29:27,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 09:29:27,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 467 transitions, 7605 flow. Second operand has 54 states, 54 states have (on average 176.38888888888889) internal successors, (9525), 54 states have internal predecessors, (9525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:29:27,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:29:27,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 09:29:27,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:29:34,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:29:37,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:29:41,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:29:44,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:29:56,036 WARN L234 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 124 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:29:58,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:30:00,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:30:13,899 WARN L234 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 118 DAG size of output: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:30:15,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:30:22,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:30:24,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:30:34,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:30:52,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:30:54,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:31:03,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:31:09,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:31:18,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:31:43,114 WARN L234 SmtUtils]: Spent 12.37s on a formula simplification. DAG size of input: 136 DAG size of output: 113 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:31:49,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:31:51,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:31:53,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:31:56,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:31:58,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:32:00,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:32:02,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:32:04,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:32:06,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:32:08,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:32:10,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:32:16,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:32:18,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:32:20,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:32:22,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:32:24,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:32:42,873 WARN L234 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 102 DAG size of output: 97 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:32:45,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:32:47,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:32:49,347 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1704 Int) (v_ArrVal_1708 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1705 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1704)) |c_~#stored_elements~0.base| v_ArrVal_1705))) (or (< .cse0 v_ArrVal_1704) (< (select (select .cse1 |c_~#queue~0.base|) .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (select (store (select (store .cse1 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1706) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1708) .cse3) 2147483647)))) (forall ((v_ArrVal_1704 Int) (v_ArrVal_1708 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1705 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1704)) |c_~#stored_elements~0.base| v_ArrVal_1705))) (or (< (+ (select .cse4 .cse5) 1) v_ArrVal_1704) (< (select (select .cse6 |c_~#queue~0.base|) .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (select (store (select (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1706) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1708) .cse3) 2147483647)))) (forall ((v_ArrVal_1704 Int) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1708 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_1696 Int) (v_ArrVal_1700 Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1705 (Array Int Int)) (v_ArrVal_1702 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1696)) |c_~#stored_elements~0.base| v_ArrVal_1698))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_1700))) (let ((.cse7 (store (store .cse10 |c_~#queue~0.base| (store (store .cse8 .cse3 v_ArrVal_1702) .cse2 v_ArrVal_1704)) |c_~#stored_elements~0.base| v_ArrVal_1705))) (or (< (select (select .cse7 |c_~#queue~0.base|) .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (select (store (select (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1706) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1708) .cse3) 2147483647) (< (+ 1 (select .cse8 .cse2)) v_ArrVal_1704) (< .cse0 v_ArrVal_1696) (< (+ (select .cse8 .cse3) 1) v_ArrVal_1702) (< (select .cse9 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101|))))))))) is different from false [2023-08-27 09:32:51,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:32:55,961 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1704 Int) (v_ArrVal_1708 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1705 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1704)) |c_~#stored_elements~0.base| v_ArrVal_1705))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1704) (< (select (select .cse0 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1706) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1708) .cse2) 2147483647)))) (forall ((v_ArrVal_1704 Int) (v_ArrVal_1708 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1705 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1704)) |c_~#stored_elements~0.base| v_ArrVal_1705))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_1704) (< (select (select .cse5 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (select (store (select (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1706) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1708) .cse2) 2147483647)))))) is different from false [2023-08-27 09:33:02,467 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1708 Int) (v_ArrVal_1706 (Array Int Int))) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1706) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0 v_ArrVal_1708) .cse1) 2147483647)) (forall ((v_ArrVal_1704 Int) (v_ArrVal_1708 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_1700 Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1705 (Array Int Int)) (v_ArrVal_1702 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0 v_ArrVal_1700)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse1 v_ArrVal_1702) .cse5 v_ArrVal_1704)) |c_~#stored_elements~0.base| v_ArrVal_1705))) (or (< (select (select .cse2 |c_~#queue~0.base|) .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1704) (< (select (store (select (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1706) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1708) .cse6) 2147483647) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1702))))) (forall ((v_ArrVal_1704 Int) (v_ArrVal_1708 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_1700 Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1705 (Array Int Int)) (v_ArrVal_1702 Int)) (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_1700))) (let ((.cse9 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_1702) .cse3 v_ArrVal_1704)) |c_~#stored_elements~0.base| v_ArrVal_1705))) (or (< (+ (select .cse7 .cse6) 1) v_ArrVal_1702) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101|) (< (+ (select .cse7 .cse3) 1) v_ArrVal_1704) (< (select (select .cse9 |c_~#queue~0.base|) .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (< (select (store (select (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1706) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_1708) .cse6) 2147483647)))))))) is different from false [2023-08-27 09:33:03,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:33:05,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:33:07,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:33:09,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:33:11,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:33:13,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:33:15,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:33:18,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:33:20,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:33:22,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:33:24,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:33:26,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:33:28,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:33:30,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:33:32,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:33:35,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:33:37,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:33:38,887 INFO L124 PetriNetUnfolderBase]: 4262/9100 cut-off events. [2023-08-27 09:33:38,887 INFO L125 PetriNetUnfolderBase]: For 311353/311403 co-relation queries the response was YES. [2023-08-27 09:33:38,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71723 conditions, 9100 events. 4262/9100 cut-off events. For 311353/311403 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 65530 event pairs, 2544 based on Foata normal form. 28/8441 useless extension candidates. Maximal degree in co-relation 71632. Up to 6672 conditions per place. [2023-08-27 09:33:38,987 INFO L140 encePairwiseOnDemand]: 468/485 looper letters, 305 selfloop transitions, 374 changer transitions 3/688 dead transitions. [2023-08-27 09:33:38,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 688 transitions, 14811 flow [2023-08-27 09:33:38,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-08-27 09:33:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-08-27 09:33:38,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 7778 transitions. [2023-08-27 09:33:38,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3729561256293455 [2023-08-27 09:33:38,993 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 7778 transitions. [2023-08-27 09:33:38,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 7778 transitions. [2023-08-27 09:33:38,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:33:38,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 7778 transitions. [2023-08-27 09:33:38,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 180.88372093023256) internal successors, (7778), 43 states have internal predecessors, (7778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:33:39,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 485.0) internal successors, (21340), 44 states have internal predecessors, (21340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:33:39,009 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 485.0) internal successors, (21340), 44 states have internal predecessors, (21340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:33:39,009 INFO L175 Difference]: Start difference. First operand has 289 places, 467 transitions, 7605 flow. Second operand 43 states and 7778 transitions. [2023-08-27 09:33:39,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 688 transitions, 14811 flow [2023-08-27 09:33:39,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 688 transitions, 14767 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-08-27 09:33:39,242 INFO L231 Difference]: Finished difference. Result has 349 places, 590 transitions, 11497 flow [2023-08-27 09:33:39,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=7554, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=268, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=11497, PETRI_PLACES=349, PETRI_TRANSITIONS=590} [2023-08-27 09:33:39,243 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 290 predicate places. [2023-08-27 09:33:39,243 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 590 transitions, 11497 flow [2023-08-27 09:33:39,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 176.38888888888889) internal successors, (9525), 54 states have internal predecessors, (9525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:33:39,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:33:39,244 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 09:33:39,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-27 09:33:39,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-27 09:33:39,450 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:33:39,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:33:39,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1681186108, now seen corresponding path program 2 times [2023-08-27 09:33:39,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:33:39,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477202531] [2023-08-27 09:33:39,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:33:39,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:33:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:33:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:33:40,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:33:40,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477202531] [2023-08-27 09:33:40,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477202531] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:33:40,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234451839] [2023-08-27 09:33:40,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 09:33:40,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:33:40,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:33:40,159 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 09:33:40,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-27 09:33:40,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 09:33:40,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 09:33:40,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 85 conjunts are in the unsatisfiable core [2023-08-27 09:33:40,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:33:40,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:33:40,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:33:40,360 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 09:33:40,360 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-27 09:33:40,370 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 09:33:40,370 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-27 09:33:40,450 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 36 treesize of output 29 [2023-08-27 09:33:40,497 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 32 treesize of output 27 [2023-08-27 09:33:40,602 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 44 treesize of output 37 [2023-08-27 09:33:40,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:33:40,646 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 33 treesize of output 35 [2023-08-27 09:33:40,724 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 47 treesize of output 40 [2023-08-27 09:33:40,888 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 43 treesize of output 38 [2023-08-27 09:33:40,987 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 39 treesize of output 35 [2023-08-27 09:33:41,057 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-27 09:33:41,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:33:41,110 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 44 treesize of output 46 [2023-08-27 09:33:41,212 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-27 09:33:41,213 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 1 case distinctions, treesize of input 58 treesize of output 53 [2023-08-27 09:33:41,275 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 49 treesize of output 48 [2023-08-27 09:33:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:33:41,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:33:41,395 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:33:41,395 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 42 [2023-08-27 09:33:41,402 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:33:41,402 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 78 [2023-08-27 09:33:41,406 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 28 [2023-08-27 09:33:41,417 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 5 [2023-08-27 09:33:41,435 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:33:41,436 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 47 [2023-08-27 09:33:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:33:56,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234451839] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:33:56,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:33:56,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 38 [2023-08-27 09:33:56,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74474214] [2023-08-27 09:33:56,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:33:56,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-08-27 09:33:56,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:33:56,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-08-27 09:33:56,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1180, Unknown=9, NotChecked=0, Total=1560 [2023-08-27 09:33:56,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 485 [2023-08-27 09:33:56,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 590 transitions, 11497 flow. Second operand has 40 states, 40 states have (on average 187.025) internal successors, (7481), 40 states have internal predecessors, (7481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:33:56,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:33:56,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 485 [2023-08-27 09:33:56,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:33:59,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:34:02,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:34:05,046 INFO L124 PetriNetUnfolderBase]: 4851/10326 cut-off events. [2023-08-27 09:34:05,047 INFO L125 PetriNetUnfolderBase]: For 794622/794772 co-relation queries the response was YES. [2023-08-27 09:34:05,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105475 conditions, 10326 events. 4851/10326 cut-off events. For 794622/794772 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 74395 event pairs, 3364 based on Foata normal form. 34/9551 useless extension candidates. Maximal degree in co-relation 105364. Up to 8436 conditions per place. [2023-08-27 09:34:05,193 INFO L140 encePairwiseOnDemand]: 471/485 looper letters, 627 selfloop transitions, 147 changer transitions 2/782 dead transitions. [2023-08-27 09:34:05,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 782 transitions, 18313 flow [2023-08-27 09:34:05,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-27 09:34:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-27 09:34:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 6297 transitions. [2023-08-27 09:34:05,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3934395501405811 [2023-08-27 09:34:05,198 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 6297 transitions. [2023-08-27 09:34:05,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 6297 transitions. [2023-08-27 09:34:05,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:34:05,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 6297 transitions. [2023-08-27 09:34:05,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 190.8181818181818) internal successors, (6297), 33 states have internal predecessors, (6297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:34:05,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 485.0) internal successors, (16490), 34 states have internal predecessors, (16490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:34:05,208 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 485.0) internal successors, (16490), 34 states have internal predecessors, (16490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:34:05,208 INFO L175 Difference]: Start difference. First operand has 349 places, 590 transitions, 11497 flow. Second operand 33 states and 6297 transitions. [2023-08-27 09:34:05,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 782 transitions, 18313 flow [2023-08-27 09:34:05,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 782 transitions, 15825 flow, removed 1117 selfloop flow, removed 17 redundant places. [2023-08-27 09:34:05,684 INFO L231 Difference]: Finished difference. Result has 376 places, 645 transitions, 11513 flow [2023-08-27 09:34:05,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=9889, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=11513, PETRI_PLACES=376, PETRI_TRANSITIONS=645} [2023-08-27 09:34:05,685 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 317 predicate places. [2023-08-27 09:34:05,685 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 645 transitions, 11513 flow [2023-08-27 09:34:05,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 187.025) internal successors, (7481), 40 states have internal predecessors, (7481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:34:05,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:34:05,686 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 09:34:05,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-08-27 09:34:05,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:34:05,891 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:34:05,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:34:05,891 INFO L85 PathProgramCache]: Analyzing trace with hash -316416888, now seen corresponding path program 3 times [2023-08-27 09:34:05,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:34:05,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302731346] [2023-08-27 09:34:05,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:34:05,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:34:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:34:06,664 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:34:06,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:34:06,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302731346] [2023-08-27 09:34:06,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302731346] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:34:06,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632700565] [2023-08-27 09:34:06,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 09:34:06,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:34:06,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:34:06,665 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 09:34:06,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-27 09:34:06,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-27 09:34:06,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 09:34:06,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 79 conjunts are in the unsatisfiable core [2023-08-27 09:34:06,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:34:06,940 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 28 [2023-08-27 09:34:06,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:34:06,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:34:06,953 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 09:34:06,954 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-27 09:34:06,968 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 09:34:06,968 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-27 09:34:07,062 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-27 09:34:07,063 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 1 case distinctions, treesize of input 28 treesize of output 23 [2023-08-27 09:34:07,109 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 19 treesize of output 18 [2023-08-27 09:34:07,172 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 28 treesize of output 16 [2023-08-27 09:34:07,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:34:07,199 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 14 treesize of output 16 [2023-08-27 09:34:07,258 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-27 09:34:07,259 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 1 case distinctions, treesize of input 28 treesize of output 23 [2023-08-27 09:34:07,306 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 19 treesize of output 18 [2023-08-27 09:34:07,370 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 28 treesize of output 16 [2023-08-27 09:34:07,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:34:07,394 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 14 treesize of output 16 [2023-08-27 09:34:07,431 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-27 09:34:07,431 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 1 case distinctions, treesize of input 28 treesize of output 23 [2023-08-27 09:34:07,457 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 19 treesize of output 18 [2023-08-27 09:34:07,464 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 14 treesize of output 16 [2023-08-27 09:34:07,481 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:34:07,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:34:07,534 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1964 Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1964)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-08-27 09:34:07,610 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1965 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1962 Int) (v_ArrVal_1964 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1960))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_1962) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1964)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|))))) is different from false [2023-08-27 09:34:07,621 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1958 Int) (v_ArrVal_1965 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1962 Int) (v_ArrVal_1964 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1958)) |c_~#stored_elements~0.base| v_ArrVal_1960))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1958) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_1962) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1964)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_~#queue~0.base|) .cse1) 2147483647))))) is different from false [2023-08-27 09:34:07,633 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1958 Int) (v_ArrVal_1965 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1962 Int) (v_ArrVal_1964 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1958)) |c_~#stored_elements~0.base| v_ArrVal_1960))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1958) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_1962) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1964)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_~#queue~0.base|) .cse3) 2147483647)))))) is different from false [2023-08-27 09:34:07,654 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1958 Int) (v_ArrVal_1965 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1962 Int) (v_ArrVal_1964 Int) (v_ArrVal_1956 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1956) .cse4 v_ArrVal_1958)) |c_~#stored_elements~0.base| v_ArrVal_1960))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_1962) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1964)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1958)))))) is different from false [2023-08-27 09:34:07,678 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1958 Int) (v_ArrVal_1965 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1962 Int) (v_ArrVal_1964 Int) (v_ArrVal_1956 Int) (v_ArrVal_1955 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1955)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1956) .cse1 v_ArrVal_1958)) |c_~#stored_elements~0.base| v_ArrVal_1960))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1958) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_1962) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1964)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_~#queue~0.base|) .cse3) 2147483647)))))) is different from false [2023-08-27 09:34:25,913 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2023-08-27 09:34:25,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632700565] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:34:25,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:34:25,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 17] total 42 [2023-08-27 09:34:25,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866304341] [2023-08-27 09:34:25,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:34:25,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-08-27 09:34:25,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:34:25,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-08-27 09:34:25,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=1016, Unknown=41, NotChecked=462, Total=1892 [2023-08-27 09:34:25,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 485 [2023-08-27 09:34:25,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 645 transitions, 11513 flow. Second operand has 44 states, 44 states have (on average 182.8409090909091) internal successors, (8045), 44 states have internal predecessors, (8045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:34:25,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:34:25,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 485 [2023-08-27 09:34:25,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:34:37,951 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (select .cse7 .cse1)) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1958 Int) (v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1953 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1960 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (v_ArrVal_1962 Int) (v_ArrVal_1964 Int) (v_ArrVal_1956 Int) (v_ArrVal_1955 Int)) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1953))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_1955))) (let ((.cse4 (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1956) .cse1 v_ArrVal_1958)) |c_~#stored_elements~0.base| v_ArrVal_1960))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1958) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_1962) .cse5 v_ArrVal_1964)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_~#queue~0.base|) .cse1) 2147483647)))))))) (forall ((v_ArrVal_1965 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1962 Int) (v_ArrVal_1964 Int)) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_1962) .cse5 v_ArrVal_1964)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_~#queue~0.base|) .cse1) 2147483647) (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|))) (forall ((v_ArrVal_1958 Int) (v_ArrVal_1965 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1960 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (v_ArrVal_1962 Int) (v_ArrVal_1964 Int) (v_ArrVal_1956 Int) (v_ArrVal_1955 Int)) (let ((.cse10 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_1955))) (let ((.cse11 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_1956) .cse1 v_ArrVal_1958)) |c_~#stored_elements~0.base| v_ArrVal_1960))) (let ((.cse9 (select .cse11 |c_~#queue~0.base|))) (or (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|) (< (+ (select .cse10 .cse1) 1) v_ArrVal_1958) (< (select (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_1962) .cse5 v_ArrVal_1964)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_~#queue~0.base|) .cse1) 2147483647)))))) (forall ((v_ArrVal_1965 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) (forall ((v_ArrVal_1965 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1962 Int) (v_ArrVal_1964 Int)) (let ((.cse12 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1960))) (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_1962) .cse5 v_ArrVal_1964)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_~#queue~0.base|) .cse1) 2147483647) (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|)))))))) is different from false [2023-08-27 09:34:51,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:34:53,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:34:55,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:34:55,917 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse10 (select .cse9 .cse3)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1958 Int) (v_ArrVal_1965 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1962 Int) (v_ArrVal_1964 Int) (v_ArrVal_1956 Int) (v_ArrVal_1955 Int)) (let ((.cse0 (store .cse7 .cse8 v_ArrVal_1955))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse6 v_ArrVal_1956) .cse1 v_ArrVal_1958)) |c_~#stored_elements~0.base| v_ArrVal_1960))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1958) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_1962) .cse5 v_ArrVal_1964)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_~#queue~0.base|) .cse3) 2147483647)))))) (forall ((v_ArrVal_1965 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1962 Int) (v_ArrVal_1964 Int)) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_1962) .cse5 v_ArrVal_1964)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_~#queue~0.base|) .cse3) 2147483647) (< .cse10 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|))) (forall ((v_ArrVal_1958 Int) (v_ArrVal_1965 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1960 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| Int) (v_ArrVal_1962 Int) (v_ArrVal_1964 Int) (v_ArrVal_1956 Int) (v_ArrVal_1955 Int)) (let ((.cse12 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117| 4)) v_ArrVal_1955))) (let ((.cse13 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse12 .cse5 v_ArrVal_1956) .cse3 v_ArrVal_1958)) |c_~#stored_elements~0.base| v_ArrVal_1960))) (let ((.cse11 (select .cse13 |c_~#queue~0.base|))) (or (< .cse10 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_117|) (< (select .cse11 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|) (< (+ (select .cse12 .cse3) 1) v_ArrVal_1958) (< (select (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_1962) .cse5 v_ArrVal_1964)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_~#queue~0.base|) .cse3) 2147483647)))))) (forall ((v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1962 Int) (v_ArrVal_1964 Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_1962) .cse6 v_ArrVal_1964)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1) 2147483647))))) is different from false [2023-08-27 09:34:58,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:34:58,628 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1964 Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1964)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2) 2147483647)) (forall ((v_ArrVal_1958 Int) (v_ArrVal_1965 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1962 Int) (v_ArrVal_1964 Int) (v_ArrVal_1956 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1956) .cse2 v_ArrVal_1958)) |c_~#stored_elements~0.base| v_ArrVal_1960))) (let ((.cse4 (select .cse3 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (or (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_1962) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1964)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_~#queue~0.base|) .cse5) 2147483647) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1958))))))) is different from false [2023-08-27 09:34:59,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:35:01,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:35:01,904 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1965 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0) 2147483647)) (forall ((v_ArrVal_1958 Int) (v_ArrVal_1965 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| Int) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1962 Int) (v_ArrVal_1964 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse0 v_ArrVal_1958)) |c_~#stored_elements~0.base| v_ArrVal_1960))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (select .cse1 .cse0) 1) v_ArrVal_1958) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_115| 4) |c_~#queue~0.offset|) v_ArrVal_1962) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1964)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_~#queue~0.base|) .cse3) 2147483647)))))))) is different from false [2023-08-27 09:35:03,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:35:05,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:35:06,262 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1964 Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1964)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2) 2147483647)) (forall ((v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1962 Int) (v_ArrVal_1964 Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1962) .cse1 v_ArrVal_1964)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1965) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2) 2147483647)))) is different from false [2023-08-27 09:35:09,879 INFO L124 PetriNetUnfolderBase]: 5919/12630 cut-off events. [2023-08-27 09:35:09,879 INFO L125 PetriNetUnfolderBase]: For 958368/958418 co-relation queries the response was YES. [2023-08-27 09:35:10,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125285 conditions, 12630 events. 5919/12630 cut-off events. For 958368/958418 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 95869 event pairs, 3145 based on Foata normal form. 55/11749 useless extension candidates. Maximal degree in co-relation 125166. Up to 8084 conditions per place. [2023-08-27 09:35:10,190 INFO L140 encePairwiseOnDemand]: 467/485 looper letters, 512 selfloop transitions, 373 changer transitions 3/894 dead transitions. [2023-08-27 09:35:10,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 894 transitions, 20252 flow [2023-08-27 09:35:10,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-27 09:35:10,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-27 09:35:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 5299 transitions. [2023-08-27 09:35:10,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902061855670103 [2023-08-27 09:35:10,204 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 5299 transitions. [2023-08-27 09:35:10,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 5299 transitions. [2023-08-27 09:35:10,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:35:10,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 5299 transitions. [2023-08-27 09:35:10,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 189.25) internal successors, (5299), 28 states have internal predecessors, (5299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:35:10,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 485.0) internal successors, (14065), 29 states have internal predecessors, (14065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:35:10,214 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 485.0) internal successors, (14065), 29 states have internal predecessors, (14065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:35:10,214 INFO L175 Difference]: Start difference. First operand has 376 places, 645 transitions, 11513 flow. Second operand 28 states and 5299 transitions. [2023-08-27 09:35:10,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 894 transitions, 20252 flow [2023-08-27 09:35:10,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 894 transitions, 20054 flow, removed 64 selfloop flow, removed 15 redundant places. [2023-08-27 09:35:10,868 INFO L231 Difference]: Finished difference. Result has 404 places, 791 transitions, 16410 flow [2023-08-27 09:35:10,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=11326, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=16410, PETRI_PLACES=404, PETRI_TRANSITIONS=791} [2023-08-27 09:35:10,869 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 345 predicate places. [2023-08-27 09:35:10,869 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 791 transitions, 16410 flow [2023-08-27 09:35:10,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 182.8409090909091) internal successors, (8045), 44 states have internal predecessors, (8045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:35:10,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:35:10,870 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2023-08-27 09:35:10,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-27 09:35:11,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-27 09:35:11,075 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:35:11,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:35:11,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1629048939, now seen corresponding path program 2 times [2023-08-27 09:35:11,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:35:11,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182168957] [2023-08-27 09:35:11,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:35:11,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:35:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:35:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:35:13,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:35:13,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182168957] [2023-08-27 09:35:13,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182168957] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:35:13,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219273073] [2023-08-27 09:35:13,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 09:35:13,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:35:13,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:35:13,058 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 09:35:13,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-27 09:35:13,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 09:35:13,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 09:35:13,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 126 conjunts are in the unsatisfiable core [2023-08-27 09:35:13,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:35:13,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:35:13,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:35:13,272 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2023-08-27 09:35:13,358 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 36 treesize of output 29 [2023-08-27 09:35:13,448 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 41 treesize of output 34 [2023-08-27 09:35:13,569 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 44 treesize of output 37 [2023-08-27 09:35:13,632 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 33 treesize of output 35 [2023-08-27 09:35:13,729 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 47 treesize of output 40 [2023-08-27 09:35:13,908 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 52 treesize of output 45 [2023-08-27 09:35:14,213 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 55 treesize of output 48 [2023-08-27 09:35:14,518 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 44 treesize of output 46 [2023-08-27 09:35:14,675 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 58 treesize of output 51 [2023-08-27 09:35:19,422 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 63 treesize of output 56 [2023-08-27 09:35:32,834 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 66 treesize of output 59 [2023-08-27 09:35:52,141 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 55 treesize of output 57 [2023-08-27 09:36:09,140 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 69 treesize of output 62 [2023-08-27 09:36:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:36:29,505 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:36:29,691 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| Int) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2103 Int) (v_ArrVal_2107 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2103)) |c_~#stored_elements~0.base| v_ArrVal_2105) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2103) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| 4) |c_~#queue~0.offset|) v_ArrVal_2107) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 09:36:29,704 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| Int) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2103 Int) (v_ArrVal_2107 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2103)) |c_~#stored_elements~0.base| v_ArrVal_2105) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2103) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125|) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| 4) |c_~#queue~0.offset|) v_ArrVal_2107) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-27 09:36:29,729 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| Int) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2101 Int) (v_ArrVal_2103 Int) (v_ArrVal_2107 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2101) .cse1 v_ArrVal_2103)) |c_~#stored_elements~0.base| v_ArrVal_2105) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2103) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| 4) |c_~#queue~0.offset|) v_ArrVal_2107) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_2101) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125|))))) is different from false [2023-08-27 09:36:29,747 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| Int) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2101 Int) (v_ArrVal_2103 Int) (v_ArrVal_2107 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_2101) .cse1 v_ArrVal_2103)) |c_~#stored_elements~0.base| v_ArrVal_2105) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2103) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| 4) |c_~#queue~0.offset|) v_ArrVal_2107) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_2101) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125|))))) is different from false [2023-08-27 09:36:37,460 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2096 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| Int) (v_ArrVal_2099 Int) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2101 Int) (v_ArrVal_2103 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127| Int) (v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2107 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2096)) |c_~#stored_elements~0.base| v_ArrVal_2098))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127| 4)) v_ArrVal_2099)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_2101) .cse1 v_ArrVal_2103)) |c_~#stored_elements~0.base| v_ArrVal_2105) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2103) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2096) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2101) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125|) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| 4) |c_~#queue~0.offset|) v_ArrVal_2107) .cse3) 2147483647))))))) is different from false [2023-08-27 09:36:42,048 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse7 .cse8))) (or (forall ((v_ArrVal_2096 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| Int) (v_ArrVal_2099 Int) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2101 Int) (v_ArrVal_2103 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127| Int) (v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2107 Int) (v_ArrVal_2094 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2094) .cse8 v_ArrVal_2096)) |c_~#stored_elements~0.base| v_ArrVal_2098))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127| 4)) v_ArrVal_2099)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_2101) .cse1 v_ArrVal_2103)) |c_~#stored_elements~0.base| v_ArrVal_2105) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2101) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2103) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127|) (< (+ .cse5 1) v_ArrVal_2096) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| 4) |c_~#queue~0.offset|) v_ArrVal_2107) .cse3) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_2094))))))) (= 800 .cse5)))) is different from false [2023-08-27 09:36:42,090 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse6 .cse9))) (or (forall ((v_ArrVal_2096 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| Int) (v_ArrVal_2099 Int) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2101 Int) (v_ArrVal_2103 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127| Int) (v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2107 Int) (v_ArrVal_2094 Int)) (let ((.cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_2094) .cse9 v_ArrVal_2096)) |c_~#stored_elements~0.base| v_ArrVal_2098))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127| 4)) v_ArrVal_2099)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_2101) .cse1 v_ArrVal_2103)) |c_~#stored_elements~0.base| v_ArrVal_2105) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2101) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2103) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127|) (< (+ .cse5 1) v_ArrVal_2096) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| 4) |c_~#queue~0.offset|) v_ArrVal_2107) .cse3) 2147483647) (< (+ (select .cse6 .cse7) 1) v_ArrVal_2094)))))))) (= 800 .cse5)))) is different from false [2023-08-27 09:36:42,140 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2096 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| Int) (v_ArrVal_2099 Int) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2101 Int) (v_ArrVal_2103 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127| Int) (v_ArrVal_2092 Int) (v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2107 Int) (v_ArrVal_2094 Int)) (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2092)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_2094) .cse8 v_ArrVal_2096)) |c_~#stored_elements~0.base| v_ArrVal_2098))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127| 4)) v_ArrVal_2099)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_2101) .cse1 v_ArrVal_2103)) |c_~#stored_elements~0.base| v_ArrVal_2105) |c_~#queue~0.base|)) (.cse5 (select .cse6 .cse8))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2101) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127|) (= .cse5 800) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| 4) |c_~#queue~0.offset|) v_ArrVal_2107) .cse3) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2103) (< (+ .cse5 1) v_ArrVal_2096) (< (+ (select .cse6 .cse7) 1) v_ArrVal_2094)))))))) is different from false [2023-08-27 09:36:52,297 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2092 Int) (v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2094 Int) (v_ArrVal_2096 Int) (v_ArrVal_2091 (Array Int Int)) (v_ArrVal_2089 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| Int) (v_ArrVal_2099 Int) (v_ArrVal_2101 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_129| Int) (v_ArrVal_2103 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127| Int) (v_ArrVal_2107 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2089)) |c_~#stored_elements~0.base| v_ArrVal_2091))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_129| 4)) v_ArrVal_2092)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2094) .cse1 v_ArrVal_2096)) |c_~#stored_elements~0.base| v_ArrVal_2098))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127| 4)) v_ArrVal_2099))) (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_2101) .cse1 v_ArrVal_2103)) |c_~#stored_elements~0.base| v_ArrVal_2105) |c_~#queue~0.base|)) (.cse2 (select .cse3 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_129|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2089) (< (+ .cse2 1) v_ArrVal_2096) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2094) (< (+ 1 (select .cse5 .cse1)) v_ArrVal_2103) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125|) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| 4) |c_~#queue~0.offset|) v_ArrVal_2107) .cse4) 2147483647) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127|) (< (+ (select .cse5 .cse4) 1) v_ArrVal_2101) (= .cse2 800)))))))))) is different from false [2023-08-27 09:36:53,704 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2092 Int) (v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2094 Int) (v_ArrVal_2096 Int) (v_ArrVal_2091 (Array Int Int)) (v_ArrVal_2089 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| Int) (v_ArrVal_2088 Int) (v_ArrVal_2099 Int) (v_ArrVal_2101 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_129| Int) (v_ArrVal_2103 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127| Int) (v_ArrVal_2107 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2088) .cse5 v_ArrVal_2089)) |c_~#stored_elements~0.base| v_ArrVal_2091))) (let ((.cse6 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_129| 4)) v_ArrVal_2092)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse3 v_ArrVal_2094) .cse1 v_ArrVal_2096)) |c_~#stored_elements~0.base| v_ArrVal_2098))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127| 4)) v_ArrVal_2099))) (let ((.cse0 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_2101) .cse1 v_ArrVal_2103)) |c_~#stored_elements~0.base| v_ArrVal_2105) |c_~#queue~0.base|)) (.cse8 (select .cse9 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2101) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2089) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_2088) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| 4) |c_~#queue~0.offset|) v_ArrVal_2107) .cse3) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2103) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_129|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127|) (= .cse8 800) (< (+ 1 (select .cse9 .cse3)) v_ArrVal_2094) (< (+ .cse8 1) v_ArrVal_2096))))))))))) is different from false [2023-08-27 09:36:54,724 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2092 Int) (v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2094 Int) (v_ArrVal_2085 Int) (v_ArrVal_2096 Int) (v_ArrVal_2091 (Array Int Int)) (v_ArrVal_2089 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| Int) (v_ArrVal_2088 Int) (v_ArrVal_2099 Int) (v_ArrVal_2101 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_129| Int) (v_ArrVal_2103 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127| Int) (v_ArrVal_2107 Int)) (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2085)) (.cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse9 v_ArrVal_2088) .cse7 v_ArrVal_2089)) |c_~#stored_elements~0.base| v_ArrVal_2091))) (let ((.cse10 (select .cse12 |c_~#queue~0.base|))) (let ((.cse0 (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_129| 4)) v_ArrVal_2092)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_2094) .cse3 v_ArrVal_2096)) |c_~#stored_elements~0.base| v_ArrVal_2098))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse2 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127| 4)) v_ArrVal_2099))) (let ((.cse4 (select .cse0 .cse3)) (.cse5 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_2101) .cse3 v_ArrVal_2103)) |c_~#stored_elements~0.base| v_ArrVal_2105) |c_~#queue~0.base|))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_2094) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2103) (= 800 .cse4) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125|) (< (+ (select .cse6 .cse7) 1) v_ArrVal_2089) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_127|) (< (+ .cse4 1) v_ArrVal_2096) (< (+ (select .cse6 .cse9) 1) v_ArrVal_2088) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2101) (< (select .cse10 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_129|) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_125| 4) |c_~#queue~0.offset|) v_ArrVal_2107) .cse1) 2147483647))))))))))) is different from false [2023-08-27 09:37:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 5 times theorem prover too weak. 0 trivial. 20 not checked. [2023-08-27 09:37:16,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219273073] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:37:16,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:37:16,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 25] total 69 [2023-08-27 09:37:16,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982770454] [2023-08-27 09:37:16,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:37:16,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-08-27 09:37:16,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:37:16,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-08-27 09:37:16,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=892, Invalid=2523, Unknown=169, NotChecked=1386, Total=4970 [2023-08-27 09:37:16,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 485 [2023-08-27 09:37:16,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 791 transitions, 16410 flow. Second operand has 71 states, 71 states have (on average 180.30985915492957) internal successors, (12802), 71 states have internal predecessors, (12802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:37:16,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:37:16,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 485 [2023-08-27 09:37:16,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:37:21,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:37:26,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:37:27,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:37:29,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:37:41,341 WARN L234 SmtUtils]: Spent 8.98s on a formula simplification. DAG size of input: 158 DAG size of output: 88 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:37:58,089 WARN L234 SmtUtils]: Spent 14.56s on a formula simplification. DAG size of input: 210 DAG size of output: 101 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:38:00,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:38:03,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:38:05,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:38:07,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:38:15,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:38:17,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:38:19,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:38:21,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:38:23,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:38:35,489 WARN L234 SmtUtils]: Spent 9.05s on a formula simplification. DAG size of input: 186 DAG size of output: 87 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-08-27 09:38:37,268 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 09:38:37,301 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 09:38:37,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:38:38,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-27 09:38:38,501 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-27 09:38:38,534 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 29 remaining) [2023-08-27 09:38:38,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-27 09:38:38,534 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-27 09:38:38,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (27 of 29 remaining) [2023-08-27 09:38:38,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 29 remaining) [2023-08-27 09:38:38,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 29 remaining) [2023-08-27 09:38:38,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 29 remaining) [2023-08-27 09:38:38,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 29 remaining) [2023-08-27 09:38:38,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 29 remaining) [2023-08-27 09:38:38,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 29 remaining) [2023-08-27 09:38:38,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 29 remaining) [2023-08-27 09:38:38,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 29 remaining) [2023-08-27 09:38:38,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 29 remaining) [2023-08-27 09:38:38,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 29 remaining) [2023-08-27 09:38:38,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 29 remaining) [2023-08-27 09:38:38,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 29 remaining) [2023-08-27 09:38:38,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 29 remaining) [2023-08-27 09:38:38,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 29 remaining) [2023-08-27 09:38:38,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONASSERT (12 of 29 remaining) [2023-08-27 09:38:38,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 29 remaining) [2023-08-27 09:38:38,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 29 remaining) [2023-08-27 09:38:38,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 29 remaining) [2023-08-27 09:38:38,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 29 remaining) [2023-08-27 09:38:38,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 29 remaining) [2023-08-27 09:38:38,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 29 remaining) [2023-08-27 09:38:38,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 29 remaining) [2023-08-27 09:38:38,537 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 29 remaining) [2023-08-27 09:38:38,537 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 29 remaining) [2023-08-27 09:38:38,537 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 29 remaining) [2023-08-27 09:38:38,537 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 29 remaining) [2023-08-27 09:38:38,537 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONASSERT (0 of 29 remaining) [2023-08-27 09:38:38,537 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:38:38,540 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 09:38:38,540 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 09:38:38,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 09:38:38 BasicIcfg [2023-08-27 09:38:38,541 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 09:38:38,541 INFO L158 Benchmark]: Toolchain (without parser) took 860393.04ms. Allocated memory was 375.4MB in the beginning and 8.8GB in the end (delta: 8.4GB). Free memory was 349.6MB in the beginning and 6.2GB in the end (delta: -5.9GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. [2023-08-27 09:38:38,542 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 375.4MB. Free memory is still 351.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 09:38:38,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.10ms. Allocated memory is still 375.4MB. Free memory was 349.1MB in the beginning and 319.6MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-27 09:38:38,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.35ms. Allocated memory is still 375.4MB. Free memory was 319.6MB in the beginning and 316.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 09:38:38,542 INFO L158 Benchmark]: Boogie Preprocessor took 42.12ms. Allocated memory is still 375.4MB. Free memory was 316.4MB in the beginning and 314.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 09:38:38,542 INFO L158 Benchmark]: RCFGBuilder took 377.07ms. Allocated memory is still 375.4MB. Free memory was 314.3MB in the beginning and 347.8MB in the end (delta: -33.5MB). Peak memory consumption was 23.2MB. Max. memory is 16.0GB. [2023-08-27 09:38:38,542 INFO L158 Benchmark]: TraceAbstraction took 859392.40ms. Allocated memory was 375.4MB in the beginning and 8.8GB in the end (delta: 8.4GB). Free memory was 346.8MB in the beginning and 6.2GB in the end (delta: -5.9GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. [2023-08-27 09:38:38,543 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2023-08-27 09:38:38,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 375.4MB. Free memory is still 351.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 508.10ms. Allocated memory is still 375.4MB. Free memory was 349.1MB in the beginning and 319.6MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 67.35ms. Allocated memory is still 375.4MB. Free memory was 319.6MB in the beginning and 316.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 42.12ms. Allocated memory is still 375.4MB. Free memory was 316.4MB in the beginning and 314.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 377.07ms. Allocated memory is still 375.4MB. Free memory was 314.3MB in the beginning and 347.8MB in the end (delta: -33.5MB). Peak memory consumption was 23.2MB. Max. memory is 16.0GB. * TraceAbstraction took 859392.40ms. Allocated memory was 375.4MB in the beginning and 8.8GB in the end (delta: 8.4GB). Free memory was 346.8MB in the beginning and 6.2GB in the end (delta: -5.9GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 750]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [750] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4s, 229 PlacesBefore, 59 PlacesAfterwards, 237 TransitionsBefore, 59 TransitionsAfterwards, 14312 CoEnabledTransitionPairs, 9 FixpointIterations, 68 TrivialSequentialCompositions, 134 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 18 ConcurrentYvCompositions, 8 ChoiceCompositions, 237 TotalNumberOfCompositions, 33711 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15553, independent: 14894, independent conditional: 0, independent unconditional: 14894, dependent: 659, dependent conditional: 0, dependent unconditional: 659, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7952, independent: 7855, independent conditional: 0, independent unconditional: 7855, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15553, independent: 7039, independent conditional: 0, independent unconditional: 7039, dependent: 562, dependent conditional: 0, dependent unconditional: 562, unknown: 7952, unknown conditional: 0, unknown unconditional: 7952] , Statistics on independence cache: Total cache size (in pairs): 375, Positive cache size: 336, Positive conditional cache size: 0, Positive unconditional cache size: 336, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 384 locations, 29 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 859.3s, OverallIterations: 30, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 616.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 920 mSolverCounterUnknown, 4924 SdHoareTripleChecker+Valid, 282.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4924 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 279.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 15375 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 974 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16371 IncrementalHoareTripleChecker+Invalid, 33641 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 974 mSolverCounterUnsat, 2 mSDtfsCounter, 16371 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1135 GetRequests, 296 SyntacticMatches, 87 SemanticMatches, 752 ConstructedPredicates, 71 IntricatePredicates, 8 DeprecatedPredicates, 12278 ImplicationChecksByTransitivity, 495.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16410occurred in iteration=29, InterpolantAutomatonStates: 381, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 229.6s InterpolantComputationTime, 799 NumberOfCodeBlocks, 799 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1057 ConstructedInterpolants, 355 QuantifiedInterpolants, 58065 SizeOfPredicates, 304 NumberOfNonLiveVariables, 4314 ConjunctsInSsa, 1097 ConjunctsInUnsatCore, 62 InterpolantComputations, 14 PerfectInterpolantSequences, 17/416 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout !ENTRY org.eclipse.osgi 4 0 2023-08-27 09:38:38.562 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ec5ea486/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:190) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438) Completed graceful shutdown