/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 02:42:50,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 02:42:50,488 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 02:42:50,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 02:42:50,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 02:42:50,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 02:42:50,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 02:42:50,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 02:42:50,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 02:42:50,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 02:42:50,521 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 02:42:50,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 02:42:50,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 02:42:50,522 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 02:42:50,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 02:42:50,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 02:42:50,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 02:42:50,523 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 02:42:50,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 02:42:50,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 02:42:50,524 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 02:42:50,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 02:42:50,525 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 02:42:50,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 02:42:50,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 02:42:50,525 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 02:42:50,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 02:42:50,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 02:42:50,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 02:42:50,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 02:42:50,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 02:42:50,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 02:42:50,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 02:42:50,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 02:42:50,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 02:42:50,528 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 02:42:50,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 02:42:50,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 02:42:50,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 02:42:50,852 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 02:42:50,852 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 02:42:50,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2023-08-27 02:42:51,929 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 02:42:52,241 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 02:42:52,242 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2023-08-27 02:42:52,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2af2658/5716a3bdad634386beea72c299907215/FLAG8708ada63 [2023-08-27 02:42:52,277 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2af2658/5716a3bdad634386beea72c299907215 [2023-08-27 02:42:52,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 02:42:52,283 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 02:42:52,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 02:42:52,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 02:42:52,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 02:42:52,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:42:52" (1/1) ... [2023-08-27 02:42:52,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c603eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:52, skipping insertion in model container [2023-08-27 02:42:52,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:42:52" (1/1) ... [2023-08-27 02:42:52,344 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 02:42:52,782 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 02:42:52,793 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 02:42:52,819 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-27 02:42:52,821 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-27 02:42:52,828 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-08-27 02:42:52,866 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 02:42:52,928 INFO L206 MainTranslator]: Completed translation [2023-08-27 02:42:52,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:52 WrapperNode [2023-08-27 02:42:52,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 02:42:52,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 02:42:52,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 02:42:52,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 02:42:52,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:52" (1/1) ... [2023-08-27 02:42:52,955 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:52" (1/1) ... [2023-08-27 02:42:52,979 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 221 [2023-08-27 02:42:52,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 02:42:52,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 02:42:52,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 02:42:52,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 02:42:52,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:52" (1/1) ... [2023-08-27 02:42:52,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:52" (1/1) ... [2023-08-27 02:42:53,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:52" (1/1) ... [2023-08-27 02:42:53,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:52" (1/1) ... [2023-08-27 02:42:53,033 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:52" (1/1) ... [2023-08-27 02:42:53,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:52" (1/1) ... [2023-08-27 02:42:53,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:52" (1/1) ... [2023-08-27 02:42:53,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:52" (1/1) ... [2023-08-27 02:42:53,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 02:42:53,043 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 02:42:53,043 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 02:42:53,043 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 02:42:53,043 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:52" (1/1) ... [2023-08-27 02:42:53,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 02:42:53,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:42:53,082 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 02:42:53,089 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 02:42:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-27 02:42:53,118 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-27 02:42:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-27 02:42:53,119 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-27 02:42:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 02:42:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 02:42:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 02:42:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 02:42:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-27 02:42:53,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 02:42:53,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 02:42:53,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 02:42:53,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 02:42:53,121 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 02:42:53,248 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 02:42:53,250 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 02:42:53,551 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 02:42:53,559 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 02:42:53,559 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-27 02:42:53,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:42:53 BoogieIcfgContainer [2023-08-27 02:42:53,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 02:42:53,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 02:42:53,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 02:42:53,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 02:42:53,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 02:42:52" (1/3) ... [2023-08-27 02:42:53,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9bf872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 02:42:53, skipping insertion in model container [2023-08-27 02:42:53,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:52" (2/3) ... [2023-08-27 02:42:53,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9bf872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 02:42:53, skipping insertion in model container [2023-08-27 02:42:53,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:42:53" (3/3) ... [2023-08-27 02:42:53,568 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2023-08-27 02:42:53,582 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 02:42:53,605 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-08-27 02:42:53,605 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 02:42:53,734 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-27 02:42:53,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 240 places, 248 transitions, 512 flow [2023-08-27 02:42:53,883 INFO L124 PetriNetUnfolderBase]: 15/246 cut-off events. [2023-08-27 02:42:53,883 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 02:42:53,892 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 02:42:53,892 INFO L82 GeneralOperation]: Start removeDead. Operand has 240 places, 248 transitions, 512 flow [2023-08-27 02:42:53,903 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 237 transitions, 483 flow [2023-08-27 02:42:53,906 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 02:42:53,917 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 229 places, 237 transitions, 483 flow [2023-08-27 02:42:53,921 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 229 places, 237 transitions, 483 flow [2023-08-27 02:42:53,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 237 transitions, 483 flow [2023-08-27 02:42:53,978 INFO L124 PetriNetUnfolderBase]: 15/237 cut-off events. [2023-08-27 02:42:53,978 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-27 02:42:53,983 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 02:42:53,989 INFO L119 LiptonReduction]: Number of co-enabled transitions 14312 [2023-08-27 02:43:02,106 INFO L134 LiptonReduction]: Checked pairs total: 33711 [2023-08-27 02:43:02,106 INFO L136 LiptonReduction]: Total number of compositions: 237 [2023-08-27 02:43:02,119 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 02:43:02,125 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;@4f5a257d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 02:43:02,125 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-08-27 02:43:02,127 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 02:43:02,127 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-27 02:43:02,127 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 02:43:02,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:43:02,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-27 02:43:02,128 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 02:43:02,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:43:02,133 INFO L85 PathProgramCache]: Analyzing trace with hash 991, now seen corresponding path program 1 times [2023-08-27 02:43:02,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:43:02,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451850717] [2023-08-27 02:43:02,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:02,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:43:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:02,251 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 02:43:02,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:43:02,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451850717] [2023-08-27 02:43:02,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451850717] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:43:02,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:43:02,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-27 02:43:02,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200332408] [2023-08-27 02:43:02,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:43:02,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-27 02:43:02,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:43:02,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-27 02:43:02,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-27 02:43:02,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 485 [2023-08-27 02:43:02,297 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 02:43:02,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:43:02,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 485 [2023-08-27 02:43:02,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:43:02,573 INFO L124 PetriNetUnfolderBase]: 1466/2404 cut-off events. [2023-08-27 02:43:02,573 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-08-27 02:43:02,576 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 02:43:02,592 INFO L140 encePairwiseOnDemand]: 484/485 looper letters, 50 selfloop transitions, 0 changer transitions 0/58 dead transitions. [2023-08-27 02:43:02,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 225 flow [2023-08-27 02:43:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-27 02:43:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-27 02:43:02,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 521 transitions. [2023-08-27 02:43:02,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5371134020618556 [2023-08-27 02:43:02,614 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 521 transitions. [2023-08-27 02:43:02,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 521 transitions. [2023-08-27 02:43:02,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:43:02,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 521 transitions. [2023-08-27 02:43:02,626 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 02:43:02,632 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 02:43:02,633 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 02:43:02,635 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 127 flow. Second operand 2 states and 521 transitions. [2023-08-27 02:43:02,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 225 flow [2023-08-27 02:43:02,640 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 02:43:02,642 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 120 flow [2023-08-27 02:43:02,644 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 02:43:02,647 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-08-27 02:43:02,648 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 120 flow [2023-08-27 02:43:02,648 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 02:43:02,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:43:02,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:43:02,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 02:43:02,649 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 02:43:02,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:43:02,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1865824386, now seen corresponding path program 1 times [2023-08-27 02:43:02,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:43:02,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554328204] [2023-08-27 02:43:02,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:02,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:43:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:03,978 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 02:43:03,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:43:03,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554328204] [2023-08-27 02:43:03,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554328204] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:43:03,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:43:03,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 02:43:03,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965270998] [2023-08-27 02:43:03,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:43:03,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 02:43:03,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:43:03,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 02:43:03,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 02:43:03,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 485 [2023-08-27 02:43:03,984 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 02:43:03,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:43:03,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 485 [2023-08-27 02:43:03,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:43:04,455 INFO L124 PetriNetUnfolderBase]: 1510/2487 cut-off events. [2023-08-27 02:43:04,456 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-27 02:43:04,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4958 conditions, 2487 events. 1510/2487 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 12438 event pairs, 1057 based on Foata normal form. 0/1741 useless extension candidates. Maximal degree in co-relation 4955. Up to 2421 conditions per place. [2023-08-27 02:43:04,471 INFO L140 encePairwiseOnDemand]: 477/485 looper letters, 54 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2023-08-27 02:43:04,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 270 flow [2023-08-27 02:43:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 02:43:04,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 02:43:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1193 transitions. [2023-08-27 02:43:04,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4099656357388316 [2023-08-27 02:43:04,476 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1193 transitions. [2023-08-27 02:43:04,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1193 transitions. [2023-08-27 02:43:04,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:43:04,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1193 transitions. [2023-08-27 02:43:04,479 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 02:43:04,484 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 02:43:04,486 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 02:43:04,486 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 120 flow. Second operand 6 states and 1193 transitions. [2023-08-27 02:43:04,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 270 flow [2023-08-27 02:43:04,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 70 transitions, 270 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 02:43:04,490 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 180 flow [2023-08-27 02:43:04,490 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=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2023-08-27 02:43:04,491 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 6 predicate places. [2023-08-27 02:43:04,492 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 180 flow [2023-08-27 02:43:04,492 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 02:43:04,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:43:04,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:43:04,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 02:43:04,497 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:43:04,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:43:04,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2006802628, now seen corresponding path program 1 times [2023-08-27 02:43:04,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:43:04,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931552878] [2023-08-27 02:43:04,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:04,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:43:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:05,037 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 02:43:05,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:43:05,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931552878] [2023-08-27 02:43:05,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931552878] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:43:05,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:43:05,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 02:43:05,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632632425] [2023-08-27 02:43:05,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:43:05,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 02:43:05,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:43:05,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 02:43:05,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 02:43:05,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 485 [2023-08-27 02:43:05,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 184.33333333333334) internal successors, (1106), 6 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states 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 02:43:05,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:43:05,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 485 [2023-08-27 02:43:05,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:43:05,667 INFO L124 PetriNetUnfolderBase]: 2247/3722 cut-off events. [2023-08-27 02:43:05,668 INFO L125 PetriNetUnfolderBase]: For 252/252 co-relation queries the response was YES. [2023-08-27 02:43:05,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7997 conditions, 3722 events. 2247/3722 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 20612 event pairs, 409 based on Foata normal form. 0/2792 useless extension candidates. Maximal degree in co-relation 7989. Up to 2505 conditions per place. [2023-08-27 02:43:05,691 INFO L140 encePairwiseOnDemand]: 475/485 looper letters, 131 selfloop transitions, 21 changer transitions 0/159 dead transitions. [2023-08-27 02:43:05,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 159 transitions, 699 flow [2023-08-27 02:43:05,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 02:43:05,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 02:43:05,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1247 transitions. [2023-08-27 02:43:05,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4285223367697594 [2023-08-27 02:43:05,696 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1247 transitions. [2023-08-27 02:43:05,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1247 transitions. [2023-08-27 02:43:05,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:43:05,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1247 transitions. [2023-08-27 02:43:05,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 207.83333333333334) internal successors, (1247), 6 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states 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 02:43:05,705 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 02:43:05,707 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 02:43:05,707 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 180 flow. Second operand 6 states and 1247 transitions. [2023-08-27 02:43:05,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 159 transitions, 699 flow [2023-08-27 02:43:05,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 159 transitions, 699 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 02:43:05,722 INFO L231 Difference]: Finished difference. Result has 73 places, 80 transitions, 315 flow [2023-08-27 02:43:05,722 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=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=315, PETRI_PLACES=73, PETRI_TRANSITIONS=80} [2023-08-27 02:43:05,723 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 14 predicate places. [2023-08-27 02:43:05,724 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 80 transitions, 315 flow [2023-08-27 02:43:05,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.33333333333334) internal successors, (1106), 6 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states 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 02:43:05,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:43:05,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:43:05,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 02:43:05,725 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 02:43:05,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:43:05,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2005979560, now seen corresponding path program 1 times [2023-08-27 02:43:05,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:43:05,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850733542] [2023-08-27 02:43:05,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:05,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:43:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:43:06,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:43:06,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850733542] [2023-08-27 02:43:06,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850733542] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:43:06,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:43:06,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 02:43:06,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323397804] [2023-08-27 02:43:06,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:43:06,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 02:43:06,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:43:06,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 02:43:06,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 02:43:06,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 02:43:06,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 80 transitions, 315 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 02:43:06,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:43:06,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 02:43:06,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:43:07,167 INFO L124 PetriNetUnfolderBase]: 2348/3911 cut-off events. [2023-08-27 02:43:07,167 INFO L125 PetriNetUnfolderBase]: For 1373/1373 co-relation queries the response was YES. [2023-08-27 02:43:07,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9486 conditions, 3911 events. 2348/3911 cut-off events. For 1373/1373 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 22061 event pairs, 437 based on Foata normal form. 58/3173 useless extension candidates. Maximal degree in co-relation 9474. Up to 2919 conditions per place. [2023-08-27 02:43:07,195 INFO L140 encePairwiseOnDemand]: 477/485 looper letters, 130 selfloop transitions, 19 changer transitions 0/156 dead transitions. [2023-08-27 02:43:07,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 156 transitions, 790 flow [2023-08-27 02:43:07,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 02:43:07,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 02:43:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1239 transitions. [2023-08-27 02:43:07,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42577319587628865 [2023-08-27 02:43:07,199 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1239 transitions. [2023-08-27 02:43:07,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1239 transitions. [2023-08-27 02:43:07,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:43:07,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1239 transitions. [2023-08-27 02:43:07,203 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 02:43:07,207 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 02:43:07,209 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 02:43:07,209 INFO L175 Difference]: Start difference. First operand has 73 places, 80 transitions, 315 flow. Second operand 6 states and 1239 transitions. [2023-08-27 02:43:07,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 156 transitions, 790 flow [2023-08-27 02:43:07,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 156 transitions, 778 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-27 02:43:07,232 INFO L231 Difference]: Finished difference. Result has 80 places, 86 transitions, 399 flow [2023-08-27 02:43:07,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=399, PETRI_PLACES=80, PETRI_TRANSITIONS=86} [2023-08-27 02:43:07,233 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 21 predicate places. [2023-08-27 02:43:07,233 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 86 transitions, 399 flow [2023-08-27 02:43:07,235 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 02:43:07,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:43:07,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:43:07,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 02:43:07,235 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:43:07,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:43:07,236 INFO L85 PathProgramCache]: Analyzing trace with hash 752218327, now seen corresponding path program 1 times [2023-08-27 02:43:07,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:43:07,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531047588] [2023-08-27 02:43:07,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:07,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:43:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:07,306 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 02:43:07,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:43:07,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531047588] [2023-08-27 02:43:07,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531047588] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:43:07,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:43:07,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 02:43:07,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335901292] [2023-08-27 02:43:07,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:43:07,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 02:43:07,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:43:07,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 02:43:07,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 02:43:07,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 485 [2023-08-27 02:43:07,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 86 transitions, 399 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 02:43:07,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:43:07,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 485 [2023-08-27 02:43:07,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:43:07,996 INFO L124 PetriNetUnfolderBase]: 3860/6307 cut-off events. [2023-08-27 02:43:07,998 INFO L125 PetriNetUnfolderBase]: For 7031/7370 co-relation queries the response was YES. [2023-08-27 02:43:08,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16167 conditions, 6307 events. 3860/6307 cut-off events. For 7031/7370 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 38857 event pairs, 1703 based on Foata normal form. 313/5212 useless extension candidates. Maximal degree in co-relation 16152. Up to 3759 conditions per place. [2023-08-27 02:43:08,040 INFO L140 encePairwiseOnDemand]: 478/485 looper letters, 157 selfloop transitions, 4 changer transitions 0/172 dead transitions. [2023-08-27 02:43:08,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 172 transitions, 1097 flow [2023-08-27 02:43:08,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 02:43:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 02:43:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1009 transitions. [2023-08-27 02:43:08,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5201030927835052 [2023-08-27 02:43:08,043 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1009 transitions. [2023-08-27 02:43:08,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1009 transitions. [2023-08-27 02:43:08,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:43:08,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1009 transitions. [2023-08-27 02:43:08,045 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 02:43:08,048 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 02:43:08,049 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 02:43:08,049 INFO L175 Difference]: Start difference. First operand has 80 places, 86 transitions, 399 flow. Second operand 4 states and 1009 transitions. [2023-08-27 02:43:08,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 172 transitions, 1097 flow [2023-08-27 02:43:08,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 172 transitions, 1079 flow, removed 9 selfloop flow, removed 0 redundant places. [2023-08-27 02:43:08,064 INFO L231 Difference]: Finished difference. Result has 85 places, 89 transitions, 425 flow [2023-08-27 02:43:08,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=425, PETRI_PLACES=85, PETRI_TRANSITIONS=89} [2023-08-27 02:43:08,067 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 26 predicate places. [2023-08-27 02:43:08,067 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 425 flow [2023-08-27 02:43:08,068 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 02:43:08,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:43:08,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:43:08,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 02:43:08,068 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:43:08,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:43:08,069 INFO L85 PathProgramCache]: Analyzing trace with hash 693783506, now seen corresponding path program 1 times [2023-08-27 02:43:08,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:43:08,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958625730] [2023-08-27 02:43:08,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:08,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:43:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:08,424 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 02:43:08,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:43:08,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958625730] [2023-08-27 02:43:08,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958625730] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:43:08,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:43:08,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 02:43:08,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104424390] [2023-08-27 02:43:08,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:43:08,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 02:43:08,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:43:08,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 02:43:08,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 02:43:08,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 485 [2023-08-27 02:43:08,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 89 transitions, 425 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 02:43:08,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:43:08,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 485 [2023-08-27 02:43:08,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:43:09,131 INFO L124 PetriNetUnfolderBase]: 3836/6418 cut-off events. [2023-08-27 02:43:09,132 INFO L125 PetriNetUnfolderBase]: For 4452/4462 co-relation queries the response was YES. [2023-08-27 02:43:09,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16788 conditions, 6418 events. 3836/6418 cut-off events. For 4452/4462 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 39357 event pairs, 2653 based on Foata normal form. 0/5367 useless extension candidates. Maximal degree in co-relation 16770. Up to 6199 conditions per place. [2023-08-27 02:43:09,183 INFO L140 encePairwiseOnDemand]: 476/485 looper letters, 80 selfloop transitions, 10 changer transitions 0/97 dead transitions. [2023-08-27 02:43:09,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 97 transitions, 625 flow [2023-08-27 02:43:09,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 02:43:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 02:43:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1197 transitions. [2023-08-27 02:43:09,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.411340206185567 [2023-08-27 02:43:09,187 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1197 transitions. [2023-08-27 02:43:09,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1197 transitions. [2023-08-27 02:43:09,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:43:09,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1197 transitions. [2023-08-27 02:43:09,189 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 02:43:09,193 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 02:43:09,196 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 02:43:09,196 INFO L175 Difference]: Start difference. First operand has 85 places, 89 transitions, 425 flow. Second operand 6 states and 1197 transitions. [2023-08-27 02:43:09,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 97 transitions, 625 flow [2023-08-27 02:43:09,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 97 transitions, 623 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 02:43:09,213 INFO L231 Difference]: Finished difference. Result has 90 places, 91 transitions, 465 flow [2023-08-27 02:43:09,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=465, PETRI_PLACES=90, PETRI_TRANSITIONS=91} [2023-08-27 02:43:09,216 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 31 predicate places. [2023-08-27 02:43:09,216 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 91 transitions, 465 flow [2023-08-27 02:43:09,217 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 02:43:09,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:43:09,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:43:09,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 02:43:09,217 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:43:09,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:43:09,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1288991572, now seen corresponding path program 1 times [2023-08-27 02:43:09,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:43:09,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444589979] [2023-08-27 02:43:09,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:09,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:43:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:09,611 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 02:43:09,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:43:09,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444589979] [2023-08-27 02:43:09,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444589979] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:43:09,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:43:09,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 02:43:09,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106639137] [2023-08-27 02:43:09,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:43:09,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 02:43:09,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:43:09,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 02:43:09,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 02:43:09,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 02:43:09,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 91 transitions, 465 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 02:43:09,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:43:09,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 02:43:09,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:43:10,367 INFO L124 PetriNetUnfolderBase]: 4150/6841 cut-off events. [2023-08-27 02:43:10,367 INFO L125 PetriNetUnfolderBase]: For 3118/3148 co-relation queries the response was YES. [2023-08-27 02:43:10,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18065 conditions, 6841 events. 4150/6841 cut-off events. For 3118/3148 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 42189 event pairs, 808 based on Foata normal form. 94/6017 useless extension candidates. Maximal degree in co-relation 18046. Up to 5185 conditions per place. [2023-08-27 02:43:10,409 INFO L140 encePairwiseOnDemand]: 475/485 looper letters, 146 selfloop transitions, 20 changer transitions 0/173 dead transitions. [2023-08-27 02:43:10,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 173 transitions, 1040 flow [2023-08-27 02:43:10,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 02:43:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 02:43:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1244 transitions. [2023-08-27 02:43:10,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4274914089347079 [2023-08-27 02:43:10,414 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1244 transitions. [2023-08-27 02:43:10,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1244 transitions. [2023-08-27 02:43:10,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:43:10,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1244 transitions. [2023-08-27 02:43:10,417 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 02:43:10,421 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 02:43:10,422 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 02:43:10,422 INFO L175 Difference]: Start difference. First operand has 90 places, 91 transitions, 465 flow. Second operand 6 states and 1244 transitions. [2023-08-27 02:43:10,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 173 transitions, 1040 flow [2023-08-27 02:43:10,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 173 transitions, 1024 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 02:43:10,473 INFO L231 Difference]: Finished difference. Result has 92 places, 93 transitions, 517 flow [2023-08-27 02:43:10,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=517, PETRI_PLACES=92, PETRI_TRANSITIONS=93} [2023-08-27 02:43:10,474 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 33 predicate places. [2023-08-27 02:43:10,474 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 93 transitions, 517 flow [2023-08-27 02:43:10,474 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 02:43:10,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:43:10,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:43:10,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 02:43:10,475 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:43:10,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:43:10,475 INFO L85 PathProgramCache]: Analyzing trace with hash 38670346, now seen corresponding path program 2 times [2023-08-27 02:43:10,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:43:10,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486024694] [2023-08-27 02:43:10,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:10,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:43:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:11,091 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 02:43:11,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:43:11,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486024694] [2023-08-27 02:43:11,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486024694] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:43:11,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:43:11,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 02:43:11,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652412489] [2023-08-27 02:43:11,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:43:11,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 02:43:11,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:43:11,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 02:43:11,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 02:43:11,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 02:43:11,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 93 transitions, 517 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 02:43:11,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:43:11,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 02:43:11,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:43:12,048 INFO L124 PetriNetUnfolderBase]: 4386/7292 cut-off events. [2023-08-27 02:43:12,048 INFO L125 PetriNetUnfolderBase]: For 5588/5604 co-relation queries the response was YES. [2023-08-27 02:43:12,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19842 conditions, 7292 events. 4386/7292 cut-off events. For 5588/5604 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 45088 event pairs, 1084 based on Foata normal form. 94/6436 useless extension candidates. Maximal degree in co-relation 19822. Up to 4961 conditions per place. [2023-08-27 02:43:12,155 INFO L140 encePairwiseOnDemand]: 476/485 looper letters, 147 selfloop transitions, 21 changer transitions 0/175 dead transitions. [2023-08-27 02:43:12,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 175 transitions, 1100 flow [2023-08-27 02:43:12,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 02:43:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 02:43:12,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1243 transitions. [2023-08-27 02:43:12,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42714776632302404 [2023-08-27 02:43:12,159 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1243 transitions. [2023-08-27 02:43:12,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1243 transitions. [2023-08-27 02:43:12,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:43:12,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1243 transitions. [2023-08-27 02:43:12,163 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 02:43:12,166 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 02:43:12,167 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 02:43:12,167 INFO L175 Difference]: Start difference. First operand has 92 places, 93 transitions, 517 flow. Second operand 6 states and 1243 transitions. [2023-08-27 02:43:12,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 175 transitions, 1100 flow [2023-08-27 02:43:12,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 175 transitions, 1068 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 02:43:12,210 INFO L231 Difference]: Finished difference. Result has 94 places, 95 transitions, 561 flow [2023-08-27 02:43:12,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=561, PETRI_PLACES=94, PETRI_TRANSITIONS=95} [2023-08-27 02:43:12,213 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 35 predicate places. [2023-08-27 02:43:12,213 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 95 transitions, 561 flow [2023-08-27 02:43:12,214 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 02:43:12,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:43:12,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:43:12,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 02:43:12,214 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:43:12,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:43:12,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1327212761, now seen corresponding path program 1 times [2023-08-27 02:43:12,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:43:12,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972289575] [2023-08-27 02:43:12,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:12,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:43:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:12,288 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 02:43:12,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:43:12,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972289575] [2023-08-27 02:43:12,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972289575] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:43:12,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:43:12,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 02:43:12,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506138126] [2023-08-27 02:43:12,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:43:12,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 02:43:12,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:43:12,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 02:43:12,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 02:43:12,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 485 [2023-08-27 02:43:12,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 95 transitions, 561 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 02:43:12,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:43:12,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 485 [2023-08-27 02:43:12,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:43:12,486 INFO L124 PetriNetUnfolderBase]: 835/1641 cut-off events. [2023-08-27 02:43:12,486 INFO L125 PetriNetUnfolderBase]: For 1223/1229 co-relation queries the response was YES. [2023-08-27 02:43:12,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4210 conditions, 1641 events. 835/1641 cut-off events. For 1223/1229 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 9269 event pairs, 543 based on Foata normal form. 72/1579 useless extension candidates. Maximal degree in co-relation 4189. Up to 813 conditions per place. [2023-08-27 02:43:12,496 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 75 selfloop transitions, 2 changer transitions 7/92 dead transitions. [2023-08-27 02:43:12,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 648 flow [2023-08-27 02:43:12,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 02:43:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 02:43:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2023-08-27 02:43:12,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147766323024054 [2023-08-27 02:43:12,499 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 749 transitions. [2023-08-27 02:43:12,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 749 transitions. [2023-08-27 02:43:12,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:43:12,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 749 transitions. [2023-08-27 02:43:12,501 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 02:43:12,504 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 02:43:12,505 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 02:43:12,505 INFO L175 Difference]: Start difference. First operand has 94 places, 95 transitions, 561 flow. Second operand 3 states and 749 transitions. [2023-08-27 02:43:12,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 648 flow [2023-08-27 02:43:12,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 92 transitions, 608 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-08-27 02:43:12,511 INFO L231 Difference]: Finished difference. Result has 93 places, 80 transitions, 412 flow [2023-08-27 02:43:12,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=90, 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=412, PETRI_PLACES=93, PETRI_TRANSITIONS=80} [2023-08-27 02:43:12,512 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 34 predicate places. [2023-08-27 02:43:12,512 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 80 transitions, 412 flow [2023-08-27 02:43:12,513 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 02:43:12,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:43:12,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:43:12,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 02:43:12,514 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:43:12,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:43:12,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1005879036, now seen corresponding path program 1 times [2023-08-27 02:43:12,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:43:12,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540299107] [2023-08-27 02:43:12,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:12,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:43:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:43:12,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:43:12,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540299107] [2023-08-27 02:43:12,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540299107] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:43:12,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:43:12,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 02:43:12,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049508052] [2023-08-27 02:43:12,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:43:12,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 02:43:12,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:43:12,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 02:43:12,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 02:43:12,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 02:43:12,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 80 transitions, 412 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 02:43:12,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:43:12,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 02:43:12,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:43:12,719 INFO L124 PetriNetUnfolderBase]: 535/1075 cut-off events. [2023-08-27 02:43:12,719 INFO L125 PetriNetUnfolderBase]: For 617/617 co-relation queries the response was YES. [2023-08-27 02:43:12,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2775 conditions, 1075 events. 535/1075 cut-off events. For 617/617 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5400 event pairs, 394 based on Foata normal form. 8/973 useless extension candidates. Maximal degree in co-relation 2753. Up to 812 conditions per place. [2023-08-27 02:43:12,725 INFO L140 encePairwiseOnDemand]: 480/485 looper letters, 76 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2023-08-27 02:43:12,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 590 flow [2023-08-27 02:43:12,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 02:43:12,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 02:43:12,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2023-08-27 02:43:12,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5140893470790378 [2023-08-27 02:43:12,728 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 748 transitions. [2023-08-27 02:43:12,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 748 transitions. [2023-08-27 02:43:12,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:43:12,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 748 transitions. [2023-08-27 02:43:12,730 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 02:43:12,732 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 02:43:12,733 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 02:43:12,733 INFO L175 Difference]: Start difference. First operand has 93 places, 80 transitions, 412 flow. Second operand 3 states and 748 transitions. [2023-08-27 02:43:12,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 590 flow [2023-08-27 02:43:12,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 88 transitions, 576 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-27 02:43:12,738 INFO L231 Difference]: Finished difference. Result has 92 places, 80 transitions, 407 flow [2023-08-27 02:43:12,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=89, 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=407, PETRI_PLACES=92, PETRI_TRANSITIONS=80} [2023-08-27 02:43:12,739 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 33 predicate places. [2023-08-27 02:43:12,739 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 407 flow [2023-08-27 02:43:12,739 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 02:43:12,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:43:12,739 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:43:12,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 02:43:12,740 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:43:12,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:43:12,740 INFO L85 PathProgramCache]: Analyzing trace with hash 156498137, now seen corresponding path program 1 times [2023-08-27 02:43:12,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:43:12,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902565525] [2023-08-27 02:43:12,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:12,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:43:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:13,459 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 02:43:13,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:43:13,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902565525] [2023-08-27 02:43:13,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902565525] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:43:13,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137463903] [2023-08-27 02:43:13,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:13,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:43:13,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:43:13,464 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 02:43:13,501 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 02:43:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:13,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 68 conjunts are in the unsatisfiable core [2023-08-27 02:43:13,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:43:13,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:43:13,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:43:13,744 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:43:13,745 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 02:43:13,758 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 02:43:13,758 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 02:43:13,874 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 02:43:14,027 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 02:43:14,205 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 02:43:14,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:43:14,284 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 02:43:14,428 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 02:43:14,507 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 02:43:14,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:43:14,599 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_376) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)))) is different from false [2023-08-27 02:43:14,687 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_373) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_376) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|))))) is different from false [2023-08-27 02:43:14,734 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (v_ArrVal_372 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_372) .cse2 v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_376) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_373) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_372) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|))))) is different from false [2023-08-27 02:43:14,946 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_373 Int) (v_ArrVal_372 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_369 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_369)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_372) .cse3 v_ArrVal_373)) |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_372) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|) (< (+ (select .cse0 .cse3) 1) v_ArrVal_373) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_376) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-27 02:43:17,168 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 02:43:17,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137463903] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:43:17,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:43:17,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-08-27 02:43:17,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289059976] [2023-08-27 02:43:17,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:43:17,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-27 02:43:17,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:43:17,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-27 02:43:17,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=553, Unknown=17, NotChecked=220, Total=992 [2023-08-27 02:43:17,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 485 [2023-08-27 02:43:17,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 80 transitions, 407 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 02:43:17,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:43:17,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 485 [2023-08-27 02:43:17,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:43:20,544 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 02:43:22,555 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 02:43:22,745 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_376 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_376) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)))) (forall ((v_ArrVal_376 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_375 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_375) |c_~#queue~0.base|))) (or (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_376) .cse1) 2147483647) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)))))) is different from false [2023-08-27 02:43:23,095 INFO L124 PetriNetUnfolderBase]: 597/1182 cut-off events. [2023-08-27 02:43:23,096 INFO L125 PetriNetUnfolderBase]: For 683/683 co-relation queries the response was YES. [2023-08-27 02:43:23,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3133 conditions, 1182 events. 597/1182 cut-off events. For 683/683 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 6014 event pairs, 418 based on Foata normal form. 2/1071 useless extension candidates. Maximal degree in co-relation 3111. Up to 1039 conditions per place. [2023-08-27 02:43:23,101 INFO L140 encePairwiseOnDemand]: 468/485 looper letters, 74 selfloop transitions, 52 changer transitions 1/133 dead transitions. [2023-08-27 02:43:23,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 133 transitions, 929 flow [2023-08-27 02:43:23,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-27 02:43:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-27 02:43:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4052 transitions. [2023-08-27 02:43:23,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37975632614807875 [2023-08-27 02:43:23,111 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4052 transitions. [2023-08-27 02:43:23,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4052 transitions. [2023-08-27 02:43:23,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:43:23,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4052 transitions. [2023-08-27 02:43:23,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 184.1818181818182) internal successors, (4052), 22 states have internal predecessors, (4052), 0 states have call successors, (0), 0 states 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 02:43:23,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 485.0) internal successors, (11155), 23 states have internal predecessors, (11155), 0 states have call successors, (0), 0 states 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 02:43:23,139 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 485.0) internal successors, (11155), 23 states have internal predecessors, (11155), 0 states have call successors, (0), 0 states 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 02:43:23,139 INFO L175 Difference]: Start difference. First operand has 92 places, 80 transitions, 407 flow. Second operand 22 states and 4052 transitions. [2023-08-27 02:43:23,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 133 transitions, 929 flow [2023-08-27 02:43:23,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 133 transitions, 925 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 02:43:23,145 INFO L231 Difference]: Finished difference. Result has 119 places, 116 transitions, 794 flow [2023-08-27 02:43:23,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=794, PETRI_PLACES=119, PETRI_TRANSITIONS=116} [2023-08-27 02:43:23,145 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 60 predicate places. [2023-08-27 02:43:23,146 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 116 transitions, 794 flow [2023-08-27 02:43:23,147 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 02:43:23,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:43:23,147 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:43:23,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-27 02:43:23,360 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,SelfDestructingSolverStorable10 [2023-08-27 02:43:23,361 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:43:23,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:43:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash 156498119, now seen corresponding path program 1 times [2023-08-27 02:43:23,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:43:23,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409415609] [2023-08-27 02:43:23,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:23,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:43:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:24,186 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 02:43:24,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:43:24,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409415609] [2023-08-27 02:43:24,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409415609] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:43:24,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863902874] [2023-08-27 02:43:24,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:24,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:43:24,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:43:24,189 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 02:43:24,213 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 02:43:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:24,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-27 02:43:24,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:43:24,523 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 02:43:24,604 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 02:43:24,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:43:24,644 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 02:43:24,726 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-27 02:43:24,726 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 02:43:24,803 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 02:43:24,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:43:25,066 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:43:25,067 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 02:43:25,080 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:43:25,080 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 02:43:25,090 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 02:43:25,105 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 02:43:25,119 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:43:25,120 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 02:43:25,267 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 02:43:25,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863902874] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:43:25,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:43:25,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 26 [2023-08-27 02:43:25,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877339525] [2023-08-27 02:43:25,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:43:25,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-27 02:43:25,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:43:25,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-27 02:43:25,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=619, Unknown=4, NotChecked=0, Total=756 [2023-08-27 02:43:25,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 485 [2023-08-27 02:43:25,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 116 transitions, 794 flow. Second operand has 28 states, 28 states have (on average 179.60714285714286) internal successors, (5029), 28 states have internal predecessors, (5029), 0 states have call successors, (0), 0 states 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 02:43:25,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:43:25,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 485 [2023-08-27 02:43:25,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:43:26,894 INFO L124 PetriNetUnfolderBase]: 1351/2633 cut-off events. [2023-08-27 02:43:26,894 INFO L125 PetriNetUnfolderBase]: For 1487/1487 co-relation queries the response was YES. [2023-08-27 02:43:26,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6943 conditions, 2633 events. 1351/2633 cut-off events. For 1487/1487 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 15831 event pairs, 626 based on Foata normal form. 10/2351 useless extension candidates. Maximal degree in co-relation 6914. Up to 837 conditions per place. [2023-08-27 02:43:26,910 INFO L140 encePairwiseOnDemand]: 472/485 looper letters, 177 selfloop transitions, 56 changer transitions 4/243 dead transitions. [2023-08-27 02:43:26,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 243 transitions, 1705 flow [2023-08-27 02:43:26,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-27 02:43:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-27 02:43:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3935 transitions. [2023-08-27 02:43:26,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3863524791359843 [2023-08-27 02:43:26,920 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3935 transitions. [2023-08-27 02:43:26,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3935 transitions. [2023-08-27 02:43:26,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:43:26,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3935 transitions. [2023-08-27 02:43:26,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 187.38095238095238) internal successors, (3935), 21 states have internal predecessors, (3935), 0 states have call successors, (0), 0 states 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 02:43:26,940 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 02:43:26,941 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 02:43:26,942 INFO L175 Difference]: Start difference. First operand has 119 places, 116 transitions, 794 flow. Second operand 21 states and 3935 transitions. [2023-08-27 02:43:26,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 243 transitions, 1705 flow [2023-08-27 02:43:26,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 243 transitions, 1557 flow, removed 62 selfloop flow, removed 7 redundant places. [2023-08-27 02:43:26,956 INFO L231 Difference]: Finished difference. Result has 134 places, 124 transitions, 835 flow [2023-08-27 02:43:26,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=835, PETRI_PLACES=134, PETRI_TRANSITIONS=124} [2023-08-27 02:43:26,956 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 75 predicate places. [2023-08-27 02:43:26,956 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 124 transitions, 835 flow [2023-08-27 02:43:26,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 179.60714285714286) internal successors, (5029), 28 states have internal predecessors, (5029), 0 states have call successors, (0), 0 states 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 02:43:26,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:43:26,958 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:43:26,964 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 02:43:27,163 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,SelfDestructingSolverStorable11 [2023-08-27 02:43:27,164 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:43:27,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:43:27,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1827680919, now seen corresponding path program 1 times [2023-08-27 02:43:27,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:43:27,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046567471] [2023-08-27 02:43:27,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:27,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:43:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:27,962 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 02:43:27,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:43:27,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046567471] [2023-08-27 02:43:27,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046567471] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:43:27,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957219209] [2023-08-27 02:43:27,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:27,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:43:27,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:43:27,964 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 02:43:27,966 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 02:43:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:28,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 63 conjunts are in the unsatisfiable core [2023-08-27 02:43:28,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:43:28,118 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 02:43:28,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:43:28,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:43:28,135 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:43:28,135 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 02:43:28,150 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:43:28,151 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 02:43:28,219 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 21 [2023-08-27 02:43:28,323 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-08-27 02:43:28,324 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2023-08-27 02:43:28,409 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-08-27 02:43:28,513 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-08-27 02:43:28,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:43:28,551 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 21 [2023-08-27 02:43:28,618 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-08-27 02:43:28,618 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2023-08-27 02:43:28,647 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 02:43:28,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:43:30,862 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_557 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_553)) |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_557) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_553))))) is different from false [2023-08-27 02:43:33,382 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 Int) (v_ArrVal_551 Int) (v_ArrVal_550 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_557 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_550)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_551) .cse3 v_ArrVal_553)) |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_557) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_551) (< (+ (select .cse1 .cse3) 1) v_ArrVal_553) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|))))) is different from false [2023-08-27 02:43:41,349 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_553 Int) (v_ArrVal_551 Int) (v_ArrVal_550 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_557 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_548))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_550)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_551) .cse1 v_ArrVal_553)) |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_551) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_553) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_557) .cse3) 2147483647))))))) is different from false [2023-08-27 02:43:41,435 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 02:43:41,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957219209] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:43:41,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:43:41,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-27 02:43:41,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720263925] [2023-08-27 02:43:41,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:43:41,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-27 02:43:41,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:43:41,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-27 02:43:41,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=750, Unknown=25, NotChecked=186, Total=1190 [2023-08-27 02:43:41,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 02:43:41,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 124 transitions, 835 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 02:43:41,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:43:41,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 02:43:41,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:43:44,624 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 02:43:46,636 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 02:43:48,642 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 02:43:48,659 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (+ (select .cse4 .cse5) 1)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_553 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_557 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_553)) |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_557) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< .cse3 v_ArrVal_553)))) (forall ((v_ArrVal_553 Int) (v_ArrVal_551 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_557 Int)) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_551) .cse5 v_ArrVal_553)) |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_551) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< .cse3 v_ArrVal_553) (< (select (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_557) .cse1) 2147483647))))))) is different from false [2023-08-27 02:43:51,848 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_557 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_557) .cse2) 2147483647)))) (forall ((v_ArrVal_557 Int)) (< (select (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_557) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_557 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_557) .cse2) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)))))) is different from false [2023-08-27 02:43:52,458 INFO L124 PetriNetUnfolderBase]: 1946/3789 cut-off events. [2023-08-27 02:43:52,458 INFO L125 PetriNetUnfolderBase]: For 2759/2759 co-relation queries the response was YES. [2023-08-27 02:43:52,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10097 conditions, 3789 events. 1946/3789 cut-off events. For 2759/2759 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 24861 event pairs, 918 based on Foata normal form. 18/3392 useless extension candidates. Maximal degree in co-relation 10066. Up to 2248 conditions per place. [2023-08-27 02:43:52,477 INFO L140 encePairwiseOnDemand]: 463/485 looper letters, 193 selfloop transitions, 85 changer transitions 3/287 dead transitions. [2023-08-27 02:43:52,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 287 transitions, 1979 flow [2023-08-27 02:43:52,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-27 02:43:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-27 02:43:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4081 transitions. [2023-08-27 02:43:52,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3824742268041237 [2023-08-27 02:43:52,487 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4081 transitions. [2023-08-27 02:43:52,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4081 transitions. [2023-08-27 02:43:52,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:43:52,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4081 transitions. [2023-08-27 02:43:52,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 185.5) internal successors, (4081), 22 states have internal predecessors, (4081), 0 states have call successors, (0), 0 states 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 02:43:52,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 485.0) internal successors, (11155), 23 states have internal predecessors, (11155), 0 states have call successors, (0), 0 states 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 02:43:52,508 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 485.0) internal successors, (11155), 23 states have internal predecessors, (11155), 0 states have call successors, (0), 0 states 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 02:43:52,508 INFO L175 Difference]: Start difference. First operand has 134 places, 124 transitions, 835 flow. Second operand 22 states and 4081 transitions. [2023-08-27 02:43:52,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 287 transitions, 1979 flow [2023-08-27 02:43:52,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 287 transitions, 1844 flow, removed 37 selfloop flow, removed 16 redundant places. [2023-08-27 02:43:52,525 INFO L231 Difference]: Finished difference. Result has 151 places, 162 transitions, 1245 flow [2023-08-27 02:43:52,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=728, 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=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1245, PETRI_PLACES=151, PETRI_TRANSITIONS=162} [2023-08-27 02:43:52,526 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 92 predicate places. [2023-08-27 02:43:52,526 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 162 transitions, 1245 flow [2023-08-27 02:43:52,527 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 02:43:52,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:43:52,528 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:43:52,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-27 02:43:52,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:43:52,739 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:43:52,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:43:52,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1968124125, now seen corresponding path program 1 times [2023-08-27 02:43:52,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:43:52,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145622084] [2023-08-27 02:43:52,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:52,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:43:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:53,657 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 02:43:53,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:43:53,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145622084] [2023-08-27 02:43:53,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145622084] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:43:53,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143592596] [2023-08-27 02:43:53,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:53,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:43:53,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:43:53,659 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 02:43:53,660 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 02:43:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:53,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 56 conjunts are in the unsatisfiable core [2023-08-27 02:43:53,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:43:53,797 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:43:53,798 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 02:43:53,944 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 02:43:53,984 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 02:43:54,066 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 02:43:54,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:43:54,105 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 02:43:54,177 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-27 02:43:54,177 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 02:43:54,231 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 02:43:54,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:43:54,356 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_643 (Array Int Int)) (v_ArrVal_645 Int)) (or (< (+ v_ArrVal_645 2147483648) 0) (< 0 (+ (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_643) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_645) (+ 1608 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2023-08-27 02:43:54,526 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:43:54,526 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 48 [2023-08-27 02:43:54,540 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:43:54,541 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 889 treesize of output 879 [2023-08-27 02:43:54,564 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 490 treesize of output 458 [2023-08-27 02:43:54,589 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 612 treesize of output 588 [2023-08-27 02:43:55,444 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 02:43:55,448 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 02:43:55,461 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 02:43:55,467 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 02:43:55,482 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 02:43:55,486 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 02:43:55,494 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 02:43:55,499 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 02:43:55,512 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 02:43:55,583 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:43:55,584 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 510 treesize of output 478 [2023-08-27 02:43:55,753 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 02:43:55,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143592596] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:43:55,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:43:55,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2023-08-27 02:43:55,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122943729] [2023-08-27 02:43:55,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:43:55,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-27 02:43:55,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:43:55,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-27 02:43:55,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=724, Unknown=7, NotChecked=56, Total=930 [2023-08-27 02:43:55,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 485 [2023-08-27 02:43:55,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 162 transitions, 1245 flow. Second operand has 31 states, 31 states have (on average 175.5483870967742) internal successors, (5442), 31 states have internal predecessors, (5442), 0 states have call successors, (0), 0 states 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 02:43:55,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:43:55,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 485 [2023-08-27 02:43:55,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:43:57,390 INFO L124 PetriNetUnfolderBase]: 2275/4446 cut-off events. [2023-08-27 02:43:57,390 INFO L125 PetriNetUnfolderBase]: For 9030/9186 co-relation queries the response was YES. [2023-08-27 02:43:57,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15662 conditions, 4446 events. 2275/4446 cut-off events. For 9030/9186 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 30301 event pairs, 689 based on Foata normal form. 14/4002 useless extension candidates. Maximal degree in co-relation 15624. Up to 2732 conditions per place. [2023-08-27 02:43:57,419 INFO L140 encePairwiseOnDemand]: 472/485 looper letters, 197 selfloop transitions, 54 changer transitions 3/260 dead transitions. [2023-08-27 02:43:57,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 260 transitions, 2305 flow [2023-08-27 02:43:57,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-27 02:43:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-27 02:43:57,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2772 transitions. [2023-08-27 02:43:57,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38103092783505155 [2023-08-27 02:43:57,424 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2772 transitions. [2023-08-27 02:43:57,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2772 transitions. [2023-08-27 02:43:57,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:43:57,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2772 transitions. [2023-08-27 02:43:57,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 184.8) internal successors, (2772), 15 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states 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 02:43:57,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 485.0) internal successors, (7760), 16 states have internal predecessors, (7760), 0 states have call successors, (0), 0 states 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 02:43:57,435 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 485.0) internal successors, (7760), 16 states have internal predecessors, (7760), 0 states have call successors, (0), 0 states 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 02:43:57,436 INFO L175 Difference]: Start difference. First operand has 151 places, 162 transitions, 1245 flow. Second operand 15 states and 2772 transitions. [2023-08-27 02:43:57,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 260 transitions, 2305 flow [2023-08-27 02:43:57,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 260 transitions, 2191 flow, removed 34 selfloop flow, removed 6 redundant places. [2023-08-27 02:43:57,460 INFO L231 Difference]: Finished difference. Result has 161 places, 171 transitions, 1371 flow [2023-08-27 02:43:57,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1371, PETRI_PLACES=161, PETRI_TRANSITIONS=171} [2023-08-27 02:43:57,461 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 102 predicate places. [2023-08-27 02:43:57,461 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 171 transitions, 1371 flow [2023-08-27 02:43:57,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 175.5483870967742) internal successors, (5442), 31 states have internal predecessors, (5442), 0 states have call successors, (0), 0 states 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 02:43:57,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:43:57,462 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:43:57,471 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 02:43:57,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:43:57,668 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 02:43:57,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:43:57,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1968124107, now seen corresponding path program 2 times [2023-08-27 02:43:57,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:43:57,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647679763] [2023-08-27 02:43:57,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:57,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:43:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:58,516 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 02:43:58,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:43:58,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647679763] [2023-08-27 02:43:58,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647679763] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:43:58,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227473828] [2023-08-27 02:43:58,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 02:43:58,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:43:58,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:43:58,519 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 02:43:58,521 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 02:43:58,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 02:43:58,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 02:43:58,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 77 conjunts are in the unsatisfiable core [2023-08-27 02:43:58,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:43:58,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:43:58,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:43:58,711 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:43:58,711 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 02:43:58,731 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:43:58,732 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 02:43:58,853 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 02:43:58,972 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 02:43:59,028 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 02:43:59,154 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 02:43:59,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:43:59,209 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 02:43:59,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 47 treesize of output 40 [2023-08-27 02:43:59,420 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 02:43:59,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:43:59,508 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_746 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_748 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_746) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_748) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 02:43:59,597 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_746 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_748 Int) (v_ArrVal_744 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_744)) |c_~#stored_elements~0.base| v_ArrVal_746) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_744) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_748) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-27 02:43:59,627 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_746 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_748 Int) (v_ArrVal_744 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_743))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_744)) |c_~#stored_elements~0.base| v_ArrVal_746) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_744) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_748) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-08-27 02:43:59,655 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_746 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_748 Int) (v_ArrVal_744 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|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_742)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_743))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_744)) |c_~#stored_elements~0.base| v_ArrVal_746) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_748) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_744) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_742) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|)))))) is different from false [2023-08-27 02:43:59,690 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_746 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_748 Int) (v_ArrVal_744 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_742)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_743))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_744)) |c_~#stored_elements~0.base| v_ArrVal_746) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_748) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_742) (< (+ (select .cse3 .cse4) 1) v_ArrVal_744) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|))))))) is different from false [2023-08-27 02:43:59,715 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 Int) (v_ArrVal_746 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_748 Int) (v_ArrVal_744 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_740)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_742)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_743))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_744)) |c_~#stored_elements~0.base| v_ArrVal_746) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_742) (< (+ (select .cse3 .cse4) 1) v_ArrVal_744) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_748) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2023-08-27 02:43:59,737 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 Int) (v_ArrVal_746 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_58| Int) (v_ArrVal_748 Int) (v_ArrVal_744 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_58|) |c_~#queue~0.offset|) v_ArrVal_740)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse1 v_ArrVal_742)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_743))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse3 .cse2 v_ArrVal_744)) |c_~#stored_elements~0.base| v_ArrVal_746) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_748) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (< (+ (select .cse3 .cse2) 1) v_ArrVal_744) (< (+ (select .cse4 .cse1) 1) v_ArrVal_742) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_58|)))))))) is different from false [2023-08-27 02:43:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-27 02:43:59,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227473828] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:43:59,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:43:59,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-27 02:43:59,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868345127] [2023-08-27 02:43:59,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:43:59,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-27 02:43:59,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:43:59,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-27 02:43:59,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=569, Unknown=8, NotChecked=406, Total=1190 [2023-08-27 02:43:59,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 02:43:59,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 171 transitions, 1371 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 02:43:59,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:43:59,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 02:43:59,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:44:02,252 INFO L124 PetriNetUnfolderBase]: 2467/4805 cut-off events. [2023-08-27 02:44:02,252 INFO L125 PetriNetUnfolderBase]: For 10349/10506 co-relation queries the response was YES. [2023-08-27 02:44:02,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17253 conditions, 4805 events. 2467/4805 cut-off events. For 10349/10506 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 33326 event pairs, 797 based on Foata normal form. 7/4326 useless extension candidates. Maximal degree in co-relation 17212. Up to 3528 conditions per place. [2023-08-27 02:44:02,281 INFO L140 encePairwiseOnDemand]: 474/485 looper letters, 186 selfloop transitions, 50 changer transitions 3/245 dead transitions. [2023-08-27 02:44:02,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 245 transitions, 2358 flow [2023-08-27 02:44:02,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-27 02:44:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-27 02:44:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2592 transitions. [2023-08-27 02:44:02,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38173784977908687 [2023-08-27 02:44:02,287 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2592 transitions. [2023-08-27 02:44:02,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2592 transitions. [2023-08-27 02:44:02,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:44:02,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2592 transitions. [2023-08-27 02:44:02,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 185.14285714285714) internal successors, (2592), 14 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states 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 02:44:02,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 485.0) internal successors, (7275), 15 states have internal predecessors, (7275), 0 states have call successors, (0), 0 states 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 02:44:02,296 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 485.0) internal successors, (7275), 15 states have internal predecessors, (7275), 0 states have call successors, (0), 0 states 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 02:44:02,296 INFO L175 Difference]: Start difference. First operand has 161 places, 171 transitions, 1371 flow. Second operand 14 states and 2592 transitions. [2023-08-27 02:44:02,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 245 transitions, 2358 flow [2023-08-27 02:44:02,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 245 transitions, 2286 flow, removed 15 selfloop flow, removed 8 redundant places. [2023-08-27 02:44:02,327 INFO L231 Difference]: Finished difference. Result has 169 places, 176 transitions, 1490 flow [2023-08-27 02:44:02,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1490, PETRI_PLACES=169, PETRI_TRANSITIONS=176} [2023-08-27 02:44:02,328 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 110 predicate places. [2023-08-27 02:44:02,328 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 176 transitions, 1490 flow [2023-08-27 02:44:02,329 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 02:44:02,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:44:02,329 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:44:02,339 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 02:44:02,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-27 02:44:02,537 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:44:02,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:44:02,538 INFO L85 PathProgramCache]: Analyzing trace with hash 555652901, now seen corresponding path program 3 times [2023-08-27 02:44:02,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:44:02,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151750326] [2023-08-27 02:44:02,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:02,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:44:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:03,360 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 02:44:03,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:44:03,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151750326] [2023-08-27 02:44:03,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151750326] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:44:03,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914328543] [2023-08-27 02:44:03,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 02:44:03,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:44:03,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:44:03,365 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 02:44:03,372 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 02:44:03,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-27 02:44:03,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 02:44:03,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-27 02:44:03,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:44:03,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:44:03,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:44:03,551 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:44:03,551 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 02:44:03,568 INFO L322 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-08-27 02:44:03,569 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 29 treesize of output 34 [2023-08-27 02:44:03,659 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 02:44:03,756 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 02:44:03,894 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 02:44:03,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:44:03,953 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 02:44:04,007 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 02:44:04,130 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 02:44:04,235 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 02:44:04,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:44:04,364 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_850 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_847) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_848) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_~#queue~0.offset|) v_ArrVal_850) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|)))) is different from false [2023-08-27 02:44:04,440 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_850 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_846 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_846)) |c_~#stored_elements~0.base| v_ArrVal_847) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_848) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_~#queue~0.offset|) v_ArrVal_850) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_846))))) is different from false [2023-08-27 02:44:08,401 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 02:44:08,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914328543] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:44:08,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:44:08,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-27 02:44:08,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194921427] [2023-08-27 02:44:08,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:44:08,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-27 02:44:08,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:44:08,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-27 02:44:08,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=786, Unknown=29, NotChecked=126, Total=1190 [2023-08-27 02:44:08,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 02:44:08,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 176 transitions, 1490 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 02:44:08,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:44:08,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 02:44:08,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:44:17,756 WARN L234 SmtUtils]: Spent 6.10s 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 02:44:27,101 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 02:44:29,120 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 02:44:31,158 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 02:44:37,877 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 02:44:40,129 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 02:44:42,346 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 02:44:45,090 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 02:44:47,234 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 02:44:49,247 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 02:44:51,893 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 02:44:53,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 02:44:57,957 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 02:45:00,224 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 02:45:04,259 INFO L124 PetriNetUnfolderBase]: 3130/6079 cut-off events. [2023-08-27 02:45:04,259 INFO L125 PetriNetUnfolderBase]: For 13406/13613 co-relation queries the response was YES. [2023-08-27 02:45:04,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21903 conditions, 6079 events. 3130/6079 cut-off events. For 13406/13613 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 44145 event pairs, 1085 based on Foata normal form. 14/5454 useless extension candidates. Maximal degree in co-relation 21862. Up to 3246 conditions per place. [2023-08-27 02:45:04,290 INFO L140 encePairwiseOnDemand]: 464/485 looper letters, 227 selfloop transitions, 129 changer transitions 3/365 dead transitions. [2023-08-27 02:45:04,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 365 transitions, 3490 flow [2023-08-27 02:45:04,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-27 02:45:04,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-27 02:45:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 5157 transitions. [2023-08-27 02:45:04,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37974963181148746 [2023-08-27 02:45:04,297 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 5157 transitions. [2023-08-27 02:45:04,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 5157 transitions. [2023-08-27 02:45:04,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:45:04,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 5157 transitions. [2023-08-27 02:45:04,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 184.17857142857142) internal successors, (5157), 28 states have internal predecessors, (5157), 0 states have call successors, (0), 0 states 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 02:45:04,314 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 02:45:04,315 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 02:45:04,315 INFO L175 Difference]: Start difference. First operand has 169 places, 176 transitions, 1490 flow. Second operand 28 states and 5157 transitions. [2023-08-27 02:45:04,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 365 transitions, 3490 flow [2023-08-27 02:45:04,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 365 transitions, 3445 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-27 02:45:04,351 INFO L231 Difference]: Finished difference. Result has 198 places, 222 transitions, 2285 flow [2023-08-27 02:45:04,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=2285, PETRI_PLACES=198, PETRI_TRANSITIONS=222} [2023-08-27 02:45:04,352 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 139 predicate places. [2023-08-27 02:45:04,352 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 222 transitions, 2285 flow [2023-08-27 02:45:04,353 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 02:45:04,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:45:04,353 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:45:04,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-27 02:45:04,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-27 02:45:04,558 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 02:45:04,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:45:04,559 INFO L85 PathProgramCache]: Analyzing trace with hash 556475951, now seen corresponding path program 4 times [2023-08-27 02:45:04,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:45:04,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820294975] [2023-08-27 02:45:04,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:45:04,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:45:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:45:05,405 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 02:45:05,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:45:05,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820294975] [2023-08-27 02:45:05,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820294975] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:45:05,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896997281] [2023-08-27 02:45:05,406 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 02:45:05,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:45:05,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:45:05,407 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 02:45:05,410 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 02:45:05,552 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 02:45:05,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 02:45:05,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-27 02:45:05,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:45:05,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:45:05,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:45:05,591 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:45:05,591 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 02:45:05,611 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:45:05,611 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 02:45:05,726 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 02:45:05,826 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 02:45:05,959 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 02:45:06,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:45:06,015 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 02:45:06,121 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 02:45:06,270 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 02:45:06,446 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 02:45:06,447 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:45:06,472 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_953) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-08-27 02:45:06,564 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_950))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_952)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_953) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|))))) is different from false [2023-08-27 02:45:06,577 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_949 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_949)) |c_~#stored_elements~0.base| v_ArrVal_950))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_952)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_953) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_949))))) is different from false [2023-08-27 02:45:06,591 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_949 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_949)) |c_~#stored_elements~0.base| v_ArrVal_950))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_952)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_953) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_949) (< (select .cse1 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)))))) is different from false [2023-08-27 02:45:06,619 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_947 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_947) .cse3 v_ArrVal_949)) |c_~#stored_elements~0.base| v_ArrVal_950))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |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_952)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_953) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_947) (< (+ (select .cse2 .cse3) 1) v_ArrVal_949)))))) is different from false [2023-08-27 02:45:06,829 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_949 Int) (v_ArrVal_947 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_944 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse2 (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_944)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse4 v_ArrVal_947) .cse3 v_ArrVal_949)) |c_~#stored_elements~0.base| v_ArrVal_950))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_952)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_953) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_949) (< (+ (select .cse2 .cse4) 1) v_ArrVal_947)))))) is different from false [2023-08-27 02:45:10,970 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 02:45:10,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896997281] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:45:10,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:45:10,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-27 02:45:10,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419115408] [2023-08-27 02:45:10,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:45:10,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-27 02:45:10,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:45:10,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-27 02:45:10,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=595, Unknown=12, NotChecked=354, Total=1190 [2023-08-27 02:45:10,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 02:45:10,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 222 transitions, 2285 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 02:45:10,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:45:10,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 02:45:10,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:45:25,024 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 02:45:35,313 WARN L234 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 122 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 02:45:37,317 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 02:45:39,330 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 02:45:41,338 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 02:45:43,345 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 02:45:45,351 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 02:45:47,356 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 02:45:49,369 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 02:45:51,377 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 02:45:53,385 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 02:45:55,391 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 02:45:57,397 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 02:45:59,449 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 02:46:01,576 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 02:46:09,847 WARN L234 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 145 DAG size of output: 81 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 02:46:14,006 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 02:46:16,023 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 02:46:18,036 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 02:46:20,041 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 02:46:22,046 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 02:46:24,052 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 02:46:26,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:46:28,097 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 02:46:30,106 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 02:46:32,114 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 02:46:34,123 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 02:46:36,131 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 02:46:38,138 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 02:46:40,177 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 02:46:42,192 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 02:46:44,204 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 02:46:46,217 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 02:46:58,841 WARN L234 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 122 DAG size of output: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 02:47:00,846 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 02:47:21,584 WARN L234 SmtUtils]: Spent 8.09s 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 02:47:23,615 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 02:47:25,678 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 02:47:27,697 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 02:47:29,713 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 02:47:31,726 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 02:47:33,736 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 02:47:35,767 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 02:47:37,782 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 02:47:50,252 WARN L234 SmtUtils]: Spent 8.34s on a formula simplification. DAG size of input: 118 DAG size of output: 81 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 02:47:52,257 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 02:48:18,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 02:48:20,798 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 02:48:22,851 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 02:48:24,877 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 02:48:26,899 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 02:48:28,907 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 02:48:30,918 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 02:48:32,924 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 02:48:34,932 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 02:48:52,249 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 02:48:54,260 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 02:48:56,269 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 02:48:58,333 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 02:49:00,370 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 02:49:02,382 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 02:49:04,392 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 02:49:06,399 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 02:49:08,408 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 02:49:10,416 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 02:49:12,518 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 02:49:14,536 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 02:49:16,546 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 02:49:18,640 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 02:49:20,679 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 02:49:22,833 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 02:49:24,846 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 02:49:26,959 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 02:49:29,003 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 02:49:31,017 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 02:49:33,218 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 02:49:33,363 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (< (select .cse0 .cse1) 2147483647) (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_952 Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_952)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_953) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1) 2147483647)) (forall ((v_ArrVal_953 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68| Int) (v_ArrVal_952 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)) v_ArrVal_952)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_953) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_68|)))))) is different from false [2023-08-27 02:49:35,511 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 02:49:37,526 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 02:49:39,538 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 02:49:41,748 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 02:49:42,839 INFO L124 PetriNetUnfolderBase]: 4189/8125 cut-off events. [2023-08-27 02:49:42,839 INFO L125 PetriNetUnfolderBase]: For 60229/60776 co-relation queries the response was YES. [2023-08-27 02:49:42,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40420 conditions, 8125 events. 4189/8125 cut-off events. For 60229/60776 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 61481 event pairs, 1481 based on Foata normal form. 29/7395 useless extension candidates. Maximal degree in co-relation 40369. Up to 4922 conditions per place. [2023-08-27 02:49:42,888 INFO L140 encePairwiseOnDemand]: 462/485 looper letters, 276 selfloop transitions, 207 changer transitions 3/492 dead transitions. [2023-08-27 02:49:42,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 492 transitions, 6552 flow [2023-08-27 02:49:42,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-08-27 02:49:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-08-27 02:49:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 6594 transitions. [2023-08-27 02:49:42,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3776632302405498 [2023-08-27 02:49:42,896 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 6594 transitions. [2023-08-27 02:49:42,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 6594 transitions. [2023-08-27 02:49:42,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:49:42,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 6594 transitions. [2023-08-27 02:49:42,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 183.16666666666666) internal successors, (6594), 36 states have internal predecessors, (6594), 0 states have call successors, (0), 0 states 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 02:49:42,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 485.0) internal successors, (17945), 37 states have internal predecessors, (17945), 0 states have call successors, (0), 0 states 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 02:49:42,920 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 485.0) internal successors, (17945), 37 states have internal predecessors, (17945), 0 states have call successors, (0), 0 states 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 02:49:42,920 INFO L175 Difference]: Start difference. First operand has 198 places, 222 transitions, 2285 flow. Second operand 36 states and 6594 transitions. [2023-08-27 02:49:42,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 492 transitions, 6552 flow [2023-08-27 02:49:42,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 492 transitions, 6126 flow, removed 131 selfloop flow, removed 13 redundant places. [2023-08-27 02:49:42,995 INFO L231 Difference]: Finished difference. Result has 241 places, 361 transitions, 4648 flow [2023-08-27 02:49:42,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=2038, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=4648, PETRI_PLACES=241, PETRI_TRANSITIONS=361} [2023-08-27 02:49:42,995 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 182 predicate places. [2023-08-27 02:49:42,996 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 361 transitions, 4648 flow [2023-08-27 02:49:42,996 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 02:49:42,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:49:42,996 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:49:43,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-27 02:49:43,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:49:43,197 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:49:43,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:49:43,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1931495920, now seen corresponding path program 1 times [2023-08-27 02:49:43,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:49:43,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083128167] [2023-08-27 02:49:43,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:49:43,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:49:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:49:43,573 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 02:49:43,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:49:43,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083128167] [2023-08-27 02:49:43,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083128167] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:49:43,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971048113] [2023-08-27 02:49:43,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:49:43,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:49:43,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:49:43,577 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 02:49:43,581 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 02:49:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:49:43,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-27 02:49:43,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:49:43,858 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 02:49:43,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:49:43,884 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 02:49:43,938 INFO L322 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-08-27 02:49:43,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 33 [2023-08-27 02:49:43,972 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 02:49:43,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 02:49:43,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:49:44,153 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:49:44,153 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 02:49:44,162 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:49:44,162 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 02:49:44,167 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 02:49:44,179 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 02:49:44,194 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:49:44,194 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 02:49:44,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 02:49:44,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971048113] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:49:44,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:49:44,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 22 [2023-08-27 02:49:44,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168557544] [2023-08-27 02:49:44,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:49:44,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-27 02:49:44,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:49:44,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-27 02:49:44,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=460, Unknown=5, NotChecked=0, Total=552 [2023-08-27 02:49:44,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 02:49:44,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 361 transitions, 4648 flow. Second operand has 24 states, 24 states have (on average 186.375) internal successors, (4473), 24 states have internal predecessors, (4473), 0 states have call successors, (0), 0 states 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 02:49:44,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:49:44,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 02:49:44,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:49:47,578 INFO L124 PetriNetUnfolderBase]: 6004/11634 cut-off events. [2023-08-27 02:49:47,578 INFO L125 PetriNetUnfolderBase]: For 403029/404774 co-relation queries the response was YES. [2023-08-27 02:49:47,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88537 conditions, 11634 events. 6004/11634 cut-off events. For 403029/404774 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 94822 event pairs, 2055 based on Foata normal form. 19/10576 useless extension candidates. Maximal degree in co-relation 88465. Up to 4278 conditions per place. [2023-08-27 02:49:47,661 INFO L140 encePairwiseOnDemand]: 470/485 looper letters, 429 selfloop transitions, 176 changer transitions 4/615 dead transitions. [2023-08-27 02:49:47,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 615 transitions, 9720 flow [2023-08-27 02:49:47,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-27 02:49:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-27 02:49:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3527 transitions. [2023-08-27 02:49:47,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40400916380297824 [2023-08-27 02:49:47,665 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3527 transitions. [2023-08-27 02:49:47,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3527 transitions. [2023-08-27 02:49:47,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:49:47,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3527 transitions. [2023-08-27 02:49:47,670 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 02:49:47,676 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 02:49:47,677 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 02:49:47,677 INFO L175 Difference]: Start difference. First operand has 241 places, 361 transitions, 4648 flow. Second operand 18 states and 3527 transitions. [2023-08-27 02:49:47,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 615 transitions, 9720 flow [2023-08-27 02:49:47,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 615 transitions, 8672 flow, removed 496 selfloop flow, removed 5 redundant places. [2023-08-27 02:49:47,918 INFO L231 Difference]: Finished difference. Result has 257 places, 426 transitions, 5312 flow [2023-08-27 02:49:47,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=3960, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5312, PETRI_PLACES=257, PETRI_TRANSITIONS=426} [2023-08-27 02:49:47,919 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 198 predicate places. [2023-08-27 02:49:47,919 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 426 transitions, 5312 flow [2023-08-27 02:49:47,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 186.375) internal successors, (4473), 24 states have internal predecessors, (4473), 0 states have call successors, (0), 0 states 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 02:49:47,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:49:47,919 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:49:47,924 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 02:49:48,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-27 02:49:48,120 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:49:48,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:49:48,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1931495903, now seen corresponding path program 1 times [2023-08-27 02:49:48,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:49:48,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515873266] [2023-08-27 02:49:48,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:49:48,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:49:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:49:48,792 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 02:49:48,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:49:48,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515873266] [2023-08-27 02:49:48,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515873266] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:49:48,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371277029] [2023-08-27 02:49:48,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:49:48,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:49:48,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:49:48,793 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 02:49:48,795 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 02:49:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:49:48,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 74 conjunts are in the unsatisfiable core [2023-08-27 02:49:48,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:49:48,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:49:48,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:49:48,952 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:49:48,952 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 02:49:48,966 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:49:48,966 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 02:49:49,048 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 02:49:49,094 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 27 treesize of output 29 [2023-08-27 02:49:49,161 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-08-27 02:49:49,254 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 02:49:49,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:49:49,294 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 02:49:49,389 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 02:49:49,515 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 02:49:49,661 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 02:49:49,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:49:49,854 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1146 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1148 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1146)) |c_~#stored_elements~0.base| v_ArrVal_1147) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1146) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1148) .cse3) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|))))) is different from false [2023-08-27 02:49:49,955 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1144 Int) (v_ArrVal_1146 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1142 (Array Int Int)) (v_ArrVal_1148 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1142))) (let ((.cse0 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1144) .cse1 v_ArrVal_1146)) |c_~#stored_elements~0.base| v_ArrVal_1147) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1146) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1148) .cse3) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)))))) is different from false [2023-08-27 02:49:49,973 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1140 Int) (v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1144 Int) (v_ArrVal_1146 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1142 (Array Int Int)) (v_ArrVal_1148 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|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1140)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1142))) (let ((.cse2 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1144) .cse3 v_ArrVal_1146)) |c_~#stored_elements~0.base| v_ArrVal_1147) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1146) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1148) .cse1) 2147483647)))))) is different from false [2023-08-27 02:49:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-27 02:49:52,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371277029] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:49:52,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:49:52,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2023-08-27 02:49:52,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298183596] [2023-08-27 02:49:52,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:49:52,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-27 02:49:52,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:49:52,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-27 02:49:52,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=555, Unknown=12, NotChecked=162, Total=930 [2023-08-27 02:49:52,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 485 [2023-08-27 02:49:52,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 426 transitions, 5312 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 02:49:52,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:49:52,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 485 [2023-08-27 02:49:52,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:50:07,023 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 02:50:09,034 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 02:50:11,056 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 02:50:13,063 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 02:50:15,074 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 02:50:15,085 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (+ (select .cse3 .cse4) 1)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1146 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1148 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1146)) |c_~#stored_elements~0.base| v_ArrVal_1147) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_1146) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1148) .cse2) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)))) (forall ((v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1144 Int) (v_ArrVal_1146 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1148 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1144) .cse4 v_ArrVal_1146)) |c_~#stored_elements~0.base| v_ArrVal_1147) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_1146) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1148) .cse2) 2147483647) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|))))))) is different from false [2023-08-27 02:50:15,996 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1147 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1148 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1147) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1148) .cse1) 2147483647) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1148 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1148) .cse1) 2147483647) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)))))) is different from false [2023-08-27 02:50:18,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 [1] [2023-08-27 02:50:21,254 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 02:50:24,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 02:50:24,752 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1144 Int) (v_ArrVal_1146 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_1142 (Array Int Int)) (v_ArrVal_1148 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1142))) (let ((.cse0 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse2 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1144) .cse1 v_ArrVal_1146)) |c_~#stored_elements~0.base| v_ArrVal_1147) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1146) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_1148) .cse3) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)))))) (not (= 401 |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1|)) (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1) 1))) is different from false [2023-08-27 02:50:26,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 02:50:29,336 INFO L124 PetriNetUnfolderBase]: 7462/14444 cut-off events. [2023-08-27 02:50:29,336 INFO L125 PetriNetUnfolderBase]: For 481511/483047 co-relation queries the response was YES. [2023-08-27 02:50:29,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109946 conditions, 14444 events. 7462/14444 cut-off events. For 481511/483047 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 120864 event pairs, 2335 based on Foata normal form. 197/13400 useless extension candidates. Maximal degree in co-relation 109869. Up to 6561 conditions per place. [2023-08-27 02:50:29,457 INFO L140 encePairwiseOnDemand]: 463/485 looper letters, 387 selfloop transitions, 329 changer transitions 3/725 dead transitions. [2023-08-27 02:50:29,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 725 transitions, 12658 flow [2023-08-27 02:50:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-27 02:50:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-27 02:50:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 6656 transitions. [2023-08-27 02:50:29,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3921060382916053 [2023-08-27 02:50:29,465 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 6656 transitions. [2023-08-27 02:50:29,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 6656 transitions. [2023-08-27 02:50:29,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:50:29,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 6656 transitions. [2023-08-27 02:50:29,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 190.17142857142858) internal successors, (6656), 35 states have internal predecessors, (6656), 0 states have call successors, (0), 0 states 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 02:50:29,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 485.0) internal successors, (17460), 36 states have internal predecessors, (17460), 0 states have call successors, (0), 0 states 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 02:50:29,487 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 485.0) internal successors, (17460), 36 states have internal predecessors, (17460), 0 states have call successors, (0), 0 states 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 02:50:29,487 INFO L175 Difference]: Start difference. First operand has 257 places, 426 transitions, 5312 flow. Second operand 35 states and 6656 transitions. [2023-08-27 02:50:29,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 725 transitions, 12658 flow [2023-08-27 02:50:29,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 725 transitions, 12418 flow, removed 116 selfloop flow, removed 4 redundant places. [2023-08-27 02:50:29,866 INFO L231 Difference]: Finished difference. Result has 302 places, 544 transitions, 8292 flow [2023-08-27 02:50:29,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=4912, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=8292, PETRI_PLACES=302, PETRI_TRANSITIONS=544} [2023-08-27 02:50:29,867 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 243 predicate places. [2023-08-27 02:50:29,867 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 544 transitions, 8292 flow [2023-08-27 02:50:29,868 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 02:50:29,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:50:29,868 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:50:29,872 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 02:50:30,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:50:30,068 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:50:30,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:50:30,069 INFO L85 PathProgramCache]: Analyzing trace with hash -147603924, now seen corresponding path program 2 times [2023-08-27 02:50:30,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:50:30,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942792300] [2023-08-27 02:50:30,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:50:30,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:50:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:50:30,499 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 02:50:30,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:50:30,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942792300] [2023-08-27 02:50:30,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942792300] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:50:30,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793414433] [2023-08-27 02:50:30,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 02:50:30,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:50:30,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:50:30,500 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 02:50:30,505 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 02:50:30,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 02:50:30,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 02:50:30,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 61 conjunts are in the unsatisfiable core [2023-08-27 02:50:30,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:50:30,767 INFO L322 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2023-08-27 02:50:30,767 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 35 treesize of output 55 [2023-08-27 02:50:30,916 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 13 treesize of output 9 [2023-08-27 02:50:30,960 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 18 treesize of output 20 [2023-08-27 02:50:30,983 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 18 treesize of output 20 [2023-08-27 02:50:31,030 INFO L322 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-08-27 02:50:31,030 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 27 treesize of output 30 [2023-08-27 02:50:31,075 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 25 treesize of output 24 [2023-08-27 02:50:31,080 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 02:50:31,080 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:50:31,194 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1240 Int) (v_ArrVal_1238 (Array Int Int))) (or (< 0 (+ (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1238) |c_~#stored_elements~0.base| v_ArrVal_1239) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1240) (+ |c_~#queue~0.offset| 1604)) 2147483650)) (< (+ v_ArrVal_1240 2147483648) 0))) is different from false [2023-08-27 02:50:31,203 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:50:31,204 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 34 treesize of output 35 [2023-08-27 02:50:31,212 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:50:31,212 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 107 treesize of output 111 [2023-08-27 02:50:31,216 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 110 treesize of output 102 [2023-08-27 02:50:31,223 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 47 treesize of output 43 [2023-08-27 02:50:31,244 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 02:50:31,253 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:50:31,253 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 62 treesize of output 62 [2023-08-27 02:50:31,387 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 02:50:31,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793414433] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:50:31,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:50:31,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-08-27 02:50:31,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293089003] [2023-08-27 02:50:31,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:50:31,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-27 02:50:31,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:50:31,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-27 02:50:31,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=378, Unknown=5, NotChecked=40, Total=506 [2023-08-27 02:50:31,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 485 [2023-08-27 02:50:31,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 544 transitions, 8292 flow. Second operand has 23 states, 23 states have (on average 184.47826086956522) internal successors, (4243), 23 states have internal predecessors, (4243), 0 states have call successors, (0), 0 states 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 02:50:31,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:50:31,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 485 [2023-08-27 02:50:31,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:50:35,062 INFO L124 PetriNetUnfolderBase]: 7382/14335 cut-off events. [2023-08-27 02:50:35,062 INFO L125 PetriNetUnfolderBase]: For 859149/861495 co-relation queries the response was YES. [2023-08-27 02:50:35,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132937 conditions, 14335 events. 7382/14335 cut-off events. For 859149/861495 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 120436 event pairs, 4164 based on Foata normal form. 62/13226 useless extension candidates. Maximal degree in co-relation 132846. Up to 13259 conditions per place. [2023-08-27 02:50:35,196 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 550 selfloop transitions, 7 changer transitions 3/566 dead transitions. [2023-08-27 02:50:35,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 566 transitions, 9595 flow [2023-08-27 02:50:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 02:50:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 02:50:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 992 transitions. [2023-08-27 02:50:35,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090721649484536 [2023-08-27 02:50:35,197 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 992 transitions. [2023-08-27 02:50:35,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 992 transitions. [2023-08-27 02:50:35,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:50:35,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 992 transitions. [2023-08-27 02:50:35,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 198.4) internal successors, (992), 5 states have internal predecessors, (992), 0 states have call successors, (0), 0 states 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 02:50:35,200 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 02:50:35,201 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 02:50:35,201 INFO L175 Difference]: Start difference. First operand has 302 places, 544 transitions, 8292 flow. Second operand 5 states and 992 transitions. [2023-08-27 02:50:35,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 566 transitions, 9595 flow [2023-08-27 02:50:35,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 566 transitions, 8532 flow, removed 470 selfloop flow, removed 9 redundant places. [2023-08-27 02:50:35,628 INFO L231 Difference]: Finished difference. Result has 295 places, 534 transitions, 7108 flow [2023-08-27 02:50:35,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=7094, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7108, PETRI_PLACES=295, PETRI_TRANSITIONS=534} [2023-08-27 02:50:35,629 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 236 predicate places. [2023-08-27 02:50:35,629 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 534 transitions, 7108 flow [2023-08-27 02:50:35,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 184.47826086956522) internal successors, (4243), 23 states have internal predecessors, (4243), 0 states have call successors, (0), 0 states 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 02:50:35,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:50:35,629 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:50:35,634 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 02:50:35,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:50:35,830 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 02:50:35,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:50:35,831 INFO L85 PathProgramCache]: Analyzing trace with hash -604090177, now seen corresponding path program 2 times [2023-08-27 02:50:35,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:50:35,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279416761] [2023-08-27 02:50:35,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:50:35,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:50:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:50:36,554 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 02:50:36,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:50:36,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279416761] [2023-08-27 02:50:36,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279416761] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:50:36,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448855118] [2023-08-27 02:50:36,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 02:50:36,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:50:36,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:50:36,556 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 02:50:36,576 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 02:50:36,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 02:50:36,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 02:50:36,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-27 02:50:36,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:50:36,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:50:36,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:50:36,792 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:50:36,792 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 02:50:36,807 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:50:36,807 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-27 02:50:36,890 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 02:50:36,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 32 treesize of output 27 [2023-08-27 02:50:37,054 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 02:50:37,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:50:37,101 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 02:50:37,183 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 02:50:37,275 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 02:50:37,347 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 02:50:37,408 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 02:50:37,408 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:50:37,424 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1352) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) 2147483647)) is different from false [2023-08-27 02:50:37,429 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1351 Int) (v_ArrVal_1352 (Array Int 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|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1351)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1352) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) 2147483647)) is different from false [2023-08-27 02:50:44,737 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1351 Int) (v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1346 Int) (v_ArrVal_1348 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1344) .cse4 v_ArrVal_1346)) |c_~#stored_elements~0.base| v_ArrVal_1347))) (store .cse0 |c_~#queue~0.base| (store (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1348)) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1351))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1352) |c_~#queue~0.base|) .cse2)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1346)))) is different from false [2023-08-27 02:50:57,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-27 02:50:57,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448855118] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:50:57,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:50:57,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 30 [2023-08-27 02:50:57,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223516505] [2023-08-27 02:50:57,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:50:57,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-27 02:50:57,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:50:57,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-27 02:50:57,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=593, Unknown=26, NotChecked=168, Total=992 [2023-08-27 02:50:57,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 485 [2023-08-27 02:50:57,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 534 transitions, 7108 flow. Second operand has 32 states, 32 states have (on average 182.78125) internal successors, (5849), 32 states have internal predecessors, (5849), 0 states have call successors, (0), 0 states 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 02:50:57,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:50:57,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 485 [2023-08-27 02:50:57,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:51:06,570 WARN L234 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 75 DAG size of output: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 02:51:08,703 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_1351 Int) (v_ArrVal_1352 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1351)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1352) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2) 2147483647)) (forall ((v_ArrVal_1351 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1348 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_1348) .cse1 v_ArrVal_1351)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1352) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2) 2147483647)))) is different from false [2023-08-27 02:51:12,712 INFO L124 PetriNetUnfolderBase]: 8115/15807 cut-off events. [2023-08-27 02:51:12,712 INFO L125 PetriNetUnfolderBase]: For 948561/951005 co-relation queries the response was YES. [2023-08-27 02:51:12,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145380 conditions, 15807 events. 8115/15807 cut-off events. For 948561/951005 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 133523 event pairs, 2797 based on Foata normal form. 118/14653 useless extension candidates. Maximal degree in co-relation 145288. Up to 5915 conditions per place. [2023-08-27 02:51:12,852 INFO L140 encePairwiseOnDemand]: 464/485 looper letters, 403 selfloop transitions, 260 changer transitions 3/672 dead transitions. [2023-08-27 02:51:12,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 672 transitions, 12783 flow [2023-08-27 02:51:12,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-27 02:51:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-27 02:51:12,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4204 transitions. [2023-08-27 02:51:12,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39400187441424556 [2023-08-27 02:51:12,856 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4204 transitions. [2023-08-27 02:51:12,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4204 transitions. [2023-08-27 02:51:12,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:51:12,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4204 transitions. [2023-08-27 02:51:12,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 191.0909090909091) internal successors, (4204), 22 states have internal predecessors, (4204), 0 states have call successors, (0), 0 states 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 02:51:12,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 485.0) internal successors, (11155), 23 states have internal predecessors, (11155), 0 states have call successors, (0), 0 states 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 02:51:12,868 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 485.0) internal successors, (11155), 23 states have internal predecessors, (11155), 0 states have call successors, (0), 0 states 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 02:51:12,869 INFO L175 Difference]: Start difference. First operand has 295 places, 534 transitions, 7108 flow. Second operand 22 states and 4204 transitions. [2023-08-27 02:51:12,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 672 transitions, 12783 flow [2023-08-27 02:51:13,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 672 transitions, 12256 flow, removed 255 selfloop flow, removed 7 redundant places. [2023-08-27 02:51:13,276 INFO L231 Difference]: Finished difference. Result has 310 places, 564 transitions, 8963 flow [2023-08-27 02:51:13,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=6689, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=8963, PETRI_PLACES=310, PETRI_TRANSITIONS=564} [2023-08-27 02:51:13,277 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 251 predicate places. [2023-08-27 02:51:13,277 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 564 transitions, 8963 flow [2023-08-27 02:51:13,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 182.78125) internal successors, (5849), 32 states have internal predecessors, (5849), 0 states have call successors, (0), 0 states 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 02:51:13,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:51:13,278 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:51:13,286 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 02:51:13,483 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,SelfDestructingSolverStorable20 [2023-08-27 02:51:13,483 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:51:13,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:51:13,484 INFO L85 PathProgramCache]: Analyzing trace with hash -741830261, now seen corresponding path program 1 times [2023-08-27 02:51:13,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:51:13,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937323892] [2023-08-27 02:51:13,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:51:13,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:51:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:51:13,522 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 02:51:13,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:51:13,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937323892] [2023-08-27 02:51:13,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937323892] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:51:13,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:51:13,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 02:51:13,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764044275] [2023-08-27 02:51:13,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:51:13,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 02:51:13,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:51:13,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 02:51:13,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 02:51:13,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 02:51:13,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 564 transitions, 8963 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 02:51:13,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:51:13,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 02:51:13,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:51:17,326 INFO L124 PetriNetUnfolderBase]: 7914/15496 cut-off events. [2023-08-27 02:51:17,326 INFO L125 PetriNetUnfolderBase]: For 929127/931473 co-relation queries the response was YES. [2023-08-27 02:51:17,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143680 conditions, 15496 events. 7914/15496 cut-off events. For 929127/931473 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 131211 event pairs, 4450 based on Foata normal form. 66/14385 useless extension candidates. Maximal degree in co-relation 143585. Up to 14428 conditions per place. [2023-08-27 02:51:17,467 INFO L140 encePairwiseOnDemand]: 483/485 looper letters, 519 selfloop transitions, 1 changer transitions 3/557 dead transitions. [2023-08-27 02:51:17,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 557 transitions, 9976 flow [2023-08-27 02:51:17,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 02:51:17,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 02:51:17,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2023-08-27 02:51:17,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079037800687285 [2023-08-27 02:51:17,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 739 transitions. [2023-08-27 02:51:17,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 739 transitions. [2023-08-27 02:51:17,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:51:17,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 739 transitions. [2023-08-27 02:51:17,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 states 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 02:51:17,471 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 02:51:17,471 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 02:51:17,471 INFO L175 Difference]: Start difference. First operand has 310 places, 564 transitions, 8963 flow. Second operand 3 states and 739 transitions. [2023-08-27 02:51:17,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 557 transitions, 9976 flow [2023-08-27 02:51:18,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 557 transitions, 9307 flow, removed 270 selfloop flow, removed 10 redundant places. [2023-08-27 02:51:18,039 INFO L231 Difference]: Finished difference. Result has 301 places, 549 transitions, 8063 flow [2023-08-27 02:51:18,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=8061, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=8063, PETRI_PLACES=301, PETRI_TRANSITIONS=549} [2023-08-27 02:51:18,040 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 242 predicate places. [2023-08-27 02:51:18,040 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 549 transitions, 8063 flow [2023-08-27 02:51:18,040 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 02:51:18,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:51:18,040 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:51:18,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-27 02:51:18,041 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 02:51:18,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:51:18,041 INFO L85 PathProgramCache]: Analyzing trace with hash -113573207, now seen corresponding path program 1 times [2023-08-27 02:51:18,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:51:18,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673126007] [2023-08-27 02:51:18,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:51:18,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:51:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:51:18,077 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 02:51:18,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:51:18,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673126007] [2023-08-27 02:51:18,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673126007] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:51:18,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:51:18,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 02:51:18,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261279992] [2023-08-27 02:51:18,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:51:18,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 02:51:18,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:51:18,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 02:51:18,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 02:51:18,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 02:51:18,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 549 transitions, 8063 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 02:51:18,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:51:18,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 02:51:18,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:51:21,661 INFO L124 PetriNetUnfolderBase]: 7728/15232 cut-off events. [2023-08-27 02:51:21,661 INFO L125 PetriNetUnfolderBase]: For 866875/870618 co-relation queries the response was YES. [2023-08-27 02:51:21,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135106 conditions, 15232 events. 7728/15232 cut-off events. For 866875/870618 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 129542 event pairs, 4637 based on Foata normal form. 179/14194 useless extension candidates. Maximal degree in co-relation 135010. Up to 10109 conditions per place. [2023-08-27 02:51:21,811 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 463 selfloop transitions, 45 changer transitions 0/542 dead transitions. [2023-08-27 02:51:21,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 542 transitions, 9096 flow [2023-08-27 02:51:21,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 02:51:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 02:51:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2023-08-27 02:51:21,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058419243986254 [2023-08-27 02:51:21,812 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 736 transitions. [2023-08-27 02:51:21,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 736 transitions. [2023-08-27 02:51:21,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:51:21,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 736 transitions. [2023-08-27 02:51:21,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states 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 02:51:21,814 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 02:51:21,814 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 02:51:21,814 INFO L175 Difference]: Start difference. First operand has 301 places, 549 transitions, 8063 flow. Second operand 3 states and 736 transitions. [2023-08-27 02:51:21,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 542 transitions, 9096 flow [2023-08-27 02:51:22,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 542 transitions, 9085 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-27 02:51:22,235 INFO L231 Difference]: Finished difference. Result has 301 places, 533 transitions, 7913 flow [2023-08-27 02:51:22,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=7823, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7913, PETRI_PLACES=301, PETRI_TRANSITIONS=533} [2023-08-27 02:51:22,236 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 242 predicate places. [2023-08-27 02:51:22,236 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 533 transitions, 7913 flow [2023-08-27 02:51:22,236 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 02:51:22,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:51:22,236 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 02:51:22,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-27 02:51:22,236 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:51:22,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:51:22,237 INFO L85 PathProgramCache]: Analyzing trace with hash -286124216, now seen corresponding path program 1 times [2023-08-27 02:51:22,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:51:22,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458405760] [2023-08-27 02:51:22,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:51:22,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:51:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:51:22,279 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 02:51:22,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:51:22,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458405760] [2023-08-27 02:51:22,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458405760] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:51:22,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924634979] [2023-08-27 02:51:22,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:51:22,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:51:22,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:51:22,285 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 02:51:22,287 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 02:51:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:51:22,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-27 02:51:22,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:51:22,471 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 02:51:22,471 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:51:22,494 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 02:51:22,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924634979] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:51:22,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:51:22,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-27 02:51:22,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732494653] [2023-08-27 02:51:22,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:51:22,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 02:51:22,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:51:22,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 02:51:22,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-27 02:51:22,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 02:51:22,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 533 transitions, 7913 flow. Second operand has 7 states, 7 states have (on average 233.71428571428572) internal successors, (1636), 7 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states 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 02:51:22,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:51:22,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 02:51:22,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:51:25,006 INFO L124 PetriNetUnfolderBase]: 4972/9634 cut-off events. [2023-08-27 02:51:25,006 INFO L125 PetriNetUnfolderBase]: For 661842/664520 co-relation queries the response was YES. [2023-08-27 02:51:25,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104566 conditions, 9634 events. 4972/9634 cut-off events. For 661842/664520 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 67578 event pairs, 2118 based on Foata normal form. 213/9302 useless extension candidates. Maximal degree in co-relation 104470. Up to 3832 conditions per place. [2023-08-27 02:51:25,096 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 523 selfloop transitions, 26 changer transitions 0/583 dead transitions. [2023-08-27 02:51:25,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 583 transitions, 10240 flow [2023-08-27 02:51:25,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 02:51:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 02:51:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1462 transitions. [2023-08-27 02:51:25,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5024054982817869 [2023-08-27 02:51:25,099 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1462 transitions. [2023-08-27 02:51:25,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1462 transitions. [2023-08-27 02:51:25,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:51:25,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1462 transitions. [2023-08-27 02:51:25,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 243.66666666666666) internal successors, (1462), 6 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states 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 02:51:25,102 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 02:51:25,103 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 02:51:25,103 INFO L175 Difference]: Start difference. First operand has 301 places, 533 transitions, 7913 flow. Second operand 6 states and 1462 transitions. [2023-08-27 02:51:25,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 583 transitions, 10240 flow [2023-08-27 02:51:25,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 583 transitions, 10162 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-08-27 02:51:25,478 INFO L231 Difference]: Finished difference. Result has 309 places, 522 transitions, 7752 flow [2023-08-27 02:51:25,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=7524, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7752, PETRI_PLACES=309, PETRI_TRANSITIONS=522} [2023-08-27 02:51:25,479 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 250 predicate places. [2023-08-27 02:51:25,479 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 522 transitions, 7752 flow [2023-08-27 02:51:25,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 233.71428571428572) internal successors, (1636), 7 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states 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 02:51:25,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:51:25,479 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 02:51:25,485 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 02:51:25,679 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,SelfDestructingSolverStorable23 [2023-08-27 02:51:25,680 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:51:25,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:51:25,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1519556060, now seen corresponding path program 5 times [2023-08-27 02:51:25,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:51:25,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25486683] [2023-08-27 02:51:25,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:51:25,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:51:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:51:26,987 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 02:51:26,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:51:26,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25486683] [2023-08-27 02:51:26,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25486683] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:51:26,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869613817] [2023-08-27 02:51:26,987 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-27 02:51:26,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:51:26,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:51:26,988 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 02:51:26,990 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 02:51:27,160 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-27 02:51:27,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 02:51:27,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 109 conjunts are in the unsatisfiable core [2023-08-27 02:51:27,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:51:27,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:51:27,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:51:27,192 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:51:27,192 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 02:51:27,208 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:51:27,209 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 02:51:27,334 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 02:51:27,436 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 02:51:27,581 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 02:51:27,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:51:27,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 31 treesize of output 33 [2023-08-27 02:51:27,739 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 02:51:27,858 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 48 treesize of output 41 [2023-08-27 02:51:28,022 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2023-08-27 02:51:28,080 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 40 treesize of output 42 [2023-08-27 02:51:28,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:51:28,137 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 40 treesize of output 42 [2023-08-27 02:51:28,254 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 54 treesize of output 47 [2023-08-27 02:51:28,341 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 02:51:28,341 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:51:28,494 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1646 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)))) is different from false [2023-08-27 02:51:28,621 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1646 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1641))))) is different from false [2023-08-27 02:51:28,776 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1646 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1639) .cse3 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1639) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1641))))) is different from false [2023-08-27 02:51:28,799 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (v_ArrVal_1638 Int) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1646 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_1638)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1639) .cse3 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1639) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1641))))) is different from false [2023-08-27 02:51:36,927 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1638 Int) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1646 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1636))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1638))) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1639) .cse1 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1639) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1641) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse3) 2147483647)))))) is different from false [2023-08-27 02:51:38,954 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1638 Int) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1646 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1636))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1638))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1639) .cse3 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1639) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1641)))))) is different from false [2023-08-27 02:51:38,979 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1638 Int) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1646 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1636))) (let ((.cse0 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse3)) |c_~#queue~0.offset|) v_ArrVal_1638))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1639) .cse3 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1639) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1641) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse1) 2147483647)))))) is different from false [2023-08-27 02:51:39,002 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse7 .cse8))) (or (= 400 .cse0) (forall ((v_ArrVal_1639 Int) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1638 Int) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1646 Int)) (let ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1636))) (let ((.cse1 (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse4)) |c_~#queue~0.offset|) v_ArrVal_1638))) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1639) .cse4 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_1639) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse1 .cse4) 1) v_ArrVal_1641) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse2) 2147483647))))))))) is different from false [2023-08-27 02:51:39,034 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_1639 Int) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1638 Int) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1633 Int) (v_ArrVal_1646 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1633) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1636))) (let ((.cse3 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_1638))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_1639) .cse2 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse1) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1633) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1641) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1639)))))) (= 400 .cse8)))) is different from false [2023-08-27 02:51:39,073 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse5 .cse9))) (or (= 400 .cse0) (forall ((v_ArrVal_1639 Int) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1638 Int) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1633 Int) (v_ArrVal_1646 Int)) (let ((.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1633) .cse9 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1636))) (let ((.cse4 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)) v_ArrVal_1638))) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_1639) .cse3 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse2) 2147483647) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1641) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1639) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1633)))))))))) is different from false [2023-08-27 02:51:39,112 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1638 Int) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1630 Int) (v_ArrVal_1641 Int) (v_ArrVal_1633 Int) (v_ArrVal_1646 Int)) (let ((.cse2 (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_1630)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (select .cse2 .cse9))) (let ((.cse6 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1633) .cse9 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1636))) (let ((.cse4 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_1638))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1639) .cse6 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1633) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1639) (= 400 .cse5) (< (select .cse0 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse4 .cse6) 1) v_ArrVal_1641)))))))) is different from false [2023-08-27 02:51:41,665 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-08-27 02:51:41,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869613817] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:51:41,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:51:41,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 55 [2023-08-27 02:51:41,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968640127] [2023-08-27 02:51:41,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:51:41,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-08-27 02:51:41,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:51:41,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-08-27 02:51:41,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=1592, Unknown=24, NotChecked=1078, Total=3192 [2023-08-27 02:51:41,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 485 [2023-08-27 02:51:41,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 522 transitions, 7752 flow. Second operand has 57 states, 57 states have (on average 170.26315789473685) internal successors, (9705), 57 states have internal predecessors, (9705), 0 states have call successors, (0), 0 states 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 02:51:41,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:51:41,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 485 [2023-08-27 02:51:41,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:52:04,622 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 02:52:04,633 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (select .cse4 .cse5))) (let ((.cse3 (+ .cse8 1)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1639 Int) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1646 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1639) .cse5 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1639) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse2) 2147483647) (< .cse3 v_ArrVal_1641)))) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1646 Int)) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (select (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse2) 2147483647) (< .cse3 v_ArrVal_1641)))) (forall ((v_ArrVal_1644 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1646 Int)) (let ((.cse7 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse2) 2147483647) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)))) (or (= 400 .cse8) (forall ((v_ArrVal_1639 Int) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1638 Int) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1646 Int)) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1636))) (let ((.cse9 (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1638)))) (let ((.cse10 (select (store (store (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse2 v_ArrVal_1639) .cse1 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (+ (select .cse9 .cse2) 1) v_ArrVal_1639) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse9 .cse1) 1) v_ArrVal_1641) (< (select (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse2) 2147483647))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1646 Int)) (let ((.cse13 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store .cse13 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse2) 2147483647) (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)))))))) is different from false [2023-08-27 02:52:17,334 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (+ (select .cse4 .cse5) 1))) (and (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1646 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse2) 2147483647) (< .cse3 v_ArrVal_1641)))) (forall ((v_ArrVal_1639 Int) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1638 Int) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1646 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1636))) (let ((.cse6 (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1638)))) (let ((.cse7 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_1639) .cse1 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (+ (select .cse6 .cse2) 1) v_ArrVal_1639) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1641) (< (select (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse2) 2147483647))))))))) is different from false [2023-08-27 02:52:19,350 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 02:52:21,359 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 02:52:21,374 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ (select .cse4 .cse5) 1))) (and (forall ((v_ArrVal_1639 Int) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1646 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1639) .cse5 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1639) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse2) 2147483647) (< .cse3 v_ArrVal_1641)))) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1646 Int)) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (select (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse2) 2147483647) (< .cse3 v_ArrVal_1641))))))) is different from false [2023-08-27 02:52:23,382 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 02:52:25,390 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 02:52:27,504 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 02:52:29,521 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ (select .cse4 .cse5) 1)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1639 Int) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1646 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1639) .cse5 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1639) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse2) 2147483647) (< .cse3 v_ArrVal_1641)))) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1646 Int)) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (select (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse2) 2147483647) (< .cse3 v_ArrVal_1641)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1646 Int)) (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse2) 2147483647) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|))))))) is different from false [2023-08-27 02:52:29,606 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)) (.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_1639 Int) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1638 Int) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1646 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_1636))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1638)))) (let ((.cse0 (select (store (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1639) .cse3 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1639) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1641)))))) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1646 Int)) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select .cse9 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (select (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse1) 2147483647) (< .cse8 v_ArrVal_1641)))))) is different from false [2023-08-27 02:52:29,738 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1646 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)))) (forall ((v_ArrVal_1639 Int) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1638 Int) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1641 Int) (v_ArrVal_1646 Int)) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1636))) (let ((.cse4 (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1638)))) (let ((.cse3 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1639) .cse2 v_ArrVal_1641)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1643) |c_~#stored_elements~0.base| v_ArrVal_1644) |c_~#queue~0.base|))) (or (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1639) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1641) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1646) .cse1) 2147483647)))))))) is different from false [2023-08-27 02:52:31,875 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 02:52:34,434 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 02:52:37,070 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 02:52:39,083 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 02:52:41,090 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 02:52:43,096 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 02:52:45,103 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 02:52:49,277 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 02:52:51,285 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 02:52:53,288 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 02:52:55,357 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 02:52:57,615 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 02:52:59,618 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 02:53:03,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 [1] [2023-08-27 02:53:05,166 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 02:53:07,174 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 02:53:09,181 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 02:53:11,186 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 02:53:13,231 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 02:53:16,890 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 02:53:18,894 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 02:53:20,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 02:53:22,463 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 02:53:24,593 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 02:53:26,597 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 02:53:28,675 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 02:53:30,952 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 02:53:34,373 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 02:53:37,250 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 02:53:41,974 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 02:53:45,298 INFO L124 PetriNetUnfolderBase]: 5786/11154 cut-off events. [2023-08-27 02:53:45,298 INFO L125 PetriNetUnfolderBase]: For 780072/782503 co-relation queries the response was YES. [2023-08-27 02:53:45,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124941 conditions, 11154 events. 5786/11154 cut-off events. For 780072/782503 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 79505 event pairs, 2140 based on Foata normal form. 143/10745 useless extension candidates. Maximal degree in co-relation 124841. Up to 6082 conditions per place. [2023-08-27 02:53:45,413 INFO L140 encePairwiseOnDemand]: 466/485 looper letters, 388 selfloop transitions, 425 changer transitions 3/822 dead transitions. [2023-08-27 02:53:45,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 822 transitions, 19691 flow [2023-08-27 02:53:45,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-08-27 02:53:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2023-08-27 02:53:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 9147 transitions. [2023-08-27 02:53:45,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3626883425852498 [2023-08-27 02:53:45,422 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 9147 transitions. [2023-08-27 02:53:45,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 9147 transitions. [2023-08-27 02:53:45,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:53:45,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 9147 transitions. [2023-08-27 02:53:45,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 175.90384615384616) internal successors, (9147), 52 states have internal predecessors, (9147), 0 states have call successors, (0), 0 states 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 02:53:45,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 485.0) internal successors, (25705), 53 states have internal predecessors, (25705), 0 states have call successors, (0), 0 states 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 02:53:45,453 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 485.0) internal successors, (25705), 53 states have internal predecessors, (25705), 0 states have call successors, (0), 0 states 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 02:53:45,454 INFO L175 Difference]: Start difference. First operand has 309 places, 522 transitions, 7752 flow. Second operand 52 states and 9147 transitions. [2023-08-27 02:53:45,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 822 transitions, 19691 flow [2023-08-27 02:53:45,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 822 transitions, 19652 flow, removed 17 selfloop flow, removed 1 redundant places. [2023-08-27 02:53:45,943 INFO L231 Difference]: Finished difference. Result has 381 places, 662 transitions, 13005 flow [2023-08-27 02:53:45,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=7472, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=301, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=13005, PETRI_PLACES=381, PETRI_TRANSITIONS=662} [2023-08-27 02:53:45,944 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 322 predicate places. [2023-08-27 02:53:45,944 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 662 transitions, 13005 flow [2023-08-27 02:53:45,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 170.26315789473685) internal successors, (9705), 57 states have internal predecessors, (9705), 0 states have call successors, (0), 0 states 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 02:53:45,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:53:45,945 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 02:53:45,950 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 02:53:46,148 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,SelfDestructingSolverStorable24 [2023-08-27 02:53:46,149 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:53:46,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:53:46,149 INFO L85 PathProgramCache]: Analyzing trace with hash -312034728, now seen corresponding path program 3 times [2023-08-27 02:53:46,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:53:46,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785336181] [2023-08-27 02:53:46,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:53:46,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:53:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:53:47,371 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 02:53:47,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:53:47,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785336181] [2023-08-27 02:53:47,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785336181] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:53:47,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468777631] [2023-08-27 02:53:47,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 02:53:47,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:53:47,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:53:47,374 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 02:53:47,375 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 02:53:47,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-27 02:53:47,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 02:53:47,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 91 conjunts are in the unsatisfiable core [2023-08-27 02:53:47,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:53:47,690 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 02:53:47,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:53:47,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:53:47,706 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:53:47,706 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 02:53:47,727 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:53:47,728 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 02:53:47,827 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-27 02:53:47,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 1 case distinctions, treesize of input 28 treesize of output 23 [2023-08-27 02:53:47,931 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 02:53:47,992 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 25 treesize of output 13 [2023-08-27 02:53:48,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:53:48,023 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 02:53:48,077 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-27 02:53:48,078 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 25 treesize of output 23 [2023-08-27 02:53:48,127 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 02:53:48,194 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 25 treesize of output 13 [2023-08-27 02:53:48,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:53:48,221 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 02:53:48,268 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-27 02:53:48,268 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 25 treesize of output 23 [2023-08-27 02:53:48,298 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 02:53:48,323 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 02:53:48,335 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 02:53:48,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:53:48,863 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1764 Int) (v_ArrVal_1766 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_1764)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse4 .cse5))) (or (= 400 .cse0) (< (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (select (store (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1766) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1769))) (store .cse1 |c_~#queue~0.base| (let ((.cse2 (select .cse1 |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_1770)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_~#queue~0.base|) .cse3)) 2147483647))))) is different from false [2023-08-27 02:53:49,040 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1762 (Array Int Int)) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1764 Int) (v_ArrVal_1766 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1762))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse3) 4)) v_ArrVal_1764)))) (let ((.cse0 (select .cse5 .cse3))) (or (= 400 .cse0) (< (select (select (store (let ((.cse1 (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1766) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1769))) (store .cse1 |c_~#queue~0.base| (let ((.cse2 (select .cse1 |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1770)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_~#queue~0.base|) .cse3) 2147483647)))))) is different from false [2023-08-27 02:53:49,161 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse9 (select .cse7 .cse8))) (or (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1762 (Array Int Int)) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1764 Int) (v_ArrVal_1766 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_1762))) (let ((.cse4 (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse2) 4)) v_ArrVal_1764)))) (let ((.cse5 (select .cse4 .cse2))) (or (< (select (select (store (let ((.cse0 (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1766) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1769))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1770)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_~#queue~0.base|) .cse2) 2147483647) (= 400 .cse5)))))) (= 400 .cse9)))) is different from false [2023-08-27 02:53:49,176 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse8 .cse9))) (or (= 400 .cse0) (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1762 (Array Int Int)) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1764 Int) (v_ArrVal_1766 Int) (v_ArrVal_1758 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1758) .cse9 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1762))) (let ((.cse5 (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1764)))) (let ((.cse6 (select .cse5 .cse3))) (or (< (select (select (store (let ((.cse1 (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1766) .cse3 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1769))) (store .cse1 |c_~#queue~0.base| (let ((.cse2 (select .cse1 |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_1770)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_~#queue~0.base|) .cse3) 2147483647) (= 400 .cse6))))))))) is different from false [2023-08-27 02:53:49,204 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1762 (Array Int Int)) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1764 Int) (v_ArrVal_1766 Int) (v_ArrVal_1758 Int) (v_ArrVal_1757 Int)) (let ((.cse8 (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_1757)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (select .cse8 .cse9))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1758) .cse9 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1762))) (let ((.cse4 (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1764)))) (let ((.cse5 (select .cse4 .cse2))) (or (< (select (select (store (let ((.cse0 (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1766) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1769))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1770)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_~#queue~0.base|) .cse2) 2147483647) (= 400 .cse5) (= 400 .cse6)))))))) is different from false [2023-08-27 02:53:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 2 times theorem prover too weak. 0 trivial. 10 not checked. [2023-08-27 02:53:49,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468777631] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:53:49,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:53:49,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 18] total 43 [2023-08-27 02:53:49,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118599565] [2023-08-27 02:53:49,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:53:49,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-08-27 02:53:49,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:53:49,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-08-27 02:53:49,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=1109, Unknown=59, NotChecked=400, Total=1980 [2023-08-27 02:53:49,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 485 [2023-08-27 02:53:49,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 662 transitions, 13005 flow. Second operand has 45 states, 45 states have (on average 182.8) internal successors, (8226), 45 states have internal predecessors, (8226), 0 states have call successors, (0), 0 states 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 02:53:49,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:53:49,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 485 [2023-08-27 02:53:49,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:53:52,025 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse11 (select .cse4 .cse5))) (let ((.cse0 (= 400 .cse11)) (.cse6 (+ .cse11 1)) (.cse16 (+ 1608 |c_~#queue~0.offset|)) (.cse10 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|))) (and (or .cse0 (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1766 Int)) (< (select (select (store (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1766) .cse5 .cse6)) |c_~#stored_elements~0.base| v_ArrVal_1769))) (store .cse1 |c_~#queue~0.base| (let ((.cse2 (select .cse1 |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_1770)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_~#queue~0.base|) .cse3) 2147483647))) (or .cse0 (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1772 (Array Int Int))) (< (select (select (store (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 .cse6)) |c_~#stored_elements~0.base| v_ArrVal_1769))) (store .cse7 |c_~#queue~0.base| (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1770)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_~#queue~0.base|) .cse3) 2147483647))) (forall ((v_ArrVal_1770 Int) (v_ArrVal_1772 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse9 .cse10 v_ArrVal_1770)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_~#queue~0.base|) .cse3) 2147483647)) (< .cse11 2147483647) (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1762 (Array Int Int)) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1764 Int) (v_ArrVal_1766 Int)) (let ((.cse14 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1762))) (let ((.cse15 (let ((.cse18 (select .cse14 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse3) 4)) v_ArrVal_1764)))) (let ((.cse17 (select .cse15 .cse3))) (or (< (select (select (store (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse16 v_ArrVal_1766) .cse3 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_1769))) (store .cse12 |c_~#queue~0.base| (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1770)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_~#queue~0.base|) .cse3) 2147483647) (= 400 .cse17)))))) (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1764 Int) (v_ArrVal_1766 Int)) (let ((.cse22 (store .cse9 .cse10 v_ArrVal_1764))) (let ((.cse19 (select .cse22 .cse3))) (or (= 400 .cse19) (< (select (select (store (let ((.cse20 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse22 .cse16 v_ArrVal_1766) .cse3 (+ .cse19 1))) |c_~#stored_elements~0.base| v_ArrVal_1769))) (store .cse20 |c_~#queue~0.base| (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* 4 (select .cse21 .cse3))) v_ArrVal_1770)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_~#queue~0.base|) .cse3) 2147483647))))) (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1772 (Array Int Int))) (< (select (select (store (let ((.cse23 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1769))) (store .cse23 |c_~#queue~0.base| (let ((.cse24 (select .cse23 |c_~#queue~0.base|))) (store .cse24 (+ (* (select .cse24 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1770)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_~#queue~0.base|) .cse3) 2147483647)) (forall ((v_ArrVal_1772 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse5) 2147483647)))))) is different from false [2023-08-27 02:53:52,689 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse12 (select .cse4 .cse6))) (let ((.cse0 (= 400 .cse12)) (.cse7 (+ .cse12 1)) (.cse11 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse21 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (or .cse0 (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1766 Int)) (< (select (select (store (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_1766) .cse6 .cse7)) |c_~#stored_elements~0.base| v_ArrVal_1769))) (store .cse1 |c_~#queue~0.base| (let ((.cse2 (select .cse1 |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_1770)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_~#queue~0.base|) .cse3) 2147483647))) (or .cse0 (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1772 (Array Int Int))) (< (select (select (store (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse6 .cse7)) |c_~#stored_elements~0.base| v_ArrVal_1769))) (store .cse8 |c_~#queue~0.base| (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1770)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_~#queue~0.base|) .cse3) 2147483647))) (forall ((v_ArrVal_1770 Int) (v_ArrVal_1772 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse10 .cse11 v_ArrVal_1770)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_~#queue~0.base|) .cse3) 2147483647)) (< .cse12 2147483647) (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1764 Int) (v_ArrVal_1766 Int)) (let ((.cse16 (store .cse10 .cse11 v_ArrVal_1764))) (let ((.cse13 (select .cse16 .cse3))) (or (= 400 .cse13) (< (select (select (store (let ((.cse14 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse16 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1766) .cse3 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_1769))) (store .cse14 |c_~#queue~0.base| (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* 4 (select .cse15 .cse3))) v_ArrVal_1770)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_~#queue~0.base|) .cse3) 2147483647))))) (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1764 Int) (v_ArrVal_1766 Int)) (let ((.cse20 (store .cse4 .cse21 v_ArrVal_1764))) (let ((.cse17 (select .cse20 .cse6))) (or (= 400 .cse17) (< (select (select (store (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse20 .cse5 v_ArrVal_1766) .cse6 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_1769))) (store .cse18 |c_~#queue~0.base| (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse3) 4)) v_ArrVal_1770)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_~#queue~0.base|) .cse3) 2147483647))))) (forall ((v_ArrVal_1770 Int) (v_ArrVal_1772 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse21 v_ArrVal_1770)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse6) 2147483647)))))) is different from false [2023-08-27 02:53:54,922 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (and (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse0 (select .cse4 .cse5))) (or (= 400 .cse0) (forall ((v_ArrVal_1769 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1766 Int)) (< (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (select (store (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1766) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1769))) (store .cse1 |c_~#queue~0.base| (let ((.cse2 (select .cse1 |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_1770)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_~#queue~0.base|) .cse3)) 2147483647))))) (forall ((v_ArrVal_1772 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1772) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse5) 2147483647)))) is different from false [2023-08-27 02:54:03,783 INFO L124 PetriNetUnfolderBase]: 6827/13398 cut-off events. [2023-08-27 02:54:03,783 INFO L125 PetriNetUnfolderBase]: For 2294088/2298425 co-relation queries the response was YES. [2023-08-27 02:54:03,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211099 conditions, 13398 events. 6827/13398 cut-off events. For 2294088/2298425 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 100660 event pairs, 2187 based on Foata normal form. 350/13090 useless extension candidates. Maximal degree in co-relation 210976. Up to 5497 conditions per place. [2023-08-27 02:54:04,137 INFO L140 encePairwiseOnDemand]: 466/485 looper letters, 577 selfloop transitions, 352 changer transitions 3/938 dead transitions. [2023-08-27 02:54:04,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 938 transitions, 27752 flow [2023-08-27 02:54:04,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-27 02:54:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-27 02:54:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 7366 transitions. [2023-08-27 02:54:04,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3894263811789585 [2023-08-27 02:54:04,145 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 7366 transitions. [2023-08-27 02:54:04,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 7366 transitions. [2023-08-27 02:54:04,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:54:04,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 7366 transitions. [2023-08-27 02:54:04,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 188.87179487179486) internal successors, (7366), 39 states have internal predecessors, (7366), 0 states have call successors, (0), 0 states 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 02:54:04,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 485.0) internal successors, (19400), 40 states have internal predecessors, (19400), 0 states have call successors, (0), 0 states 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 02:54:04,167 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 485.0) internal successors, (19400), 40 states have internal predecessors, (19400), 0 states have call successors, (0), 0 states 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 02:54:04,167 INFO L175 Difference]: Start difference. First operand has 381 places, 662 transitions, 13005 flow. Second operand 39 states and 7366 transitions. [2023-08-27 02:54:04,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 938 transitions, 27752 flow [2023-08-27 02:54:05,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 938 transitions, 23405 flow, removed 1857 selfloop flow, removed 25 redundant places. [2023-08-27 02:54:05,298 INFO L231 Difference]: Finished difference. Result has 412 places, 764 transitions, 14071 flow [2023-08-27 02:54:05,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=8974, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=232, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=14071, PETRI_PLACES=412, PETRI_TRANSITIONS=764} [2023-08-27 02:54:05,299 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 353 predicate places. [2023-08-27 02:54:05,299 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 764 transitions, 14071 flow [2023-08-27 02:54:05,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 182.8) internal successors, (8226), 45 states have internal predecessors, (8226), 0 states have call successors, (0), 0 states 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 02:54:05,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:54:05,300 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2023-08-27 02:54:05,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-27 02:54:05,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:54:05,501 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 02:54:05,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:54:05,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1598047451, now seen corresponding path program 6 times [2023-08-27 02:54:05,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:54:05,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871143865] [2023-08-27 02:54:05,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:54:05,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:54:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:54:07,460 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 02:54:07,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:54:07,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871143865] [2023-08-27 02:54:07,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871143865] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:54:07,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613067836] [2023-08-27 02:54:07,461 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-27 02:54:07,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:54:07,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:54:07,462 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 02:54:07,463 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 02:54:07,839 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-08-27 02:54:07,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 02:54:07,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 114 conjunts are in the unsatisfiable core [2023-08-27 02:54:07,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:54:07,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:54:07,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:54:07,870 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:54:07,870 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 02:54:07,899 INFO L322 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-08-27 02:54:07,900 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 29 treesize of output 34 [2023-08-27 02:54:08,006 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 02:54:08,103 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 02:54:08,249 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 02:54:08,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:54:08,327 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 02:54:08,435 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 02:54:08,637 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 02:54:08,910 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 02:54:15,085 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 02:54:16,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:54:16,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 44 treesize of output 46 [2023-08-27 02:54:16,516 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 02:54:20,464 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 02:54:35,272 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 02:54:49,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:54:49,617 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 02:55:11,372 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 02:55:32,035 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 02:55:32,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:55:32,163 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1920 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int) (v_ArrVal_1922 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1920) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) v_ArrVal_1922) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 02:55:32,179 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1920 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int) (v_ArrVal_1919 Int) (v_ArrVal_1922 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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1919)) |c_~#stored_elements~0.base| v_ArrVal_1920) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1919) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) v_ArrVal_1922) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 02:55:32,194 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1920 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int) (v_ArrVal_1919 Int) (v_ArrVal_1922 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1919)) |c_~#stored_elements~0.base| v_ArrVal_1920) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1919) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) v_ArrVal_1922) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-27 02:55:32,227 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1920 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int) (v_ArrVal_1917 Int) (v_ArrVal_1919 Int) (v_ArrVal_1922 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1917) .cse1 v_ArrVal_1919)) |c_~#stored_elements~0.base| v_ArrVal_1920) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1919) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1917) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) v_ArrVal_1922) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-27 02:55:39,295 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1915 Int) (v_ArrVal_1920 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int) (v_ArrVal_1917 Int) (v_ArrVal_1919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| Int) (v_ArrVal_1913 (Array Int Int)) (v_ArrVal_1922 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1912) |c_~#stored_elements~0.base| v_ArrVal_1913))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| 4) |c_~#queue~0.offset|) v_ArrVal_1915)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_1917) .cse2 v_ArrVal_1919)) |c_~#stored_elements~0.base| v_ArrVal_1920) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) v_ArrVal_1922) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1917) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116|) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1919))))))) is different from false [2023-08-27 02:55:39,332 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1915 Int) (v_ArrVal_1920 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int) (v_ArrVal_1917 Int) (v_ArrVal_1919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| Int) (v_ArrVal_1910 Int) (v_ArrVal_1913 (Array Int Int)) (v_ArrVal_1922 Int)) (let ((.cse5 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1910)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1912) |c_~#stored_elements~0.base| v_ArrVal_1913))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| 4) |c_~#queue~0.offset|) v_ArrVal_1915)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1917) .cse1 v_ArrVal_1919)) |c_~#stored_elements~0.base| v_ArrVal_1920) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1919) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1910) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116|) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1917) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) v_ArrVal_1922) .cse4) 2147483647))))))) is different from false [2023-08-27 02:55:39,368 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1915 Int) (v_ArrVal_1920 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int) (v_ArrVal_1917 Int) (v_ArrVal_1919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| Int) (v_ArrVal_1910 Int) (v_ArrVal_1913 (Array Int Int)) (v_ArrVal_1922 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse7 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1910)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1912) |c_~#stored_elements~0.base| v_ArrVal_1913))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| 4) |c_~#queue~0.offset|) v_ArrVal_1915)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1917) .cse1 v_ArrVal_1919)) |c_~#stored_elements~0.base| v_ArrVal_1920) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1919) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116|) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1917) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) v_ArrVal_1922) .cse4) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1910)))))))) is different from false [2023-08-27 02:55:39,943 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1915 Int) (v_ArrVal_1920 (Array Int Int)) (v_ArrVal_1907 Int) (v_ArrVal_1917 Int) (v_ArrVal_1909 Int) (v_ArrVal_1919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| Int) (v_ArrVal_1910 Int) (v_ArrVal_1913 (Array Int Int)) (v_ArrVal_1922 Int)) (let ((.cse2 (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_1907)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1909) .cse7 v_ArrVal_1910)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1912) |c_~#stored_elements~0.base| v_ArrVal_1913))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| 4) |c_~#queue~0.offset|) v_ArrVal_1915)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_1917) .cse1 v_ArrVal_1919)) |c_~#stored_elements~0.base| v_ArrVal_1920) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1909) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) v_ArrVal_1922) .cse5) 2147483647) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1919) (< (+ (select .cse2 .cse7) 1) v_ArrVal_1910) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1917)))))))) is different from false [2023-08-27 02:55:51,435 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1915 Int) (v_ArrVal_1920 (Array Int Int)) (v_ArrVal_1907 Int) (v_ArrVal_1917 Int) (v_ArrVal_1909 Int) (v_ArrVal_1919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1913 (Array Int Int)) (v_ArrVal_1922 Int)) (let ((.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1905))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1907)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1909) .cse1 v_ArrVal_1910)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1912) |c_~#stored_elements~0.base| v_ArrVal_1913))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| 4) |c_~#queue~0.offset|) v_ArrVal_1915))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_1917) .cse1 v_ArrVal_1919)) |c_~#stored_elements~0.base| v_ArrVal_1920) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1909) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) v_ArrVal_1922) .cse3) 2147483647) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1919) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116|) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1917) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1910)))))))))) is different from false [2023-08-27 02:55:51,507 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1904 Int) (v_ArrVal_1915 Int) (v_ArrVal_1920 (Array Int Int)) (v_ArrVal_1907 Int) (v_ArrVal_1917 Int) (v_ArrVal_1909 Int) (v_ArrVal_1919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1913 (Array Int Int)) (v_ArrVal_1922 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1904)) |c_~#stored_elements~0.base| v_ArrVal_1905))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1907)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1909) .cse3 v_ArrVal_1910)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1912) |c_~#stored_elements~0.base| v_ArrVal_1913))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| 4) |c_~#queue~0.offset|) v_ArrVal_1915))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1917) .cse3 v_ArrVal_1919)) |c_~#stored_elements~0.base| v_ArrVal_1920) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) v_ArrVal_1922) .cse1) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116|) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1910) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (< (+ (select .cse6 .cse3) 1) v_ArrVal_1919) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1909) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1904) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1917)))))))))) is different from false [2023-08-27 02:55:53,906 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1904 Int) (v_ArrVal_1915 Int) (v_ArrVal_1920 (Array Int Int)) (v_ArrVal_1907 Int) (v_ArrVal_1917 Int) (v_ArrVal_1909 Int) (v_ArrVal_1919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1901 Int) (v_ArrVal_1913 (Array Int Int)) (v_ArrVal_1922 Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1901) .cse8 v_ArrVal_1904)) |c_~#stored_elements~0.base| v_ArrVal_1905))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1907)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse9 (store (store (store .cse10 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1909) .cse1 v_ArrVal_1910)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1912) |c_~#stored_elements~0.base| v_ArrVal_1913))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| 4) |c_~#queue~0.offset|) v_ArrVal_1915))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1917) .cse1 v_ArrVal_1919)) |c_~#stored_elements~0.base| v_ArrVal_1920) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1919) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1901) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) v_ArrVal_1922) .cse3) 2147483647) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1910) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1909) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1917) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|) (< (+ (select .cse7 .cse8) 1) v_ArrVal_1904))))))))))) is different from false [2023-08-27 02:55:53,974 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1904 Int) (v_ArrVal_1915 Int) (v_ArrVal_1920 (Array Int Int)) (v_ArrVal_1907 Int) (v_ArrVal_1917 Int) (v_ArrVal_1909 Int) (v_ArrVal_1919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1901 Int) (v_ArrVal_1913 (Array Int Int)) (v_ArrVal_1922 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_1901) .cse9 v_ArrVal_1904)) |c_~#stored_elements~0.base| v_ArrVal_1905))) (let ((.cse7 (select .cse11 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1907)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store (store .cse11 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_1909) .cse1 v_ArrVal_1910)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1912) |c_~#stored_elements~0.base| v_ArrVal_1913))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| 4) |c_~#queue~0.offset|) v_ArrVal_1915))) (let ((.cse2 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1917) .cse1 v_ArrVal_1919)) |c_~#stored_elements~0.base| v_ArrVal_1920) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1919) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) v_ArrVal_1922) .cse3) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1901) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1910) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (< (+ (select .cse6 .cse3) 1) v_ArrVal_1909) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1917) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|) (< (+ (select .cse4 .cse9) 1) v_ArrVal_1904))))))))))) is different from false [2023-08-27 02:55:54,046 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1904 Int) (v_ArrVal_1915 Int) (v_ArrVal_1920 (Array Int Int)) (v_ArrVal_1907 Int) (v_ArrVal_1917 Int) (v_ArrVal_1909 Int) (v_ArrVal_1919 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| Int) (v_ArrVal_1899 Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1901 Int) (v_ArrVal_1913 (Array Int Int)) (v_ArrVal_1922 Int)) (let ((.cse2 (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_1899)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse4 v_ArrVal_1901) .cse3 v_ArrVal_1904)) |c_~#stored_elements~0.base| v_ArrVal_1905))) (let ((.cse9 (select .cse11 |c_~#queue~0.base|))) (let ((.cse7 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1907)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store (store .cse11 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_1909) .cse1 v_ArrVal_1910)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1912) |c_~#stored_elements~0.base| v_ArrVal_1913))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116| 4) |c_~#queue~0.offset|) v_ArrVal_1915))) (let ((.cse0 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1917) .cse1 v_ArrVal_1919)) |c_~#stored_elements~0.base| v_ArrVal_1920) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1904) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1901) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1919) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1917) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1910) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_116|) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_118|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_~#queue~0.offset|) v_ArrVal_1922) .cse6) 2147483647) (< (+ (select .cse7 .cse6) 1) v_ArrVal_1909))))))))))) is different from false [2023-08-27 02:56:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 23 not checked. [2023-08-27 02:56:12,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613067836] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:56:12,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:56:12,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 25] total 71 [2023-08-27 02:56:12,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434495426] [2023-08-27 02:56:12,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:56:12,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-08-27 02:56:12,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:56:12,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-08-27 02:56:12,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=809, Invalid=2676, Unknown=107, NotChecked=1664, Total=5256 [2023-08-27 02:56:12,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 02:56:12,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 764 transitions, 14071 flow. Second operand has 73 states, 73 states have (on average 176.31506849315068) internal successors, (12871), 73 states have internal predecessors, (12871), 0 states have call successors, (0), 0 states 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 02:56:12,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:56:12,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 02:56:12,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:56:33,074 WARN L234 SmtUtils]: Spent 15.27s on a formula simplification. DAG size of input: 194 DAG size of output: 107 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 02:56:35,226 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 02:56:37,250 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 02:56:45,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Received shutdown request... [2023-08-27 02:56:47,708 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 02:56:47,708 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 02:56:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-27 02:56:48,081 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 29 remaining) [2023-08-27 02:56:48,086 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 02:56:48,282 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,SelfDestructingSolverStorable26 [2023-08-27 02:56:48,282 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. [2023-08-27 02:56:48,283 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (27 of 29 remaining) [2023-08-27 02:56:48,284 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 29 remaining) [2023-08-27 02:56:48,284 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 29 remaining) [2023-08-27 02:56:48,284 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 29 remaining) [2023-08-27 02:56:48,284 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 29 remaining) [2023-08-27 02:56:48,284 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 29 remaining) [2023-08-27 02:56:48,284 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 29 remaining) [2023-08-27 02:56:48,284 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 29 remaining) [2023-08-27 02:56:48,284 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 29 remaining) [2023-08-27 02:56:48,284 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 29 remaining) [2023-08-27 02:56:48,285 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 29 remaining) [2023-08-27 02:56:48,285 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 29 remaining) [2023-08-27 02:56:48,285 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 29 remaining) [2023-08-27 02:56:48,285 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 29 remaining) [2023-08-27 02:56:48,285 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 29 remaining) [2023-08-27 02:56:48,285 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONASSERT (12 of 29 remaining) [2023-08-27 02:56:48,285 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 29 remaining) [2023-08-27 02:56:48,285 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 29 remaining) [2023-08-27 02:56:48,285 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 29 remaining) [2023-08-27 02:56:48,285 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 29 remaining) [2023-08-27 02:56:48,285 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 29 remaining) [2023-08-27 02:56:48,286 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 29 remaining) [2023-08-27 02:56:48,286 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 29 remaining) [2023-08-27 02:56:48,286 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 29 remaining) [2023-08-27 02:56:48,286 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 29 remaining) [2023-08-27 02:56:48,286 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 29 remaining) [2023-08-27 02:56:48,286 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 29 remaining) [2023-08-27 02:56:48,286 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONASSERT (0 of 29 remaining) [2023-08-27 02:56:48,286 INFO L445 BasicCegarLoop]: Path program histogram: [6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:56:48,290 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 02:56:48,290 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 02:56:48,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 02:56:48 BasicIcfg [2023-08-27 02:56:48,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 02:56:48,293 INFO L158 Benchmark]: Toolchain (without parser) took 836009.33ms. Allocated memory was 333.4MB in the beginning and 8.5GB in the end (delta: 8.2GB). Free memory was 308.1MB in the beginning and 5.7GB in the end (delta: -5.4GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. [2023-08-27 02:56:48,293 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 333.4MB. Free memory is still 309.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 02:56:48,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 643.39ms. Allocated memory is still 333.4MB. Free memory was 308.1MB in the beginning and 278.2MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-27 02:56:48,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.65ms. Allocated memory is still 333.4MB. Free memory was 278.2MB in the beginning and 275.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 02:56:48,293 INFO L158 Benchmark]: Boogie Preprocessor took 62.12ms. Allocated memory is still 333.4MB. Free memory was 275.2MB in the beginning and 273.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 02:56:48,293 INFO L158 Benchmark]: RCFGBuilder took 518.57ms. Allocated memory is still 333.4MB. Free memory was 273.1MB in the beginning and 250.6MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-27 02:56:48,293 INFO L158 Benchmark]: TraceAbstraction took 834729.37ms. Allocated memory was 333.4MB in the beginning and 8.5GB in the end (delta: 8.2GB). Free memory was 250.1MB in the beginning and 5.7GB in the end (delta: -5.5GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. [2023-08-27 02:56:48,294 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 333.4MB. Free memory is still 309.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 643.39ms. Allocated memory is still 333.4MB. Free memory was 308.1MB in the beginning and 278.2MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 49.65ms. Allocated memory is still 333.4MB. Free memory was 278.2MB in the beginning and 275.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 62.12ms. Allocated memory is still 333.4MB. Free memory was 275.2MB in the beginning and 273.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 518.57ms. Allocated memory is still 333.4MB. Free memory was 273.1MB in the beginning and 250.6MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 834729.37ms. Allocated memory was 333.4MB in the beginning and 8.5GB in the end (delta: 8.2GB). Free memory was 250.1MB in the beginning and 5.7GB in the end (delta: -5.5GB). Peak memory consumption was 2.7GB. 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: 8.2s, 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 82 known predicates. - 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: 834.5s, OverallIterations: 27, TraceHistogramMax: 4, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 605.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.3s, HoareTripleCheckerStatistics: 1178 mSolverCounterUnknown, 6525 SdHoareTripleChecker+Valid, 327.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6525 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 324.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19274 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 1179 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16956 IncrementalHoareTripleChecker+Invalid, 38587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1179 mSolverCounterUnsat, 2 mSDtfsCounter, 16956 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 1178 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1070 GetRequests, 252 SyntacticMatches, 70 SemanticMatches, 747 ConstructedPredicates, 76 IntricatePredicates, 15 DeprecatedPredicates, 11954 ImplicationChecksByTransitivity, 423.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14071occurred in iteration=26, InterpolantAutomatonStates: 389, 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, 1.3s SatisfiabilityAnalysisTime, 214.0s InterpolantComputationTime, 714 NumberOfCodeBlocks, 714 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 949 ConstructedInterpolants, 305 QuantifiedInterpolants, 58232 SizeOfPredicates, 290 NumberOfNonLiveVariables, 3991 ConjunctsInSsa, 1021 ConjunctsInUnsatCore, 57 InterpolantComputations, 12 PerfectInterpolantSequences, 16/355 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 Completed graceful shutdown