/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/goblint-regression/06-symbeq_02-funloop_norace.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 04:41:55,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 04:41:55,494 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 04:41:55,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 04:41:55,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 04:41:55,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 04:41:55,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 04:41:55,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 04:41:55,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 04:41:55,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 04:41:55,522 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 04:41:55,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 04:41:55,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 04:41:55,523 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 04:41:55,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 04:41:55,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 04:41:55,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 04:41:55,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 04:41:55,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 04:41:55,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 04:41:55,525 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 04:41:55,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 04:41:55,529 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 04:41:55,529 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 04:41:55,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 04:41:55,532 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 04:41:55,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 04:41:55,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 04:41:55,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 04:41:55,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 04:41:55,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 04:41:55,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 04:41:55,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 04:41:55,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 04:41:55,534 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 04:41:55,534 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 04:41:55,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 04:41:55,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 04:41:55,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 04:41:55,841 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 04:41:55,843 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 04:41:55,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2023-08-27 04:41:56,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 04:41:57,151 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 04:41:57,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2023-08-27 04:41:57,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/142b39c17/bb5679ea81c44863b16e71a0b2b94f5b/FLAG76a74773d [2023-08-27 04:41:57,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/142b39c17/bb5679ea81c44863b16e71a0b2b94f5b [2023-08-27 04:41:57,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 04:41:57,190 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 04:41:57,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 04:41:57,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 04:41:57,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 04:41:57,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:41:57" (1/1) ... [2023-08-27 04:41:57,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3020e7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:41:57, skipping insertion in model container [2023-08-27 04:41:57,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:41:57" (1/1) ... [2023-08-27 04:41:57,243 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 04:41:57,592 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 04:41:57,614 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 04:41:57,638 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-27 04:41:57,640 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-27 04:41:57,645 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-27 04:41:57,666 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 04:41:57,726 INFO L206 MainTranslator]: Completed translation [2023-08-27 04:41:57,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:41:57 WrapperNode [2023-08-27 04:41:57,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 04:41:57,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 04:41:57,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 04:41:57,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 04:41:57,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:41:57" (1/1) ... [2023-08-27 04:41:57,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:41:57" (1/1) ... [2023-08-27 04:41:57,789 INFO L138 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2023-08-27 04:41:57,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 04:41:57,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 04:41:57,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 04:41:57,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 04:41:57,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:41:57" (1/1) ... [2023-08-27 04:41:57,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:41:57" (1/1) ... [2023-08-27 04:41:57,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:41:57" (1/1) ... [2023-08-27 04:41:57,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:41:57" (1/1) ... [2023-08-27 04:41:57,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:41:57" (1/1) ... [2023-08-27 04:41:57,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:41:57" (1/1) ... [2023-08-27 04:41:57,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:41:57" (1/1) ... [2023-08-27 04:41:57,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:41:57" (1/1) ... [2023-08-27 04:41:57,823 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 04:41:57,824 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 04:41:57,824 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 04:41:57,824 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 04:41:57,830 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:41:57" (1/1) ... [2023-08-27 04:41:57,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 04:41:57,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:41:57,858 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 04:41:57,888 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 04:41:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 04:41:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 04:41:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 04:41:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 04:41:57,898 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-27 04:41:57,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 04:41:57,898 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-27 04:41:57,898 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-27 04:41:57,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 04:41:57,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 04:41:57,900 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 04:41:58,025 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 04:41:58,026 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 04:41:58,222 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 04:41:58,229 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 04:41:58,229 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-27 04:41:58,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:41:58 BoogieIcfgContainer [2023-08-27 04:41:58,231 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 04:41:58,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 04:41:58,233 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 04:41:58,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 04:41:58,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 04:41:57" (1/3) ... [2023-08-27 04:41:58,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2264e715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:41:58, skipping insertion in model container [2023-08-27 04:41:58,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:41:57" (2/3) ... [2023-08-27 04:41:58,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2264e715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:41:58, skipping insertion in model container [2023-08-27 04:41:58,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:41:58" (3/3) ... [2023-08-27 04:41:58,239 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2023-08-27 04:41:58,253 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 04:41:58,253 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 04:41:58,254 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 04:41:58,331 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 04:41:58,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 93 transitions, 191 flow [2023-08-27 04:41:58,414 INFO L124 PetriNetUnfolderBase]: 6/92 cut-off events. [2023-08-27 04:41:58,415 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 04:41:58,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 92 events. 6/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 138 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-08-27 04:41:58,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 93 transitions, 191 flow [2023-08-27 04:41:58,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 92 transitions, 187 flow [2023-08-27 04:41:58,430 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 04:41:58,445 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 92 transitions, 187 flow [2023-08-27 04:41:58,449 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 92 transitions, 187 flow [2023-08-27 04:41:58,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 92 transitions, 187 flow [2023-08-27 04:41:58,484 INFO L124 PetriNetUnfolderBase]: 6/92 cut-off events. [2023-08-27 04:41:58,484 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 04:41:58,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 92 events. 6/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 138 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-08-27 04:41:58,487 INFO L119 LiptonReduction]: Number of co-enabled transitions 2108 [2023-08-27 04:42:00,344 INFO L134 LiptonReduction]: Checked pairs total: 2651 [2023-08-27 04:42:00,344 INFO L136 LiptonReduction]: Total number of compositions: 87 [2023-08-27 04:42:00,355 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 04:42:00,360 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;@568c2975, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 04:42:00,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-27 04:42:00,362 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 04:42:00,362 INFO L124 PetriNetUnfolderBase]: 1/2 cut-off events. [2023-08-27 04:42:00,362 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 04:42:00,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:42:00,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-27 04:42:00,363 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:42:00,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:42:00,367 INFO L85 PathProgramCache]: Analyzing trace with hash 11586, now seen corresponding path program 1 times [2023-08-27 04:42:00,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:42:00,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693306043] [2023-08-27 04:42:00,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:00,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:42:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:00,518 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 04:42:00,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:42:00,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693306043] [2023-08-27 04:42:00,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693306043] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:42:00,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:42:00,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 04:42:00,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796674026] [2023-08-27 04:42:00,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:42:00,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 04:42:00,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:42:00,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 04:42:00,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 04:42:00,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 180 [2023-08-27 04:42:00,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:00,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:42:00,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 180 [2023-08-27 04:42:00,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:42:00,625 INFO L124 PetriNetUnfolderBase]: 102/204 cut-off events. [2023-08-27 04:42:00,625 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 04:42:00,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 204 events. 102/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 720 event pairs, 81 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 400. Up to 203 conditions per place. [2023-08-27 04:42:00,628 INFO L140 encePairwiseOnDemand]: 176/180 looper letters, 22 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2023-08-27 04:42:00,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 99 flow [2023-08-27 04:42:00,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 04:42:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 04:42:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2023-08-27 04:42:00,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4981481481481482 [2023-08-27 04:42:00,640 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 269 transitions. [2023-08-27 04:42:00,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 269 transitions. [2023-08-27 04:42:00,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:42:00,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 269 transitions. [2023-08-27 04:42:00,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:00,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:00,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:00,650 INFO L175 Difference]: Start difference. First operand has 27 places, 26 transitions, 55 flow. Second operand 3 states and 269 transitions. [2023-08-27 04:42:00,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 99 flow [2023-08-27 04:42:00,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 98 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 04:42:00,652 INFO L231 Difference]: Finished difference. Result has 26 places, 24 transitions, 54 flow [2023-08-27 04:42:00,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=26, PETRI_TRANSITIONS=24} [2023-08-27 04:42:00,656 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2023-08-27 04:42:00,656 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 54 flow [2023-08-27 04:42:00,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:00,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:42:00,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 04:42:00,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 04:42:00,657 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:42:00,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:42:00,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2147196239, now seen corresponding path program 1 times [2023-08-27 04:42:00,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:42:00,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567627498] [2023-08-27 04:42:00,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:00,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:42:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:00,734 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 04:42:00,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:42:00,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567627498] [2023-08-27 04:42:00,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567627498] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:42:00,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:42:00,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 04:42:00,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118208560] [2023-08-27 04:42:00,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:42:00,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 04:42:00,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:42:00,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 04:42:00,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 04:42:00,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 180 [2023-08-27 04:42:00,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:00,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:42:00,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 180 [2023-08-27 04:42:00,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:42:00,788 INFO L124 PetriNetUnfolderBase]: 102/205 cut-off events. [2023-08-27 04:42:00,788 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 04:42:00,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 205 events. 102/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 720 event pairs, 81 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 404. Up to 205 conditions per place. [2023-08-27 04:42:00,790 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2023-08-27 04:42:00,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 25 transitions, 106 flow [2023-08-27 04:42:00,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 04:42:00,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 04:42:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2023-08-27 04:42:00,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4981481481481482 [2023-08-27 04:42:00,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 269 transitions. [2023-08-27 04:42:00,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 269 transitions. [2023-08-27 04:42:00,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:42:00,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 269 transitions. [2023-08-27 04:42:00,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:00,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:00,795 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:00,796 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 54 flow. Second operand 3 states and 269 transitions. [2023-08-27 04:42:00,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 25 transitions, 106 flow [2023-08-27 04:42:00,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 04:42:00,797 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 62 flow [2023-08-27 04:42:00,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2023-08-27 04:42:00,797 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2023-08-27 04:42:00,798 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 62 flow [2023-08-27 04:42:00,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:00,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:42:00,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:42:00,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 04:42:00,798 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:42:00,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:42:00,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2073968638, now seen corresponding path program 1 times [2023-08-27 04:42:00,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:42:00,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256174137] [2023-08-27 04:42:00,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:00,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:42:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:00,853 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 04:42:00,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:42:00,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256174137] [2023-08-27 04:42:00,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256174137] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:42:00,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003434132] [2023-08-27 04:42:00,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:00,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:42:00,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:42:00,857 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 04:42:00,892 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 04:42:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:00,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-27 04:42:00,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:42:00,975 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 04:42:00,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 04:42:00,989 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 04:42:00,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003434132] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 04:42:00,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 04:42:00,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-27 04:42:00,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871620616] [2023-08-27 04:42:00,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 04:42:00,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 04:42:00,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:42:00,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 04:42:00,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 04:42:00,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 180 [2023-08-27 04:42:00,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 62 flow. Second operand has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:00,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:42:00,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 180 [2023-08-27 04:42:00,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:42:01,060 INFO L124 PetriNetUnfolderBase]: 102/208 cut-off events. [2023-08-27 04:42:01,061 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 04:42:01,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 208 events. 102/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 719 event pairs, 81 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 419. Up to 205 conditions per place. [2023-08-27 04:42:01,062 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 23 selfloop transitions, 5 changer transitions 0/28 dead transitions. [2023-08-27 04:42:01,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 130 flow [2023-08-27 04:42:01,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 04:42:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 04:42:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 517 transitions. [2023-08-27 04:42:01,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787037037037037 [2023-08-27 04:42:01,065 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 517 transitions. [2023-08-27 04:42:01,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 517 transitions. [2023-08-27 04:42:01,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:42:01,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 517 transitions. [2023-08-27 04:42:01,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:01,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:01,070 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:01,070 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 62 flow. Second operand 6 states and 517 transitions. [2023-08-27 04:42:01,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 130 flow [2023-08-27 04:42:01,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 126 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-27 04:42:01,071 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 94 flow [2023-08-27 04:42:01,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=94, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2023-08-27 04:42:01,072 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 7 predicate places. [2023-08-27 04:42:01,072 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 94 flow [2023-08-27 04:42:01,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:01,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:42:01,073 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-27 04:42:01,081 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 04:42:01,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:42:01,278 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:42:01,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:42:01,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1528409841, now seen corresponding path program 2 times [2023-08-27 04:42:01,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:42:01,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428981112] [2023-08-27 04:42:01,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:01,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:42:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 04:42:01,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:42:01,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428981112] [2023-08-27 04:42:01,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428981112] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:42:01,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911833023] [2023-08-27 04:42:01,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 04:42:01,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:42:01,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:42:01,420 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 04:42:01,423 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 04:42:01,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-27 04:42:01,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 04:42:01,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-27 04:42:01,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:42:01,517 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 7 treesize of output 6 [2023-08-27 04:42:01,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 04:42:01,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-27 04:42:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-27 04:42:01,614 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 04:42:01,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911833023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:42:01,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 04:42:01,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2023-08-27 04:42:01,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124994912] [2023-08-27 04:42:01,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:42:01,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 04:42:01,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:42:01,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 04:42:01,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-27 04:42:01,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 180 [2023-08-27 04:42:01,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:01,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:42:01,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 180 [2023-08-27 04:42:01,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:42:01,723 INFO L124 PetriNetUnfolderBase]: 136/276 cut-off events. [2023-08-27 04:42:01,723 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 04:42:01,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 276 events. 136/276 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1070 event pairs, 24 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 546. Up to 211 conditions per place. [2023-08-27 04:42:01,727 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 42 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2023-08-27 04:42:01,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 226 flow [2023-08-27 04:42:01,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 04:42:01,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 04:42:01,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2023-08-27 04:42:01,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46805555555555556 [2023-08-27 04:42:01,729 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 337 transitions. [2023-08-27 04:42:01,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 337 transitions. [2023-08-27 04:42:01,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:42:01,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 337 transitions. [2023-08-27 04:42:01,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:01,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:01,732 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:01,732 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 94 flow. Second operand 4 states and 337 transitions. [2023-08-27 04:42:01,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 226 flow [2023-08-27 04:42:01,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 212 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-27 04:42:01,735 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 114 flow [2023-08-27 04:42:01,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2023-08-27 04:42:01,737 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2023-08-27 04:42:01,737 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 114 flow [2023-08-27 04:42:01,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:01,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:42:01,741 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-27 04:42:01,748 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 04:42:01,945 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,SelfDestructingSolverStorable3 [2023-08-27 04:42:01,946 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:42:01,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:42:01,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1528420368, now seen corresponding path program 1 times [2023-08-27 04:42:01,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:42:01,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224253342] [2023-08-27 04:42:01,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:01,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:42:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:02,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 04:42:02,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:42:02,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224253342] [2023-08-27 04:42:02,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224253342] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:42:02,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200871735] [2023-08-27 04:42:02,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:02,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:42:02,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:42:02,069 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 04:42:02,100 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 04:42:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:02,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-27 04:42:02,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:42:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 04:42:02,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 04:42:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 04:42:02,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200871735] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 04:42:02,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 04:42:02,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-08-27 04:42:02,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526041516] [2023-08-27 04:42:02,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 04:42:02,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-27 04:42:02,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:42:02,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-27 04:42:02,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-08-27 04:42:02,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 180 [2023-08-27 04:42:02,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 114 flow. Second operand has 12 states, 12 states have (on average 82.33333333333333) internal successors, (988), 12 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:02,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:42:02,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 180 [2023-08-27 04:42:02,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:42:02,293 INFO L124 PetriNetUnfolderBase]: 136/282 cut-off events. [2023-08-27 04:42:02,293 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-08-27 04:42:02,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 282 events. 136/282 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1094 event pairs, 91 based on Foata normal form. 6/193 useless extension candidates. Maximal degree in co-relation 634. Up to 273 conditions per place. [2023-08-27 04:42:02,295 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 27 selfloop transitions, 11 changer transitions 0/38 dead transitions. [2023-08-27 04:42:02,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 226 flow [2023-08-27 04:42:02,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-27 04:42:02,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-27 04:42:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1012 transitions. [2023-08-27 04:42:02,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4685185185185185 [2023-08-27 04:42:02,298 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1012 transitions. [2023-08-27 04:42:02,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1012 transitions. [2023-08-27 04:42:02,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:42:02,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1012 transitions. [2023-08-27 04:42:02,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 84.33333333333333) internal successors, (1012), 12 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:02,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 180.0) internal successors, (2340), 13 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:02,306 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 180.0) internal successors, (2340), 13 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:02,306 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 114 flow. Second operand 12 states and 1012 transitions. [2023-08-27 04:42:02,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 226 flow [2023-08-27 04:42:02,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 226 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 04:42:02,309 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 198 flow [2023-08-27 04:42:02,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=198, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2023-08-27 04:42:02,312 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 28 predicate places. [2023-08-27 04:42:02,312 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 198 flow [2023-08-27 04:42:02,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 82.33333333333333) internal successors, (988), 12 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:02,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:42:02,313 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-08-27 04:42:02,322 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 04:42:02,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:42:02,517 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:42:02,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:42:02,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2128703888, now seen corresponding path program 2 times [2023-08-27 04:42:02,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:42:02,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747876962] [2023-08-27 04:42:02,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:02,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:42:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:42:02,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:42:02,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747876962] [2023-08-27 04:42:02,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747876962] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:42:02,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:42:02,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 04:42:02,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709171983] [2023-08-27 04:42:02,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:42:02,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 04:42:02,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:42:02,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 04:42:02,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 04:42:02,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 180 [2023-08-27 04:42:02,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:02,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:42:02,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 180 [2023-08-27 04:42:02,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:42:02,826 INFO L124 PetriNetUnfolderBase]: 126/262 cut-off events. [2023-08-27 04:42:02,827 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-08-27 04:42:02,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 262 events. 126/262 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 972 event pairs, 34 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 592. Up to 209 conditions per place. [2023-08-27 04:42:02,829 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 44 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2023-08-27 04:42:02,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 50 transitions, 329 flow [2023-08-27 04:42:02,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 04:42:02,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 04:42:02,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 333 transitions. [2023-08-27 04:42:02,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2023-08-27 04:42:02,831 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 333 transitions. [2023-08-27 04:42:02,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 333 transitions. [2023-08-27 04:42:02,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:42:02,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 333 transitions. [2023-08-27 04:42:02,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:02,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:02,834 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:02,834 INFO L175 Difference]: Start difference. First operand has 55 places, 38 transitions, 198 flow. Second operand 4 states and 333 transitions. [2023-08-27 04:42:02,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 50 transitions, 329 flow [2023-08-27 04:42:02,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 281 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-27 04:42:02,841 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 182 flow [2023-08-27 04:42:02,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-08-27 04:42:02,843 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 28 predicate places. [2023-08-27 04:42:02,843 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 182 flow [2023-08-27 04:42:02,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:02,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:42:02,844 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:42:02,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 04:42:02,844 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:42:02,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:42:02,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1290071975, now seen corresponding path program 1 times [2023-08-27 04:42:02,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:42:02,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534815063] [2023-08-27 04:42:02,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:02,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:42:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:42:02,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:42:02,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534815063] [2023-08-27 04:42:02,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534815063] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:42:02,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:42:02,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 04:42:02,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152665833] [2023-08-27 04:42:02,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:42:02,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 04:42:02,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:42:02,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 04:42:02,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 04:42:02,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 180 [2023-08-27 04:42:02,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:02,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:42:02,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 180 [2023-08-27 04:42:02,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:42:03,015 INFO L124 PetriNetUnfolderBase]: 176/362 cut-off events. [2023-08-27 04:42:03,015 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2023-08-27 04:42:03,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 362 events. 176/362 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1487 event pairs, 68 based on Foata normal form. 14/289 useless extension candidates. Maximal degree in co-relation 906. Up to 219 conditions per place. [2023-08-27 04:42:03,018 INFO L140 encePairwiseOnDemand]: 175/180 looper letters, 56 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-27 04:42:03,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 360 flow [2023-08-27 04:42:03,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 04:42:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 04:42:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2023-08-27 04:42:03,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5351851851851852 [2023-08-27 04:42:03,019 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 289 transitions. [2023-08-27 04:42:03,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 289 transitions. [2023-08-27 04:42:03,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:42:03,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 289 transitions. [2023-08-27 04:42:03,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:03,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:03,022 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:03,022 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 182 flow. Second operand 3 states and 289 transitions. [2023-08-27 04:42:03,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 360 flow [2023-08-27 04:42:03,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 354 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 04:42:03,025 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 193 flow [2023-08-27 04:42:03,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2023-08-27 04:42:03,025 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 30 predicate places. [2023-08-27 04:42:03,025 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 193 flow [2023-08-27 04:42:03,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:03,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:42:03,026 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:42:03,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 04:42:03,026 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:42:03,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:42:03,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1279986895, now seen corresponding path program 1 times [2023-08-27 04:42:03,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:42:03,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064978482] [2023-08-27 04:42:03,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:03,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:42:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:42:03,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:42:03,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064978482] [2023-08-27 04:42:03,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064978482] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:42:03,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:42:03,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 04:42:03,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607662732] [2023-08-27 04:42:03,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:42:03,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 04:42:03,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:42:03,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 04:42:03,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 04:42:03,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 180 [2023-08-27 04:42:03,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:03,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:42:03,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 180 [2023-08-27 04:42:03,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:42:03,217 INFO L124 PetriNetUnfolderBase]: 238/486 cut-off events. [2023-08-27 04:42:03,217 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2023-08-27 04:42:03,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 486 events. 238/486 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2028 event pairs, 118 based on Foata normal form. 14/384 useless extension candidates. Maximal degree in co-relation 1318. Up to 333 conditions per place. [2023-08-27 04:42:03,221 INFO L140 encePairwiseOnDemand]: 175/180 looper letters, 58 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-27 04:42:03,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 390 flow [2023-08-27 04:42:03,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 04:42:03,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 04:42:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2023-08-27 04:42:03,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5296296296296297 [2023-08-27 04:42:03,222 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 286 transitions. [2023-08-27 04:42:03,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 286 transitions. [2023-08-27 04:42:03,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:42:03,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 286 transitions. [2023-08-27 04:42:03,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:03,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:03,225 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:03,225 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 193 flow. Second operand 3 states and 286 transitions. [2023-08-27 04:42:03,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 390 flow [2023-08-27 04:42:03,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 60 transitions, 386 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 04:42:03,228 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 207 flow [2023-08-27 04:42:03,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=207, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2023-08-27 04:42:03,229 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 32 predicate places. [2023-08-27 04:42:03,230 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 207 flow [2023-08-27 04:42:03,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:03,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:42:03,230 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:42:03,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 04:42:03,230 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:42:03,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:42:03,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1445015532, now seen corresponding path program 1 times [2023-08-27 04:42:03,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:42:03,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500129242] [2023-08-27 04:42:03,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:03,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:42:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:42:03,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:42:03,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500129242] [2023-08-27 04:42:03,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500129242] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:42:03,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:42:03,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 04:42:03,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813098369] [2023-08-27 04:42:03,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:42:03,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 04:42:03,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:42:03,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 04:42:03,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-27 04:42:03,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 180 [2023-08-27 04:42:03,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 207 flow. Second operand has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:03,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:42:03,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 180 [2023-08-27 04:42:03,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:42:03,861 INFO L124 PetriNetUnfolderBase]: 263/549 cut-off events. [2023-08-27 04:42:03,861 INFO L125 PetriNetUnfolderBase]: For 295/295 co-relation queries the response was YES. [2023-08-27 04:42:03,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 549 events. 263/549 cut-off events. For 295/295 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2439 event pairs, 109 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 1598. Up to 430 conditions per place. [2023-08-27 04:42:03,865 INFO L140 encePairwiseOnDemand]: 171/180 looper letters, 57 selfloop transitions, 16 changer transitions 0/73 dead transitions. [2023-08-27 04:42:03,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 73 transitions, 475 flow [2023-08-27 04:42:03,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 04:42:03,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 04:42:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 565 transitions. [2023-08-27 04:42:03,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2023-08-27 04:42:03,868 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 565 transitions. [2023-08-27 04:42:03,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 565 transitions. [2023-08-27 04:42:03,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:42:03,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 565 transitions. [2023-08-27 04:42:03,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 70.625) internal successors, (565), 8 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:03,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:03,873 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:03,873 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 207 flow. Second operand 8 states and 565 transitions. [2023-08-27 04:42:03,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 73 transitions, 475 flow [2023-08-27 04:42:03,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 73 transitions, 468 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 04:42:03,877 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 328 flow [2023-08-27 04:42:03,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=328, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2023-08-27 04:42:03,878 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 43 predicate places. [2023-08-27 04:42:03,878 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 328 flow [2023-08-27 04:42:03,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:03,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:42:03,879 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:42:03,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 04:42:03,879 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:42:03,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:42:03,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1991927113, now seen corresponding path program 1 times [2023-08-27 04:42:03,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:42:03,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512267808] [2023-08-27 04:42:03,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:03,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:42:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:04,230 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:42:04,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:42:04,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512267808] [2023-08-27 04:42:04,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512267808] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:42:04,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:42:04,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 04:42:04,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061094350] [2023-08-27 04:42:04,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:42:04,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 04:42:04,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:42:04,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 04:42:04,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-27 04:42:04,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 180 [2023-08-27 04:42:04,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 52 transitions, 328 flow. Second operand has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:04,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:42:04,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 180 [2023-08-27 04:42:04,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:42:04,462 INFO L124 PetriNetUnfolderBase]: 284/604 cut-off events. [2023-08-27 04:42:04,462 INFO L125 PetriNetUnfolderBase]: For 822/822 co-relation queries the response was YES. [2023-08-27 04:42:04,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2109 conditions, 604 events. 284/604 cut-off events. For 822/822 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2804 event pairs, 97 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 2043. Up to 479 conditions per place. [2023-08-27 04:42:04,466 INFO L140 encePairwiseOnDemand]: 171/180 looper letters, 64 selfloop transitions, 20 changer transitions 0/84 dead transitions. [2023-08-27 04:42:04,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 84 transitions, 652 flow [2023-08-27 04:42:04,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 04:42:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 04:42:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 565 transitions. [2023-08-27 04:42:04,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2023-08-27 04:42:04,469 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 565 transitions. [2023-08-27 04:42:04,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 565 transitions. [2023-08-27 04:42:04,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:42:04,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 565 transitions. [2023-08-27 04:42:04,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 70.625) internal successors, (565), 8 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:04,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:04,473 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:04,473 INFO L175 Difference]: Start difference. First operand has 70 places, 52 transitions, 328 flow. Second operand 8 states and 565 transitions. [2023-08-27 04:42:04,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 84 transitions, 652 flow [2023-08-27 04:42:04,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 84 transitions, 635 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-27 04:42:04,477 INFO L231 Difference]: Finished difference. Result has 80 places, 62 transitions, 468 flow [2023-08-27 04:42:04,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=468, PETRI_PLACES=80, PETRI_TRANSITIONS=62} [2023-08-27 04:42:04,478 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 53 predicate places. [2023-08-27 04:42:04,478 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 62 transitions, 468 flow [2023-08-27 04:42:04,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:04,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:42:04,479 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:42:04,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 04:42:04,479 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:42:04,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:42:04,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1133449656, now seen corresponding path program 2 times [2023-08-27 04:42:04,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:42:04,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218631832] [2023-08-27 04:42:04,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:04,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:42:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:04,775 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:42:04,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:42:04,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218631832] [2023-08-27 04:42:04,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218631832] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:42:04,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:42:04,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 04:42:04,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244395626] [2023-08-27 04:42:04,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:42:04,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 04:42:04,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:42:04,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 04:42:04,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-27 04:42:04,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 180 [2023-08-27 04:42:04,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 62 transitions, 468 flow. Second operand has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:04,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:42:04,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 180 [2023-08-27 04:42:04,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:42:05,084 INFO L124 PetriNetUnfolderBase]: 310/649 cut-off events. [2023-08-27 04:42:05,085 INFO L125 PetriNetUnfolderBase]: For 1551/1551 co-relation queries the response was YES. [2023-08-27 04:42:05,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2617 conditions, 649 events. 310/649 cut-off events. For 1551/1551 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3080 event pairs, 122 based on Foata normal form. 8/585 useless extension candidates. Maximal degree in co-relation 2545. Up to 488 conditions per place. [2023-08-27 04:42:05,090 INFO L140 encePairwiseOnDemand]: 171/180 looper letters, 67 selfloop transitions, 32 changer transitions 0/99 dead transitions. [2023-08-27 04:42:05,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 99 transitions, 900 flow [2023-08-27 04:42:05,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 04:42:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 04:42:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 759 transitions. [2023-08-27 04:42:05,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2023-08-27 04:42:05,093 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 759 transitions. [2023-08-27 04:42:05,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 759 transitions. [2023-08-27 04:42:05,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:42:05,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 759 transitions. [2023-08-27 04:42:05,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 69.0) internal successors, (759), 11 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:05,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 180.0) internal successors, (2160), 12 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:05,098 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 180.0) internal successors, (2160), 12 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:05,098 INFO L175 Difference]: Start difference. First operand has 80 places, 62 transitions, 468 flow. Second operand 11 states and 759 transitions. [2023-08-27 04:42:05,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 99 transitions, 900 flow [2023-08-27 04:42:05,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 99 transitions, 860 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-27 04:42:05,106 INFO L231 Difference]: Finished difference. Result has 92 places, 75 transitions, 674 flow [2023-08-27 04:42:05,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=674, PETRI_PLACES=92, PETRI_TRANSITIONS=75} [2023-08-27 04:42:05,106 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 65 predicate places. [2023-08-27 04:42:05,107 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 75 transitions, 674 flow [2023-08-27 04:42:05,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:05,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:42:05,107 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:42:05,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 04:42:05,107 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:42:05,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:42:05,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1134285727, now seen corresponding path program 1 times [2023-08-27 04:42:05,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:42:05,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112320562] [2023-08-27 04:42:05,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:05,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:42:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:42:05,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:42:05,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112320562] [2023-08-27 04:42:05,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112320562] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:42:05,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:42:05,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 04:42:05,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747943034] [2023-08-27 04:42:05,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:42:05,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 04:42:05,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:42:05,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 04:42:05,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-27 04:42:05,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 180 [2023-08-27 04:42:05,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 75 transitions, 674 flow. Second operand has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:05,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:42:05,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 180 [2023-08-27 04:42:05,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:42:05,740 INFO L124 PetriNetUnfolderBase]: 381/813 cut-off events. [2023-08-27 04:42:05,740 INFO L125 PetriNetUnfolderBase]: For 2795/2795 co-relation queries the response was YES. [2023-08-27 04:42:05,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3559 conditions, 813 events. 381/813 cut-off events. For 2795/2795 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4306 event pairs, 74 based on Foata normal form. 7/712 useless extension candidates. Maximal degree in co-relation 3482. Up to 439 conditions per place. [2023-08-27 04:42:05,748 INFO L140 encePairwiseOnDemand]: 171/180 looper letters, 78 selfloop transitions, 39 changer transitions 0/117 dead transitions. [2023-08-27 04:42:05,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 117 transitions, 1163 flow [2023-08-27 04:42:05,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-27 04:42:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-27 04:42:05,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 836 transitions. [2023-08-27 04:42:05,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.387037037037037 [2023-08-27 04:42:05,751 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 836 transitions. [2023-08-27 04:42:05,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 836 transitions. [2023-08-27 04:42:05,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:42:05,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 836 transitions. [2023-08-27 04:42:05,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 69.66666666666667) internal successors, (836), 12 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:05,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 180.0) internal successors, (2340), 13 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:05,757 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 180.0) internal successors, (2340), 13 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:05,757 INFO L175 Difference]: Start difference. First operand has 92 places, 75 transitions, 674 flow. Second operand 12 states and 836 transitions. [2023-08-27 04:42:05,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 117 transitions, 1163 flow [2023-08-27 04:42:05,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 117 transitions, 1104 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-08-27 04:42:05,769 INFO L231 Difference]: Finished difference. Result has 102 places, 87 transitions, 878 flow [2023-08-27 04:42:05,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=878, PETRI_PLACES=102, PETRI_TRANSITIONS=87} [2023-08-27 04:42:05,770 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 75 predicate places. [2023-08-27 04:42:05,770 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 87 transitions, 878 flow [2023-08-27 04:42:05,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:05,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:42:05,771 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:42:05,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 04:42:05,771 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:42:05,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:42:05,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1133417107, now seen corresponding path program 2 times [2023-08-27 04:42:05,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:42:05,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203667193] [2023-08-27 04:42:05,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:05,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:42:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:42:06,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:42:06,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203667193] [2023-08-27 04:42:06,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203667193] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:42:06,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:42:06,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 04:42:06,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150947783] [2023-08-27 04:42:06,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:42:06,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 04:42:06,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:42:06,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 04:42:06,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-27 04:42:06,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 180 [2023-08-27 04:42:06,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 87 transitions, 878 flow. Second operand has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:06,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:42:06,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 180 [2023-08-27 04:42:06,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:42:06,364 INFO L124 PetriNetUnfolderBase]: 423/908 cut-off events. [2023-08-27 04:42:06,364 INFO L125 PetriNetUnfolderBase]: For 4838/4838 co-relation queries the response was YES. [2023-08-27 04:42:06,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4440 conditions, 908 events. 423/908 cut-off events. For 4838/4838 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4883 event pairs, 48 based on Foata normal form. 29/829 useless extension candidates. Maximal degree in co-relation 4360. Up to 379 conditions per place. [2023-08-27 04:42:06,373 INFO L140 encePairwiseOnDemand]: 172/180 looper letters, 85 selfloop transitions, 49 changer transitions 0/134 dead transitions. [2023-08-27 04:42:06,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 134 transitions, 1449 flow [2023-08-27 04:42:06,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 04:42:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 04:42:06,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 776 transitions. [2023-08-27 04:42:06,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39191919191919194 [2023-08-27 04:42:06,376 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 776 transitions. [2023-08-27 04:42:06,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 776 transitions. [2023-08-27 04:42:06,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:42:06,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 776 transitions. [2023-08-27 04:42:06,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 70.54545454545455) internal successors, (776), 11 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:06,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 180.0) internal successors, (2160), 12 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:06,380 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 180.0) internal successors, (2160), 12 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:06,381 INFO L175 Difference]: Start difference. First operand has 102 places, 87 transitions, 878 flow. Second operand 11 states and 776 transitions. [2023-08-27 04:42:06,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 134 transitions, 1449 flow [2023-08-27 04:42:06,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 134 transitions, 1317 flow, removed 33 selfloop flow, removed 8 redundant places. [2023-08-27 04:42:06,397 INFO L231 Difference]: Finished difference. Result has 108 places, 93 transitions, 999 flow [2023-08-27 04:42:06,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=999, PETRI_PLACES=108, PETRI_TRANSITIONS=93} [2023-08-27 04:42:06,398 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 81 predicate places. [2023-08-27 04:42:06,399 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 93 transitions, 999 flow [2023-08-27 04:42:06,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:06,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:42:06,400 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:42:06,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 04:42:06,401 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:42:06,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:42:06,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1133417106, now seen corresponding path program 3 times [2023-08-27 04:42:06,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:42:06,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711814207] [2023-08-27 04:42:06,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:06,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:42:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:06,685 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:42:06,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:42:06,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711814207] [2023-08-27 04:42:06,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711814207] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:42:06,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:42:06,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 04:42:06,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442192814] [2023-08-27 04:42:06,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:42:06,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 04:42:06,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:42:06,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 04:42:06,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-27 04:42:06,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 180 [2023-08-27 04:42:06,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 93 transitions, 999 flow. Second operand has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:06,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:42:06,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 180 [2023-08-27 04:42:06,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:42:07,054 INFO L124 PetriNetUnfolderBase]: 416/894 cut-off events. [2023-08-27 04:42:07,054 INFO L125 PetriNetUnfolderBase]: For 5412/5412 co-relation queries the response was YES. [2023-08-27 04:42:07,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4542 conditions, 894 events. 416/894 cut-off events. For 5412/5412 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4801 event pairs, 120 based on Foata normal form. 7/793 useless extension candidates. Maximal degree in co-relation 4460. Up to 693 conditions per place. [2023-08-27 04:42:07,063 INFO L140 encePairwiseOnDemand]: 172/180 looper letters, 87 selfloop transitions, 42 changer transitions 0/129 dead transitions. [2023-08-27 04:42:07,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 129 transitions, 1502 flow [2023-08-27 04:42:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 04:42:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 04:42:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 766 transitions. [2023-08-27 04:42:07,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38686868686868686 [2023-08-27 04:42:07,067 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 766 transitions. [2023-08-27 04:42:07,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 766 transitions. [2023-08-27 04:42:07,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:42:07,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 766 transitions. [2023-08-27 04:42:07,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 69.63636363636364) internal successors, (766), 11 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:07,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 180.0) internal successors, (2160), 12 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:07,072 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 180.0) internal successors, (2160), 12 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:07,072 INFO L175 Difference]: Start difference. First operand has 108 places, 93 transitions, 999 flow. Second operand 11 states and 766 transitions. [2023-08-27 04:42:07,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 129 transitions, 1502 flow [2023-08-27 04:42:07,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 129 transitions, 1461 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-27 04:42:07,092 INFO L231 Difference]: Finished difference. Result has 113 places, 96 transitions, 1125 flow [2023-08-27 04:42:07,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1125, PETRI_PLACES=113, PETRI_TRANSITIONS=96} [2023-08-27 04:42:07,093 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 86 predicate places. [2023-08-27 04:42:07,093 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 96 transitions, 1125 flow [2023-08-27 04:42:07,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:07,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:42:07,093 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:42:07,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 04:42:07,093 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:42:07,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:42:07,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1134241847, now seen corresponding path program 1 times [2023-08-27 04:42:07,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:42:07,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227741884] [2023-08-27 04:42:07,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:07,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:42:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:42:07,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:42:07,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227741884] [2023-08-27 04:42:07,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227741884] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:42:07,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:42:07,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 04:42:07,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964540891] [2023-08-27 04:42:07,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:42:07,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 04:42:07,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:42:07,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 04:42:07,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-27 04:42:07,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 180 [2023-08-27 04:42:07,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 96 transitions, 1125 flow. Second operand has 7 states, 7 states have (on average 70.57142857142857) internal successors, (494), 7 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:07,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:42:07,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 180 [2023-08-27 04:42:07,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:42:07,620 INFO L124 PetriNetUnfolderBase]: 455/962 cut-off events. [2023-08-27 04:42:07,621 INFO L125 PetriNetUnfolderBase]: For 6474/6474 co-relation queries the response was YES. [2023-08-27 04:42:07,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5047 conditions, 962 events. 455/962 cut-off events. For 6474/6474 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5218 event pairs, 190 based on Foata normal form. 21/871 useless extension candidates. Maximal degree in co-relation 4963. Up to 739 conditions per place. [2023-08-27 04:42:07,631 INFO L140 encePairwiseOnDemand]: 173/180 looper letters, 104 selfloop transitions, 28 changer transitions 0/132 dead transitions. [2023-08-27 04:42:07,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 132 transitions, 1776 flow [2023-08-27 04:42:07,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 04:42:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 04:42:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 543 transitions. [2023-08-27 04:42:07,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.430952380952381 [2023-08-27 04:42:07,633 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 543 transitions. [2023-08-27 04:42:07,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 543 transitions. [2023-08-27 04:42:07,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:42:07,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 543 transitions. [2023-08-27 04:42:07,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:07,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:07,637 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:07,637 INFO L175 Difference]: Start difference. First operand has 113 places, 96 transitions, 1125 flow. Second operand 7 states and 543 transitions. [2023-08-27 04:42:07,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 132 transitions, 1776 flow [2023-08-27 04:42:07,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 132 transitions, 1711 flow, removed 5 selfloop flow, removed 8 redundant places. [2023-08-27 04:42:07,662 INFO L231 Difference]: Finished difference. Result has 114 places, 103 transitions, 1263 flow [2023-08-27 04:42:07,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1263, PETRI_PLACES=114, PETRI_TRANSITIONS=103} [2023-08-27 04:42:07,663 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 87 predicate places. [2023-08-27 04:42:07,663 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 103 transitions, 1263 flow [2023-08-27 04:42:07,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 70.57142857142857) internal successors, (494), 7 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:07,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:42:07,664 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:42:07,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 04:42:07,664 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:42:07,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:42:07,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1131133815, now seen corresponding path program 2 times [2023-08-27 04:42:07,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:42:07,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482151902] [2023-08-27 04:42:07,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:07,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:42:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:42:07,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:42:07,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482151902] [2023-08-27 04:42:07,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482151902] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:42:07,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:42:07,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 04:42:07,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812713847] [2023-08-27 04:42:07,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:42:07,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 04:42:07,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:42:07,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 04:42:07,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-27 04:42:07,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 180 [2023-08-27 04:42:07,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 103 transitions, 1263 flow. Second operand has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:07,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:42:07,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 180 [2023-08-27 04:42:07,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:42:08,245 INFO L124 PetriNetUnfolderBase]: 443/944 cut-off events. [2023-08-27 04:42:08,245 INFO L125 PetriNetUnfolderBase]: For 7358/7358 co-relation queries the response was YES. [2023-08-27 04:42:08,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5140 conditions, 944 events. 443/944 cut-off events. For 7358/7358 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5171 event pairs, 140 based on Foata normal form. 12/844 useless extension candidates. Maximal degree in co-relation 5053. Up to 735 conditions per place. [2023-08-27 04:42:08,255 INFO L140 encePairwiseOnDemand]: 172/180 looper letters, 98 selfloop transitions, 41 changer transitions 0/139 dead transitions. [2023-08-27 04:42:08,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 139 transitions, 1805 flow [2023-08-27 04:42:08,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 04:42:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 04:42:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 765 transitions. [2023-08-27 04:42:08,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2023-08-27 04:42:08,258 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 765 transitions. [2023-08-27 04:42:08,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 765 transitions. [2023-08-27 04:42:08,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:42:08,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 765 transitions. [2023-08-27 04:42:08,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 69.54545454545455) internal successors, (765), 11 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:08,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 180.0) internal successors, (2160), 12 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:08,267 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 180.0) internal successors, (2160), 12 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:08,267 INFO L175 Difference]: Start difference. First operand has 114 places, 103 transitions, 1263 flow. Second operand 11 states and 765 transitions. [2023-08-27 04:42:08,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 139 transitions, 1805 flow [2023-08-27 04:42:08,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 139 transitions, 1779 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-27 04:42:08,288 INFO L231 Difference]: Finished difference. Result has 126 places, 110 transitions, 1460 flow [2023-08-27 04:42:08,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1460, PETRI_PLACES=126, PETRI_TRANSITIONS=110} [2023-08-27 04:42:08,289 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 99 predicate places. [2023-08-27 04:42:08,289 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 110 transitions, 1460 flow [2023-08-27 04:42:08,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 64.375) internal successors, (515), 8 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:08,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:42:08,290 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:42:08,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 04:42:08,290 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:42:08,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:42:08,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1131133787, now seen corresponding path program 2 times [2023-08-27 04:42:08,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:42:08,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942481384] [2023-08-27 04:42:08,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:08,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:42:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:42:08,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:42:08,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942481384] [2023-08-27 04:42:08,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942481384] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:42:08,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:42:08,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 04:42:08,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058024532] [2023-08-27 04:42:08,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:42:08,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 04:42:08,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:42:08,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 04:42:08,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-27 04:42:08,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 180 [2023-08-27 04:42:08,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 110 transitions, 1460 flow. Second operand has 7 states, 7 states have (on average 70.57142857142857) internal successors, (494), 7 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:08,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:42:08,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 180 [2023-08-27 04:42:08,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:42:08,831 INFO L124 PetriNetUnfolderBase]: 464/977 cut-off events. [2023-08-27 04:42:08,831 INFO L125 PetriNetUnfolderBase]: For 9166/9166 co-relation queries the response was YES. [2023-08-27 04:42:08,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5779 conditions, 977 events. 464/977 cut-off events. For 9166/9166 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5316 event pairs, 156 based on Foata normal form. 15/876 useless extension candidates. Maximal degree in co-relation 5686. Up to 694 conditions per place. [2023-08-27 04:42:08,841 INFO L140 encePairwiseOnDemand]: 173/180 looper letters, 106 selfloop transitions, 39 changer transitions 0/145 dead transitions. [2023-08-27 04:42:08,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 145 transitions, 2083 flow [2023-08-27 04:42:08,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 04:42:08,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 04:42:08,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 692 transitions. [2023-08-27 04:42:08,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4271604938271605 [2023-08-27 04:42:08,843 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 692 transitions. [2023-08-27 04:42:08,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 692 transitions. [2023-08-27 04:42:08,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:42:08,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 692 transitions. [2023-08-27 04:42:08,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 76.88888888888889) internal successors, (692), 9 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:08,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:08,847 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:08,847 INFO L175 Difference]: Start difference. First operand has 126 places, 110 transitions, 1460 flow. Second operand 9 states and 692 transitions. [2023-08-27 04:42:08,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 145 transitions, 2083 flow [2023-08-27 04:42:08,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 145 transitions, 1981 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-27 04:42:08,870 INFO L231 Difference]: Finished difference. Result has 131 places, 113 transitions, 1529 flow [2023-08-27 04:42:08,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1529, PETRI_PLACES=131, PETRI_TRANSITIONS=113} [2023-08-27 04:42:08,871 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 104 predicate places. [2023-08-27 04:42:08,871 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 113 transitions, 1529 flow [2023-08-27 04:42:08,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 70.57142857142857) internal successors, (494), 7 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:08,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:42:08,871 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:42:08,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 04:42:08,872 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:42:08,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:42:08,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1706781436, now seen corresponding path program 1 times [2023-08-27 04:42:08,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:42:08,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066840698] [2023-08-27 04:42:08,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:08,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:42:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:09,108 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:42:09,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:42:09,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066840698] [2023-08-27 04:42:09,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066840698] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:42:09,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007093742] [2023-08-27 04:42:09,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:42:09,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:42:09,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:42:09,109 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 04:42:09,112 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 04:42:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:42:09,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 04:42:09,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:42:09,213 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 7 treesize of output 6 [2023-08-27 04:42:09,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 04:42:09,267 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-27 04:42:09,318 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-27 04:42:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:42:13,326 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 04:42:17,552 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_526 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_38| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_527 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_38| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_38| v_ArrVal_526) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_38| v_ArrVal_527) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| (+ 28 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_38|)))) is different from false [2023-08-27 04:42:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:42:17,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007093742] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 04:42:17,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 04:42:17,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-08-27 04:42:17,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442292297] [2023-08-27 04:42:17,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 04:42:17,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-27 04:42:17,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:42:17,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-27 04:42:17,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=238, Unknown=7, NotChecked=34, Total=380 [2023-08-27 04:42:17,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 180 [2023-08-27 04:42:17,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 113 transitions, 1529 flow. Second operand has 20 states, 20 states have (on average 61.55) internal successors, (1231), 20 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:42:17,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:42:17,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 180 [2023-08-27 04:42:17,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:42:18,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:19,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:21,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:22,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:24,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:25,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:26,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:29,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:30,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:32,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:34,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:37,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:38,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:39,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:40,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:44,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:45,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:46,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:47,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:52,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:42:54,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:43:06,752 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 04:43:21,038 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 04:43:23,043 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 04:43:25,054 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 04:43:27,058 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 04:43:29,061 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 04:43:37,311 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 04:43:39,326 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 04:43:41,331 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 04:43:43,337 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 04:43:45,347 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 04:43:47,360 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 04:43:59,427 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 04:44:01,585 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 04:44:17,782 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 04:44:19,787 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 04:44:21,796 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 04:44:23,802 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 04:44:25,811 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 04:44:27,816 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 04:44:29,822 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 04:44:31,833 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 04:44:33,850 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 04:44:35,858 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 04:44:37,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 04:44:39,986 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 04:44:41,994 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 04:44:44,007 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 04:44:46,021 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 04:44:48,032 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 04:44:50,038 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 04:44:52,049 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 04:44:54,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 04:44:56,151 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 04:44:58,156 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 04:45:00,163 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 04:45:02,169 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 04:45:04,177 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 04:45:06,182 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 04:45:08,190 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 04:45:10,228 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 04:45:12,248 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 04:45:12,297 INFO L124 PetriNetUnfolderBase]: 547/1119 cut-off events. [2023-08-27 04:45:12,297 INFO L125 PetriNetUnfolderBase]: For 12952/12952 co-relation queries the response was YES. [2023-08-27 04:45:12,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6770 conditions, 1119 events. 547/1119 cut-off events. For 12952/12952 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6329 event pairs, 44 based on Foata normal form. 75/1060 useless extension candidates. Maximal degree in co-relation 6675. Up to 243 conditions per place. [2023-08-27 04:45:12,314 INFO L140 encePairwiseOnDemand]: 171/180 looper letters, 176 selfloop transitions, 85 changer transitions 0/261 dead transitions. [2023-08-27 04:45:12,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 261 transitions, 3394 flow [2023-08-27 04:45:12,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-27 04:45:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-27 04:45:12,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1445 transitions. [2023-08-27 04:45:12,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38227513227513227 [2023-08-27 04:45:12,318 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1445 transitions. [2023-08-27 04:45:12,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1445 transitions. [2023-08-27 04:45:12,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:45:12,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1445 transitions. [2023-08-27 04:45:12,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 68.80952380952381) internal successors, (1445), 21 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:12,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 180.0) internal successors, (3960), 22 states have internal predecessors, (3960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:12,326 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 180.0) internal successors, (3960), 22 states have internal predecessors, (3960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:12,327 INFO L175 Difference]: Start difference. First operand has 131 places, 113 transitions, 1529 flow. Second operand 21 states and 1445 transitions. [2023-08-27 04:45:12,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 261 transitions, 3394 flow [2023-08-27 04:45:12,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 261 transitions, 3209 flow, removed 37 selfloop flow, removed 7 redundant places. [2023-08-27 04:45:12,362 INFO L231 Difference]: Finished difference. Result has 150 places, 132 transitions, 1884 flow [2023-08-27 04:45:12,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1884, PETRI_PLACES=150, PETRI_TRANSITIONS=132} [2023-08-27 04:45:12,362 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 123 predicate places. [2023-08-27 04:45:12,362 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 132 transitions, 1884 flow [2023-08-27 04:45:12,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 61.55) internal successors, (1231), 20 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:12,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:45:12,363 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:45:12,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-27 04:45:12,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-27 04:45:12,568 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:45:12,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:45:12,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1486362433, now seen corresponding path program 1 times [2023-08-27 04:45:12,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:45:12,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589274634] [2023-08-27 04:45:12,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:45:12,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:45:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:45:12,804 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:45:12,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:45:12,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589274634] [2023-08-27 04:45:12,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589274634] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:45:12,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143031805] [2023-08-27 04:45:12,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:45:12,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:45:12,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:45:12,806 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 04:45:12,808 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 04:45:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:45:12,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 04:45:12,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:45:12,922 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 7 treesize of output 6 [2023-08-27 04:45:12,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 04:45:12,989 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-27 04:45:13,053 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-27 04:45:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:45:18,146 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 04:45:22,323 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_596 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_596) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_598) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| 28)))) is different from false [2023-08-27 04:45:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:45:22,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143031805] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 04:45:22,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 04:45:22,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-08-27 04:45:22,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946009262] [2023-08-27 04:45:22,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 04:45:22,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 04:45:22,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:45:22,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 04:45:22,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=216, Unknown=7, NotChecked=32, Total=342 [2023-08-27 04:45:22,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 180 [2023-08-27 04:45:22,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 132 transitions, 1884 flow. Second operand has 19 states, 19 states have (on average 68.63157894736842) internal successors, (1304), 19 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:22,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:45:22,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 180 [2023-08-27 04:45:22,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:45:23,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:45:24,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:45:26,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:45:27,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:45:28,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:45:29,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:45:31,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:45:32,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:45:36,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:45:37,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:45:38,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:45:39,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:45:41,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:45:42,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:45:43,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:45:45,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:45:46,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:45:47,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 04:45:50,823 INFO L124 PetriNetUnfolderBase]: 523/1071 cut-off events. [2023-08-27 04:45:50,823 INFO L125 PetriNetUnfolderBase]: For 12028/12028 co-relation queries the response was YES. [2023-08-27 04:45:50,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6745 conditions, 1071 events. 523/1071 cut-off events. For 12028/12028 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5839 event pairs, 140 based on Foata normal form. 23/986 useless extension candidates. Maximal degree in co-relation 6644. Up to 694 conditions per place. [2023-08-27 04:45:50,833 INFO L140 encePairwiseOnDemand]: 173/180 looper letters, 137 selfloop transitions, 57 changer transitions 0/194 dead transitions. [2023-08-27 04:45:50,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 194 transitions, 2990 flow [2023-08-27 04:45:50,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 04:45:50,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 04:45:50,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 824 transitions. [2023-08-27 04:45:50,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161616161616162 [2023-08-27 04:45:50,836 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 824 transitions. [2023-08-27 04:45:50,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 824 transitions. [2023-08-27 04:45:50,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:45:50,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 824 transitions. [2023-08-27 04:45:50,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 74.9090909090909) internal successors, (824), 11 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:50,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 180.0) internal successors, (2160), 12 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:50,840 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 180.0) internal successors, (2160), 12 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:50,840 INFO L175 Difference]: Start difference. First operand has 150 places, 132 transitions, 1884 flow. Second operand 11 states and 824 transitions. [2023-08-27 04:45:50,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 194 transitions, 2990 flow [2023-08-27 04:45:50,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 194 transitions, 2634 flow, removed 120 selfloop flow, removed 10 redundant places. [2023-08-27 04:45:50,904 INFO L231 Difference]: Finished difference. Result has 155 places, 144 transitions, 1995 flow [2023-08-27 04:45:50,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1610, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1995, PETRI_PLACES=155, PETRI_TRANSITIONS=144} [2023-08-27 04:45:50,904 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 128 predicate places. [2023-08-27 04:45:50,905 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 144 transitions, 1995 flow [2023-08-27 04:45:50,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 68.63157894736842) internal successors, (1304), 19 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:50,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:45:50,906 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 04:45:50,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-27 04:45:51,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:45:51,111 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:45:51,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:45:51,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1829764471, now seen corresponding path program 1 times [2023-08-27 04:45:51,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:45:51,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277475803] [2023-08-27 04:45:51,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:45:51,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:45:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:45:51,172 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:45:51,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:45:51,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277475803] [2023-08-27 04:45:51,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277475803] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:45:51,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990016304] [2023-08-27 04:45:51,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:45:51,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:45:51,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:45:51,174 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 04:45:51,177 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 04:45:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:45:51,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-27 04:45:51,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:45:51,298 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:45:51,298 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 04:45:51,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990016304] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:45:51,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 04:45:51,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-08-27 04:45:51,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767399348] [2023-08-27 04:45:51,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:45:51,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 04:45:51,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:45:51,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 04:45:51,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-27 04:45:51,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 180 [2023-08-27 04:45:51,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 144 transitions, 1995 flow. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:51,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:45:51,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 180 [2023-08-27 04:45:51,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:45:51,520 INFO L124 PetriNetUnfolderBase]: 480/987 cut-off events. [2023-08-27 04:45:51,521 INFO L125 PetriNetUnfolderBase]: For 10055/10055 co-relation queries the response was YES. [2023-08-27 04:45:51,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6126 conditions, 987 events. 480/987 cut-off events. For 10055/10055 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5282 event pairs, 139 based on Foata normal form. 0/963 useless extension candidates. Maximal degree in co-relation 6024. Up to 683 conditions per place. [2023-08-27 04:45:51,533 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 178 selfloop transitions, 4 changer transitions 0/182 dead transitions. [2023-08-27 04:45:51,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 182 transitions, 2743 flow [2023-08-27 04:45:51,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 04:45:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 04:45:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 376 transitions. [2023-08-27 04:45:51,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2023-08-27 04:45:51,534 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 376 transitions. [2023-08-27 04:45:51,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 376 transitions. [2023-08-27 04:45:51,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:45:51,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 376 transitions. [2023-08-27 04:45:51,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:51,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:51,536 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:51,536 INFO L175 Difference]: Start difference. First operand has 155 places, 144 transitions, 1995 flow. Second operand 4 states and 376 transitions. [2023-08-27 04:45:51,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 182 transitions, 2743 flow [2023-08-27 04:45:51,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 182 transitions, 2637 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-08-27 04:45:51,569 INFO L231 Difference]: Finished difference. Result has 154 places, 143 transitions, 1905 flow [2023-08-27 04:45:51,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1905, PETRI_PLACES=154, PETRI_TRANSITIONS=143} [2023-08-27 04:45:51,571 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 127 predicate places. [2023-08-27 04:45:51,572 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 143 transitions, 1905 flow [2023-08-27 04:45:51,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:51,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:45:51,573 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 04:45:51,582 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 04:45:51,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:45:51,779 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:45:51,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:45:51,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1829764472, now seen corresponding path program 1 times [2023-08-27 04:45:51,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:45:51,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224441068] [2023-08-27 04:45:51,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:45:51,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:45:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:45:51,813 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-27 04:45:51,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:45:51,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224441068] [2023-08-27 04:45:51,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224441068] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:45:51,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:45:51,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 04:45:51,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626896600] [2023-08-27 04:45:51,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:45:51,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 04:45:51,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:45:51,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 04:45:51,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 04:45:51,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 180 [2023-08-27 04:45:51,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 143 transitions, 1905 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:51,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:45:51,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 180 [2023-08-27 04:45:51,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:45:51,991 INFO L124 PetriNetUnfolderBase]: 437/903 cut-off events. [2023-08-27 04:45:51,991 INFO L125 PetriNetUnfolderBase]: For 8705/8705 co-relation queries the response was YES. [2023-08-27 04:45:51,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5631 conditions, 903 events. 437/903 cut-off events. For 8705/8705 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4727 event pairs, 123 based on Foata normal form. 41/922 useless extension candidates. Maximal degree in co-relation 5530. Up to 647 conditions per place. [2023-08-27 04:45:52,001 INFO L140 encePairwiseOnDemand]: 176/180 looper letters, 164 selfloop transitions, 11 changer transitions 0/175 dead transitions. [2023-08-27 04:45:52,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 175 transitions, 2576 flow [2023-08-27 04:45:52,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 04:45:52,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 04:45:52,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-08-27 04:45:52,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2023-08-27 04:45:52,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-08-27 04:45:52,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-08-27 04:45:52,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:45:52,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-08-27 04:45:52,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:52,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:52,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:52,005 INFO L175 Difference]: Start difference. First operand has 154 places, 143 transitions, 1905 flow. Second operand 3 states and 280 transitions. [2023-08-27 04:45:52,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 175 transitions, 2576 flow [2023-08-27 04:45:52,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 175 transitions, 2569 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-27 04:45:52,035 INFO L231 Difference]: Finished difference. Result has 154 places, 143 transitions, 1937 flow [2023-08-27 04:45:52,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1894, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1937, PETRI_PLACES=154, PETRI_TRANSITIONS=143} [2023-08-27 04:45:52,035 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 127 predicate places. [2023-08-27 04:45:52,036 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 143 transitions, 1937 flow [2023-08-27 04:45:52,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:52,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:45:52,036 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 04:45:52,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-27 04:45:52,036 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:45:52,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:45:52,036 INFO L85 PathProgramCache]: Analyzing trace with hash -460536745, now seen corresponding path program 1 times [2023-08-27 04:45:52,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:45:52,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871419202] [2023-08-27 04:45:52,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:45:52,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:45:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:45:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:45:52,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:45:52,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871419202] [2023-08-27 04:45:52,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871419202] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:45:52,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:45:52,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 04:45:52,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116351033] [2023-08-27 04:45:52,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:45:52,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 04:45:52,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:45:52,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 04:45:52,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 04:45:52,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 180 [2023-08-27 04:45:52,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 143 transitions, 1937 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:52,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:45:52,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 180 [2023-08-27 04:45:52,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:45:52,276 INFO L124 PetriNetUnfolderBase]: 419/863 cut-off events. [2023-08-27 04:45:52,276 INFO L125 PetriNetUnfolderBase]: For 8691/8691 co-relation queries the response was YES. [2023-08-27 04:45:52,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5629 conditions, 863 events. 419/863 cut-off events. For 8691/8691 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4414 event pairs, 129 based on Foata normal form. 0/863 useless extension candidates. Maximal degree in co-relation 5528. Up to 834 conditions per place. [2023-08-27 04:45:52,284 INFO L140 encePairwiseOnDemand]: 178/180 looper letters, 153 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2023-08-27 04:45:52,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 155 transitions, 2387 flow [2023-08-27 04:45:52,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 04:45:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 04:45:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2023-08-27 04:45:52,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2023-08-27 04:45:52,286 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 272 transitions. [2023-08-27 04:45:52,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 272 transitions. [2023-08-27 04:45:52,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:45:52,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 272 transitions. [2023-08-27 04:45:52,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:52,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:52,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:52,288 INFO L175 Difference]: Start difference. First operand has 154 places, 143 transitions, 1937 flow. Second operand 3 states and 272 transitions. [2023-08-27 04:45:52,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 155 transitions, 2387 flow [2023-08-27 04:45:52,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 155 transitions, 2371 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 04:45:52,320 INFO L231 Difference]: Finished difference. Result has 154 places, 142 transitions, 1926 flow [2023-08-27 04:45:52,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1926, PETRI_PLACES=154, PETRI_TRANSITIONS=142} [2023-08-27 04:45:52,320 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 127 predicate places. [2023-08-27 04:45:52,320 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 142 transitions, 1926 flow [2023-08-27 04:45:52,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:52,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:45:52,321 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 04:45:52,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-27 04:45:52,321 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:45:52,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:45:52,321 INFO L85 PathProgramCache]: Analyzing trace with hash -460536744, now seen corresponding path program 1 times [2023-08-27 04:45:52,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:45:52,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652959325] [2023-08-27 04:45:52,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:45:52,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:45:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:45:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-27 04:45:52,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:45:52,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652959325] [2023-08-27 04:45:52,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652959325] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:45:52,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 04:45:52,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 04:45:52,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499558871] [2023-08-27 04:45:52,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:45:52,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 04:45:52,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:45:52,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 04:45:52,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 04:45:52,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 180 [2023-08-27 04:45:52,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 142 transitions, 1926 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:52,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:45:52,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 180 [2023-08-27 04:45:52,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:45:52,555 INFO L124 PetriNetUnfolderBase]: 401/823 cut-off events. [2023-08-27 04:45:52,555 INFO L125 PetriNetUnfolderBase]: For 8175/8175 co-relation queries the response was YES. [2023-08-27 04:45:52,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5401 conditions, 823 events. 401/823 cut-off events. For 8175/8175 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4161 event pairs, 93 based on Foata normal form. 22/845 useless extension candidates. Maximal degree in co-relation 5299. Up to 630 conditions per place. [2023-08-27 04:45:52,564 INFO L140 encePairwiseOnDemand]: 176/180 looper letters, 149 selfloop transitions, 14 changer transitions 0/163 dead transitions. [2023-08-27 04:45:52,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 163 transitions, 2494 flow [2023-08-27 04:45:52,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 04:45:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 04:45:52,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2023-08-27 04:45:52,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5055555555555555 [2023-08-27 04:45:52,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2023-08-27 04:45:52,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2023-08-27 04:45:52,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:45:52,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2023-08-27 04:45:52,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:52,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:52,567 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:52,567 INFO L175 Difference]: Start difference. First operand has 154 places, 142 transitions, 1926 flow. Second operand 3 states and 273 transitions. [2023-08-27 04:45:52,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 163 transitions, 2494 flow [2023-08-27 04:45:52,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 163 transitions, 2492 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 04:45:52,597 INFO L231 Difference]: Finished difference. Result has 154 places, 141 transitions, 1948 flow [2023-08-27 04:45:52,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1920, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1948, PETRI_PLACES=154, PETRI_TRANSITIONS=141} [2023-08-27 04:45:52,598 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 127 predicate places. [2023-08-27 04:45:52,598 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 141 transitions, 1948 flow [2023-08-27 04:45:52,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:45:52,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:45:52,599 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:45:52,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-27 04:45:52,599 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:45:52,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:45:52,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1801140384, now seen corresponding path program 1 times [2023-08-27 04:45:52,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:45:52,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616868623] [2023-08-27 04:45:52,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:45:52,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:45:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:45:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:45:53,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:45:53,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616868623] [2023-08-27 04:45:53,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616868623] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:45:53,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479976563] [2023-08-27 04:45:53,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:45:53,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:45:53,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:45:53,219 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 04:45:53,222 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 04:45:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:45:53,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-27 04:45:53,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:45:53,350 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 7 treesize of output 6 [2023-08-27 04:45:53,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 04:45:53,457 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-27 04:45:53,597 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 27 treesize of output 20 [2023-08-27 04:45:53,791 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 21 treesize of output 16 [2023-08-27 04:45:53,879 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:45:53,880 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 04:46:04,260 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_863 Int) (v_ArrVal_861 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_859 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_40| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_40| v_ArrVal_859) |c_~#cache~0.base|))) (or (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_861) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| v_ArrVal_863) |c_~#cache~0.offset|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_40| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset|)) (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_861)))) is different from false [2023-08-27 04:46:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:46:04,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479976563] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 04:46:04,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 04:46:04,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2023-08-27 04:46:04,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949150802] [2023-08-27 04:46:04,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 04:46:04,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-27 04:46:04,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:46:04,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-27 04:46:04,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=860, Unknown=6, NotChecked=62, Total=1122 [2023-08-27 04:46:04,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 180 [2023-08-27 04:46:04,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 141 transitions, 1948 flow. Second operand has 34 states, 34 states have (on average 51.3235294117647) internal successors, (1745), 34 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:04,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:46:04,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 180 [2023-08-27 04:46:04,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:46:07,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 [1] [2023-08-27 04:46:10,390 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 04:46:13,086 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 04:46:15,887 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 04:46:18,405 INFO L124 PetriNetUnfolderBase]: 704/1419 cut-off events. [2023-08-27 04:46:18,405 INFO L125 PetriNetUnfolderBase]: For 17622/17622 co-relation queries the response was YES. [2023-08-27 04:46:18,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9596 conditions, 1419 events. 704/1419 cut-off events. For 17622/17622 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7837 event pairs, 123 based on Foata normal form. 60/1479 useless extension candidates. Maximal degree in co-relation 9494. Up to 633 conditions per place. [2023-08-27 04:46:18,419 INFO L140 encePairwiseOnDemand]: 169/180 looper letters, 193 selfloop transitions, 188 changer transitions 0/381 dead transitions. [2023-08-27 04:46:18,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 381 transitions, 5648 flow [2023-08-27 04:46:18,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-08-27 04:46:18,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-08-27 04:46:18,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 2428 transitions. [2023-08-27 04:46:18,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30656565656565654 [2023-08-27 04:46:18,424 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 2428 transitions. [2023-08-27 04:46:18,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 2428 transitions. [2023-08-27 04:46:18,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:46:18,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 2428 transitions. [2023-08-27 04:46:18,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 55.18181818181818) internal successors, (2428), 44 states have internal predecessors, (2428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:18,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 180.0) internal successors, (8100), 45 states have internal predecessors, (8100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:18,437 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 180.0) internal successors, (8100), 45 states have internal predecessors, (8100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:18,437 INFO L175 Difference]: Start difference. First operand has 154 places, 141 transitions, 1948 flow. Second operand 44 states and 2428 transitions. [2023-08-27 04:46:18,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 381 transitions, 5648 flow [2023-08-27 04:46:18,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 381 transitions, 5614 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 04:46:18,484 INFO L231 Difference]: Finished difference. Result has 212 places, 272 transitions, 4466 flow [2023-08-27 04:46:18,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=4466, PETRI_PLACES=212, PETRI_TRANSITIONS=272} [2023-08-27 04:46:18,485 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 185 predicate places. [2023-08-27 04:46:18,485 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 272 transitions, 4466 flow [2023-08-27 04:46:18,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 51.3235294117647) internal successors, (1745), 34 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:18,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:46:18,486 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:46:18,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-27 04:46:18,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:46:18,692 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:46:18,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:46:18,692 INFO L85 PathProgramCache]: Analyzing trace with hash -886966939, now seen corresponding path program 1 times [2023-08-27 04:46:18,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:46:18,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891981900] [2023-08-27 04:46:18,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:46:18,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:46:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:46:19,154 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:46:19,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:46:19,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891981900] [2023-08-27 04:46:19,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891981900] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:46:19,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163109804] [2023-08-27 04:46:19,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:46:19,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:46:19,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:46:19,155 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 04:46:19,158 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 04:46:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:46:19,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-27 04:46:19,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:46:19,287 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 7 treesize of output 6 [2023-08-27 04:46:19,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 04:46:19,389 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-27 04:46:19,531 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-27 04:46:19,655 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 21 treesize of output 16 [2023-08-27 04:46:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:46:19,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 04:46:20,249 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:46:20,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163109804] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 04:46:20,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 04:46:20,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-27 04:46:20,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912403416] [2023-08-27 04:46:20,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 04:46:20,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-27 04:46:20,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:46:20,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-27 04:46:20,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=751, Unknown=2, NotChecked=0, Total=930 [2023-08-27 04:46:20,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 180 [2023-08-27 04:46:20,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 272 transitions, 4466 flow. Second operand has 31 states, 31 states have (on average 57.45161290322581) internal successors, (1781), 31 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:20,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:46:20,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 180 [2023-08-27 04:46:20,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:46:20,820 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| 1)) (.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_939 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (v_ArrVal_943 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_939) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_943) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| (+ 28 |c_~#cache~0.offset|)))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_940 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_943 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_940)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_943) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40|) 2147483647))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (exists ((v_ArrVal_943 Int)) (= (store .cse0 0 v_ArrVal_943) .cse1)) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (exists ((v_ArrVal_940 Int)) (= .cse1 (store .cse0 0 v_ArrVal_940))))) is different from false [2023-08-27 04:46:21,480 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| 1)) (.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_939 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (v_ArrVal_943 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_939) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_943) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| (+ 28 |c_~#cache~0.offset|)))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_940 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_943 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_940)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_943) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40|) 2147483647))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_943 Int)) (= (store .cse0 0 v_ArrVal_943) .cse1)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (exists ((v_ArrVal_940 Int)) (= .cse1 (store .cse0 0 v_ArrVal_940))))) is different from false [2023-08-27 04:46:22,084 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_939 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (v_ArrVal_943 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_939) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_943) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| (+ 28 |c_~#cache~0.offset|)))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_940 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_943 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_940)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_943) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40|) 2147483647))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_943 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_943) (select |c_#memory_int| 1))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) is different from false [2023-08-27 04:46:22,448 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_939 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (v_ArrVal_943 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_939) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_943) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| (+ 28 |c_~#cache~0.offset|)))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_940 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_943 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| (+ .cse0 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_940)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_943) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40|) 2147483647))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_943 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_943) (select |c_#memory_int| 1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_943 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| (+ .cse0 |c_~#cache~0.offset|)) (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_943)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40|) 2147483647))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2023-08-27 04:46:24,000 INFO L124 PetriNetUnfolderBase]: 1055/2138 cut-off events. [2023-08-27 04:46:24,000 INFO L125 PetriNetUnfolderBase]: For 31507/31507 co-relation queries the response was YES. [2023-08-27 04:46:24,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15697 conditions, 2138 events. 1055/2138 cut-off events. For 31507/31507 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 13169 event pairs, 274 based on Foata normal form. 44/2182 useless extension candidates. Maximal degree in co-relation 15577. Up to 1425 conditions per place. [2023-08-27 04:46:24,019 INFO L140 encePairwiseOnDemand]: 164/180 looper letters, 345 selfloop transitions, 184 changer transitions 10/539 dead transitions. [2023-08-27 04:46:24,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 539 transitions, 9050 flow [2023-08-27 04:46:24,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-08-27 04:46:24,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-08-27 04:46:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2300 transitions. [2023-08-27 04:46:24,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34534534534534533 [2023-08-27 04:46:24,024 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 2300 transitions. [2023-08-27 04:46:24,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 2300 transitions. [2023-08-27 04:46:24,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:46:24,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2300 transitions. [2023-08-27 04:46:24,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 62.16216216216216) internal successors, (2300), 37 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:24,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 180.0) internal successors, (6840), 38 states have internal predecessors, (6840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:24,035 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 180.0) internal successors, (6840), 38 states have internal predecessors, (6840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:24,035 INFO L175 Difference]: Start difference. First operand has 212 places, 272 transitions, 4466 flow. Second operand 37 states and 2300 transitions. [2023-08-27 04:46:24,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 539 transitions, 9050 flow [2023-08-27 04:46:24,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 539 transitions, 8682 flow, removed 70 selfloop flow, removed 13 redundant places. [2023-08-27 04:46:24,150 INFO L231 Difference]: Finished difference. Result has 253 places, 428 transitions, 7121 flow [2023-08-27 04:46:24,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=4191, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=7121, PETRI_PLACES=253, PETRI_TRANSITIONS=428} [2023-08-27 04:46:24,151 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 226 predicate places. [2023-08-27 04:46:24,151 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 428 transitions, 7121 flow [2023-08-27 04:46:24,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 57.45161290322581) internal successors, (1781), 31 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:24,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:46:24,152 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:46:24,157 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 04:46:24,357 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,SelfDestructingSolverStorable24 [2023-08-27 04:46:24,358 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:46:24,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:46:24,358 INFO L85 PathProgramCache]: Analyzing trace with hash -575200273, now seen corresponding path program 2 times [2023-08-27 04:46:24,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:46:24,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169856834] [2023-08-27 04:46:24,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:46:24,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:46:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:46:24,826 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:46:24,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:46:24,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169856834] [2023-08-27 04:46:24,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169856834] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:46:24,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434628171] [2023-08-27 04:46:24,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 04:46:24,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:46:24,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:46:24,829 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 04:46:24,858 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 04:46:24,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 04:46:24,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 04:46:24,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-27 04:46:24,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:46:24,981 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 7 treesize of output 6 [2023-08-27 04:46:25,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 04:46:25,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 13 treesize of output 15 [2023-08-27 04:46:25,253 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-27 04:46:25,318 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 21 treesize of output 16 [2023-08-27 04:46:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:46:25,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 04:46:25,730 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42| Int) (v_ArrVal_1023 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1019) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1023) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42| (+ 28 |c_~#cache~0.offset|)))) is different from false [2023-08-27 04:46:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:46:25,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434628171] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 04:46:25,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 04:46:25,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2023-08-27 04:46:25,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917083063] [2023-08-27 04:46:25,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 04:46:25,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-27 04:46:25,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:46:25,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-27 04:46:25,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=660, Unknown=1, NotChecked=54, Total=870 [2023-08-27 04:46:25,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 180 [2023-08-27 04:46:25,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 428 transitions, 7121 flow. Second operand has 30 states, 30 states have (on average 51.5) internal successors, (1545), 30 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:25,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:46:25,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 180 [2023-08-27 04:46:25,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:46:36,287 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 04:46:37,070 INFO L124 PetriNetUnfolderBase]: 1497/3068 cut-off events. [2023-08-27 04:46:37,070 INFO L125 PetriNetUnfolderBase]: For 65437/65437 co-relation queries the response was YES. [2023-08-27 04:46:37,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25457 conditions, 3068 events. 1497/3068 cut-off events. For 65437/65437 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 21039 event pairs, 366 based on Foata normal form. 105/3173 useless extension candidates. Maximal degree in co-relation 25321. Up to 2059 conditions per place. [2023-08-27 04:46:37,103 INFO L140 encePairwiseOnDemand]: 165/180 looper letters, 480 selfloop transitions, 324 changer transitions 14/818 dead transitions. [2023-08-27 04:46:37,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 818 transitions, 14107 flow [2023-08-27 04:46:37,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2023-08-27 04:46:37,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2023-08-27 04:46:37,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 4676 transitions. [2023-08-27 04:46:37,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3020671834625323 [2023-08-27 04:46:37,112 INFO L72 ComplementDD]: Start complementDD. Operand 86 states and 4676 transitions. [2023-08-27 04:46:37,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 4676 transitions. [2023-08-27 04:46:37,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:46:37,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 86 states and 4676 transitions. [2023-08-27 04:46:37,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 87 states, 86 states have (on average 54.372093023255815) internal successors, (4676), 86 states have internal predecessors, (4676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:37,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 87 states, 87 states have (on average 180.0) internal successors, (15660), 87 states have internal predecessors, (15660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:37,136 INFO L81 ComplementDD]: Finished complementDD. Result has 87 states, 87 states have (on average 180.0) internal successors, (15660), 87 states have internal predecessors, (15660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:37,136 INFO L175 Difference]: Start difference. First operand has 253 places, 428 transitions, 7121 flow. Second operand 86 states and 4676 transitions. [2023-08-27 04:46:37,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 818 transitions, 14107 flow [2023-08-27 04:46:37,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 818 transitions, 13704 flow, removed 192 selfloop flow, removed 3 redundant places. [2023-08-27 04:46:37,397 INFO L231 Difference]: Finished difference. Result has 376 places, 676 transitions, 11479 flow [2023-08-27 04:46:37,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=6724, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=11479, PETRI_PLACES=376, PETRI_TRANSITIONS=676} [2023-08-27 04:46:37,398 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 349 predicate places. [2023-08-27 04:46:37,398 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 676 transitions, 11479 flow [2023-08-27 04:46:37,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 51.5) internal successors, (1545), 30 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:37,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:46:37,398 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:46:37,404 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 04:46:37,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-27 04:46:37,604 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:46:37,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:46:37,604 INFO L85 PathProgramCache]: Analyzing trace with hash -970083829, now seen corresponding path program 3 times [2023-08-27 04:46:37,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:46:37,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920152642] [2023-08-27 04:46:37,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:46:37,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:46:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:46:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:46:38,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:46:38,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920152642] [2023-08-27 04:46:38,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920152642] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:46:38,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069298177] [2023-08-27 04:46:38,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 04:46:38,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:46:38,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:46:38,029 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 04:46:38,034 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 04:46:38,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-27 04:46:38,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 04:46:38,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-27 04:46:38,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:46:38,163 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 7 treesize of output 6 [2023-08-27 04:46:38,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 04:46:38,260 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-27 04:46:38,391 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-27 04:46:38,522 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 21 treesize of output 16 [2023-08-27 04:46:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:46:38,594 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 04:46:39,097 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_44| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int) (v_ArrVal_1102 Int) (v_ArrVal_1099 (Array Int Int))) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_44| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_43| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1099) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1102) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_44|) 2147483647))) is different from false [2023-08-27 04:46:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:46:39,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069298177] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 04:46:39,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 04:46:39,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-27 04:46:39,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112302019] [2023-08-27 04:46:39,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 04:46:39,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-27 04:46:39,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:46:39,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-27 04:46:39,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=705, Unknown=1, NotChecked=56, Total=930 [2023-08-27 04:46:39,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 180 [2023-08-27 04:46:39,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 676 transitions, 11479 flow. Second operand has 31 states, 31 states have (on average 57.45161290322581) internal successors, (1781), 31 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:39,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:46:39,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 180 [2023-08-27 04:46:39,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:46:46,427 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 04:46:48,186 INFO L124 PetriNetUnfolderBase]: 2214/4540 cut-off events. [2023-08-27 04:46:48,186 INFO L125 PetriNetUnfolderBase]: For 159683/159683 co-relation queries the response was YES. [2023-08-27 04:46:48,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42653 conditions, 4540 events. 2214/4540 cut-off events. For 159683/159683 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 34164 event pairs, 559 based on Foata normal form. 82/4622 useless extension candidates. Maximal degree in co-relation 42475. Up to 2777 conditions per place. [2023-08-27 04:46:48,248 INFO L140 encePairwiseOnDemand]: 166/180 looper letters, 734 selfloop transitions, 470 changer transitions 6/1210 dead transitions. [2023-08-27 04:46:48,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 1210 transitions, 23221 flow [2023-08-27 04:46:48,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-08-27 04:46:48,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2023-08-27 04:46:48,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 4110 transitions. [2023-08-27 04:46:48,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3407960199004975 [2023-08-27 04:46:48,254 INFO L72 ComplementDD]: Start complementDD. Operand 67 states and 4110 transitions. [2023-08-27 04:46:48,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 4110 transitions. [2023-08-27 04:46:48,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:46:48,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 67 states and 4110 transitions. [2023-08-27 04:46:48,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 68 states, 67 states have (on average 61.343283582089555) internal successors, (4110), 67 states have internal predecessors, (4110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:48,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 68 states, 68 states have (on average 180.0) internal successors, (12240), 68 states have internal predecessors, (12240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:48,272 INFO L81 ComplementDD]: Finished complementDD. Result has 68 states, 68 states have (on average 180.0) internal successors, (12240), 68 states have internal predecessors, (12240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:48,272 INFO L175 Difference]: Start difference. First operand has 376 places, 676 transitions, 11479 flow. Second operand 67 states and 4110 transitions. [2023-08-27 04:46:48,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 1210 transitions, 23221 flow [2023-08-27 04:46:49,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 1210 transitions, 21732 flow, removed 626 selfloop flow, removed 13 redundant places. [2023-08-27 04:46:49,157 INFO L231 Difference]: Finished difference. Result has 473 places, 1042 transitions, 18441 flow [2023-08-27 04:46:49,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=10305, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=18441, PETRI_PLACES=473, PETRI_TRANSITIONS=1042} [2023-08-27 04:46:49,158 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 446 predicate places. [2023-08-27 04:46:49,158 INFO L495 AbstractCegarLoop]: Abstraction has has 473 places, 1042 transitions, 18441 flow [2023-08-27 04:46:49,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 57.45161290322581) internal successors, (1781), 31 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:49,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:46:49,158 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:46:49,163 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 04:46:49,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-27 04:46:49,359 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:46:49,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:46:49,359 INFO L85 PathProgramCache]: Analyzing trace with hash -462019729, now seen corresponding path program 4 times [2023-08-27 04:46:49,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:46:49,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204898109] [2023-08-27 04:46:49,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:46:49,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:46:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:46:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:46:49,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:46:49,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204898109] [2023-08-27 04:46:49,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204898109] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:46:49,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553546903] [2023-08-27 04:46:49,819 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 04:46:49,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:46:49,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:46:49,821 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 04:46:49,851 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 04:46:49,966 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 04:46:49,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 04:46:49,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-27 04:46:49,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:46:49,977 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 7 treesize of output 6 [2023-08-27 04:46:50,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 04:46:50,083 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-27 04:46:50,234 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-27 04:46:50,374 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 21 treesize of output 16 [2023-08-27 04:46:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:46:50,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 04:46:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:46:52,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553546903] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 04:46:52,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 04:46:52,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-27 04:46:52,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249709225] [2023-08-27 04:46:52,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 04:46:52,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-27 04:46:52,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:46:52,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-27 04:46:52,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=747, Unknown=4, NotChecked=0, Total=930 [2023-08-27 04:46:52,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 180 [2023-08-27 04:46:52,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 1042 transitions, 18441 flow. Second operand has 31 states, 31 states have (on average 57.45161290322581) internal successors, (1781), 31 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:46:52,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:46:52,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 180 [2023-08-27 04:46:52,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:46:53,479 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse1 (select |c_#memory_int| 1))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1181 Int)) (= (store .cse0 0 v_ArrVal_1181) .cse1)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46| Int) (v_ArrVal_1182 Int) (v_ArrVal_1179 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1179) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1182) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46|) 2147483647))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1182 Int)) (= (store .cse0 0 v_ArrVal_1182) .cse1)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46| Int) (v_ArrVal_1182 Int) (v_ArrVal_1181 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1182) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46|) 2147483647))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2023-08-27 04:46:56,169 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46| Int) (v_ArrVal_1182 Int) (v_ArrVal_1179 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1179) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1182) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46|) 2147483647))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1182 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1182) (select |c_#memory_int| 1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46| Int) (v_ArrVal_1182 Int) (v_ArrVal_1181 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1182) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46|) 2147483647))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) is different from false [2023-08-27 04:46:57,531 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46| Int) (v_ArrVal_1182 Int) (v_ArrVal_1179 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1179) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1182) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46|) 2147483647))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1182 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1182) (select |c_#memory_int| 1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46| Int) (v_ArrVal_1182 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46| (+ .cse0 |c_~#cache~0.offset|)) (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1182)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46|) 2147483647))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46| Int) (v_ArrVal_1182 Int) (v_ArrVal_1181 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46| (+ .cse0 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1182) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_46|) 2147483647))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2023-08-27 04:47:01,146 INFO L124 PetriNetUnfolderBase]: 2692/5499 cut-off events. [2023-08-27 04:47:01,146 INFO L125 PetriNetUnfolderBase]: For 278787/278787 co-relation queries the response was YES. [2023-08-27 04:47:01,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56231 conditions, 5499 events. 2692/5499 cut-off events. For 278787/278787 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 42594 event pairs, 836 based on Foata normal form. 80/5579 useless extension candidates. Maximal degree in co-relation 56010. Up to 4479 conditions per place. [2023-08-27 04:47:01,227 INFO L140 encePairwiseOnDemand]: 163/180 looper letters, 1110 selfloop transitions, 278 changer transitions 14/1402 dead transitions. [2023-08-27 04:47:01,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 1402 transitions, 28379 flow [2023-08-27 04:47:01,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-08-27 04:47:01,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-08-27 04:47:01,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 3181 transitions. [2023-08-27 04:47:01,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3465141612200436 [2023-08-27 04:47:01,232 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 3181 transitions. [2023-08-27 04:47:01,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 3181 transitions. [2023-08-27 04:47:01,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:47:01,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 3181 transitions. [2023-08-27 04:47:01,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 62.372549019607845) internal successors, (3181), 51 states have internal predecessors, (3181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:47:01,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 180.0) internal successors, (9360), 52 states have internal predecessors, (9360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:47:01,246 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 180.0) internal successors, (9360), 52 states have internal predecessors, (9360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:47:01,246 INFO L175 Difference]: Start difference. First operand has 473 places, 1042 transitions, 18441 flow. Second operand 51 states and 3181 transitions. [2023-08-27 04:47:01,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 1402 transitions, 28379 flow [2023-08-27 04:47:02,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 1402 transitions, 26996 flow, removed 641 selfloop flow, removed 9 redundant places. [2023-08-27 04:47:02,847 INFO L231 Difference]: Finished difference. Result has 543 places, 1254 transitions, 22059 flow [2023-08-27 04:47:02,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=17079, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1042, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=909, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=22059, PETRI_PLACES=543, PETRI_TRANSITIONS=1254} [2023-08-27 04:47:02,848 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 516 predicate places. [2023-08-27 04:47:02,848 INFO L495 AbstractCegarLoop]: Abstraction has has 543 places, 1254 transitions, 22059 flow [2023-08-27 04:47:02,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 57.45161290322581) internal successors, (1781), 31 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:47:02,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:47:02,848 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:47:02,854 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 04:47:03,054 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,SelfDestructingSolverStorable27 [2023-08-27 04:47:03,054 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:47:03,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:47:03,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2021789073, now seen corresponding path program 5 times [2023-08-27 04:47:03,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:47:03,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740045730] [2023-08-27 04:47:03,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:47:03,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:47:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:47:03,504 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:47:03,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:47:03,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740045730] [2023-08-27 04:47:03,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740045730] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:47:03,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523008811] [2023-08-27 04:47:03,504 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-27 04:47:03,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:47:03,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:47:03,505 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 04:47:03,507 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 04:47:03,698 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-27 04:47:03,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 04:47:03,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-27 04:47:03,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:47:03,738 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 04:47:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-27 04:47:03,772 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 04:47:03,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523008811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 04:47:03,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 04:47:03,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 14 [2023-08-27 04:47:03,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418485552] [2023-08-27 04:47:03,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 04:47:03,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 04:47:03,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:47:03,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 04:47:03,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-08-27 04:47:03,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 180 [2023-08-27 04:47:03,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 1254 transitions, 22059 flow. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:47:03,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:47:03,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 180 [2023-08-27 04:47:03,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:47:06,088 INFO L124 PetriNetUnfolderBase]: 2617/5373 cut-off events. [2023-08-27 04:47:06,088 INFO L125 PetriNetUnfolderBase]: For 318544/318544 co-relation queries the response was YES. [2023-08-27 04:47:06,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63159 conditions, 5373 events. 2617/5373 cut-off events. For 318544/318544 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 41795 event pairs, 769 based on Foata normal form. 4/5377 useless extension candidates. Maximal degree in co-relation 62910. Up to 4128 conditions per place. [2023-08-27 04:47:06,183 INFO L140 encePairwiseOnDemand]: 173/180 looper letters, 1192 selfloop transitions, 124 changer transitions 0/1316 dead transitions. [2023-08-27 04:47:06,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 1316 transitions, 26218 flow [2023-08-27 04:47:06,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 04:47:06,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 04:47:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 451 transitions. [2023-08-27 04:47:06,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41759259259259257 [2023-08-27 04:47:06,185 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 451 transitions. [2023-08-27 04:47:06,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 451 transitions. [2023-08-27 04:47:06,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:47:06,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 451 transitions. [2023-08-27 04:47:06,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:47:06,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:47:06,187 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:47:06,187 INFO L175 Difference]: Start difference. First operand has 543 places, 1254 transitions, 22059 flow. Second operand 6 states and 451 transitions. [2023-08-27 04:47:06,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 1316 transitions, 26218 flow [2023-08-27 04:47:08,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 1316 transitions, 24303 flow, removed 891 selfloop flow, removed 12 redundant places. [2023-08-27 04:47:08,811 INFO L231 Difference]: Finished difference. Result has 537 places, 1204 transitions, 19685 flow [2023-08-27 04:47:08,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=19097, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1071, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=19685, PETRI_PLACES=537, PETRI_TRANSITIONS=1204} [2023-08-27 04:47:08,813 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 510 predicate places. [2023-08-27 04:47:08,813 INFO L495 AbstractCegarLoop]: Abstraction has has 537 places, 1204 transitions, 19685 flow [2023-08-27 04:47:08,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:47:08,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:47:08,813 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:47:08,819 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 04:47:09,019 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,SelfDestructingSolverStorable28 [2023-08-27 04:47:09,019 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:47:09,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:47:09,020 INFO L85 PathProgramCache]: Analyzing trace with hash 895614131, now seen corresponding path program 6 times [2023-08-27 04:47:09,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:47:09,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051711662] [2023-08-27 04:47:09,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:47:09,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:47:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:47:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:47:09,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:47:09,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051711662] [2023-08-27 04:47:09,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051711662] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:47:09,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319751560] [2023-08-27 04:47:09,432 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-27 04:47:09,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:47:09,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:47:09,433 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 04:47:09,456 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 04:47:09,569 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-27 04:47:09,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 04:47:09,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-27 04:47:09,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:47:09,582 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 7 treesize of output 6 [2023-08-27 04:47:09,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 04:47:09,666 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-27 04:47:09,813 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-27 04:47:09,936 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-27 04:47:10,002 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:47:10,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 04:47:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:47:16,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319751560] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 04:47:16,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 04:47:16,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-08-27 04:47:16,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180704340] [2023-08-27 04:47:16,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 04:47:16,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-27 04:47:16,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:47:16,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-27 04:47:16,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=797, Unknown=7, NotChecked=0, Total=992 [2023-08-27 04:47:16,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 180 [2023-08-27 04:47:16,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 1204 transitions, 19685 flow. Second operand has 32 states, 32 states have (on average 57.40625) internal successors, (1837), 32 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:47:16,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:47:16,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 180 [2023-08-27 04:47:16,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:47:21,138 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 ((as const (Array Int Int)) 0)) (.cse3 (select |c_#memory_int| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1338 Int) (v_ArrVal_1337 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1337)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1338) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| .cse1))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1337 Int)) (= (store .cse2 0 v_ArrVal_1337) .cse3)) (exists ((v_ArrVal_1338 Int)) (= (store .cse2 0 v_ArrVal_1338) .cse3)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1338 Int) (v_ArrVal_1337 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1337)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1338) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| .cse1))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1335 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_1338 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1335) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1338) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2023-08-27 04:47:28,107 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 04:47:28,907 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1338 Int) (v_ArrVal_1337 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1337)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1338) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| .cse1))) (exists ((v_ArrVal_1337 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1337) (select |c_#memory_int| 1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1338 Int) (v_ArrVal_1337 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1337)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1338) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| .cse1))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1335 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_1338 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1335) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1338) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) is different from false [2023-08-27 04:47:31,127 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 ((as const (Array Int Int)) 0)) (.cse3 (select |c_#memory_int| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1338 Int) (v_ArrVal_1337 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1337)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1338) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| .cse1))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1337 Int)) (= (store .cse2 0 v_ArrVal_1337) .cse3)) (exists ((v_ArrVal_1338 Int)) (= (store .cse2 0 v_ArrVal_1338) .cse3)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1338 Int) (v_ArrVal_1337 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1337)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1338) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| .cse1))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1335 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_1338 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1335) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1338) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2023-08-27 04:47:40,770 INFO L124 PetriNetUnfolderBase]: 3545/7266 cut-off events. [2023-08-27 04:47:40,770 INFO L125 PetriNetUnfolderBase]: For 515120/515120 co-relation queries the response was YES. [2023-08-27 04:47:40,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84279 conditions, 7266 events. 3545/7266 cut-off events. For 515120/515120 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 58350 event pairs, 799 based on Foata normal form. 99/7365 useless extension candidates. Maximal degree in co-relation 84032. Up to 4613 conditions per place. [2023-08-27 04:47:40,893 INFO L140 encePairwiseOnDemand]: 163/180 looper letters, 1179 selfloop transitions, 639 changer transitions 32/1850 dead transitions. [2023-08-27 04:47:40,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 1850 transitions, 36797 flow [2023-08-27 04:47:40,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-08-27 04:47:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2023-08-27 04:47:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 4047 transitions. [2023-08-27 04:47:40,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3458974358974359 [2023-08-27 04:47:40,897 INFO L72 ComplementDD]: Start complementDD. Operand 65 states and 4047 transitions. [2023-08-27 04:47:40,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 4047 transitions. [2023-08-27 04:47:40,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:47:40,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 65 states and 4047 transitions. [2023-08-27 04:47:40,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 66 states, 65 states have (on average 62.261538461538464) internal successors, (4047), 65 states have internal predecessors, (4047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:47:40,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 66 states, 66 states have (on average 180.0) internal successors, (11880), 66 states have internal predecessors, (11880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:47:40,912 INFO L81 ComplementDD]: Finished complementDD. Result has 66 states, 66 states have (on average 180.0) internal successors, (11880), 66 states have internal predecessors, (11880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:47:40,913 INFO L175 Difference]: Start difference. First operand has 537 places, 1204 transitions, 19685 flow. Second operand 65 states and 4047 transitions. [2023-08-27 04:47:40,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 1850 transitions, 36797 flow [2023-08-27 04:47:44,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 1850 transitions, 36283 flow, removed 28 selfloop flow, removed 7 redundant places. [2023-08-27 04:47:44,527 INFO L231 Difference]: Finished difference. Result has 633 places, 1630 transitions, 29604 flow [2023-08-27 04:47:44,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=19316, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=300, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=828, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=29604, PETRI_PLACES=633, PETRI_TRANSITIONS=1630} [2023-08-27 04:47:44,529 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 606 predicate places. [2023-08-27 04:47:44,529 INFO L495 AbstractCegarLoop]: Abstraction has has 633 places, 1630 transitions, 29604 flow [2023-08-27 04:47:44,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 57.40625) internal successors, (1837), 32 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:47:44,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:47:44,529 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:47:44,534 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 04:47:44,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:47:44,730 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:47:44,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:47:44,730 INFO L85 PathProgramCache]: Analyzing trace with hash 742786301, now seen corresponding path program 7 times [2023-08-27 04:47:44,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:47:44,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085272730] [2023-08-27 04:47:44,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:47:44,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:47:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:47:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:47:45,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:47:45,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085272730] [2023-08-27 04:47:45,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085272730] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:47:45,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100542036] [2023-08-27 04:47:45,192 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-27 04:47:45,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:47:45,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:47:45,197 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 04:47:45,198 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 04:47:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:47:45,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-27 04:47:45,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:47:45,367 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 7 treesize of output 6 [2023-08-27 04:47:45,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 04:47:45,481 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-27 04:47:45,632 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-27 04:47:45,785 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 21 treesize of output 16 [2023-08-27 04:47:45,848 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:47:45,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 04:47:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:47:49,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100542036] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 04:47:49,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 04:47:49,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-08-27 04:47:49,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252950439] [2023-08-27 04:47:49,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 04:47:49,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-27 04:47:49,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:47:49,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-27 04:47:49,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=802, Unknown=7, NotChecked=0, Total=992 [2023-08-27 04:47:49,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 180 [2023-08-27 04:47:49,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 1630 transitions, 29604 flow. Second operand has 32 states, 32 states have (on average 57.40625) internal successors, (1837), 32 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:47:49,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:47:49,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 180 [2023-08-27 04:47:49,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:47:51,374 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1417 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1417) (select |c_#memory_int| 1))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (forall ((v_ArrVal_1419 Int) (v_ArrVal_1415 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_46| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_1415) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647))) (forall ((v_ArrVal_1419 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_1417 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| .cse0) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1417)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647))) (forall ((v_ArrVal_1419 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_1417 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1417)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| .cse0))))) is different from false [2023-08-27 04:47:51,409 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (exists ((v_ArrVal_1419 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1419))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1419 Int) (v_ArrVal_1415 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_46| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_1415) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647))) (forall ((v_ArrVal_1419 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_1417 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| .cse0) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1417)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647))) (forall ((v_ArrVal_1419 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_1417 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1417)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| .cse0))) (forall ((v_ArrVal_1419 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| .cse0) (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1419)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647))))) is different from false [2023-08-27 04:47:56,304 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= .cse0 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= .cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((v_ArrVal_1419 Int) (v_ArrVal_1415 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_46| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_1415) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|))) is different from false [2023-08-27 04:47:56,536 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (exists ((v_ArrVal_1419 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1419))) (= |c_~#cache~0.offset| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((v_ArrVal_1419 Int) (v_ArrVal_1415 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_46| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_1415) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647))) (forall ((v_ArrVal_1419 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_1417 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| .cse0) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1417)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647))) (forall ((v_ArrVal_1419 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_1417 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1417)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| .cse0))) (forall ((v_ArrVal_1419 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| .cse0) (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1419)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647))))) is different from false [2023-08-27 04:47:58,623 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 04:48:04,397 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((v_ArrVal_1419 Int) (v_ArrVal_1415 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_46| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_1415) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647))) (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) is different from false [2023-08-27 04:48:07,656 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 04:48:11,839 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 04:48:17,146 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1419 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| (+ .cse0 |c_~#cache~0.offset|)) (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1419)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647))) (exists ((v_ArrVal_1419 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1419))) (= |c_~#cache~0.offset| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((v_ArrVal_1419 Int) (v_ArrVal_1415 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_46| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_1415) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647))) (forall ((v_ArrVal_1419 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_1417 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1417)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1419) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| (+ .cse0 28 |c_~#cache~0.offset|)))))) is different from false [2023-08-27 04:48:26,281 INFO L124 PetriNetUnfolderBase]: 4718/9856 cut-off events. [2023-08-27 04:48:26,282 INFO L125 PetriNetUnfolderBase]: For 986748/986748 co-relation queries the response was YES. [2023-08-27 04:48:26,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137877 conditions, 9856 events. 4718/9856 cut-off events. For 986748/986748 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 85935 event pairs, 1030 based on Foata normal form. 79/9935 useless extension candidates. Maximal degree in co-relation 137594. Up to 5921 conditions per place. [2023-08-27 04:48:26,559 INFO L140 encePairwiseOnDemand]: 163/180 looper letters, 1609 selfloop transitions, 1071 changer transitions 21/2701 dead transitions. [2023-08-27 04:48:26,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 718 places, 2701 transitions, 59217 flow [2023-08-27 04:48:26,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-08-27 04:48:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2023-08-27 04:48:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 5293 transitions. [2023-08-27 04:48:26,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3379948914431673 [2023-08-27 04:48:26,565 INFO L72 ComplementDD]: Start complementDD. Operand 87 states and 5293 transitions. [2023-08-27 04:48:26,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 5293 transitions. [2023-08-27 04:48:26,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:48:26,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 87 states and 5293 transitions. [2023-08-27 04:48:26,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 88 states, 87 states have (on average 60.839080459770116) internal successors, (5293), 87 states have internal predecessors, (5293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:48:26,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 88 states, 88 states have (on average 180.0) internal successors, (15840), 88 states have internal predecessors, (15840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:48:26,583 INFO L81 ComplementDD]: Finished complementDD. Result has 88 states, 88 states have (on average 180.0) internal successors, (15840), 88 states have internal predecessors, (15840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:48:26,584 INFO L175 Difference]: Start difference. First operand has 633 places, 1630 transitions, 29604 flow. Second operand 87 states and 5293 transitions. [2023-08-27 04:48:26,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 718 places, 2701 transitions, 59217 flow [2023-08-27 04:48:35,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 710 places, 2701 transitions, 55680 flow, removed 1696 selfloop flow, removed 8 redundant places. [2023-08-27 04:48:35,414 INFO L231 Difference]: Finished difference. Result has 759 places, 2416 transitions, 46955 flow [2023-08-27 04:48:35,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=27263, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=455, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=959, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=46955, PETRI_PLACES=759, PETRI_TRANSITIONS=2416} [2023-08-27 04:48:35,416 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 732 predicate places. [2023-08-27 04:48:35,416 INFO L495 AbstractCegarLoop]: Abstraction has has 759 places, 2416 transitions, 46955 flow [2023-08-27 04:48:35,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 57.40625) internal successors, (1837), 32 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:48:35,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:48:35,416 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:48:35,422 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 04:48:35,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:48:35,622 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:48:35,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:48:35,623 INFO L85 PathProgramCache]: Analyzing trace with hash -545113369, now seen corresponding path program 8 times [2023-08-27 04:48:35,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:48:35,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458175183] [2023-08-27 04:48:35,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:48:35,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:48:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:48:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:48:35,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:48:35,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458175183] [2023-08-27 04:48:35,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458175183] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:48:35,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123786498] [2023-08-27 04:48:35,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 04:48:35,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:48:35,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:48:35,986 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 04:48:35,987 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 04:48:36,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 04:48:36,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 04:48:36,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-27 04:48:36,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:48:36,118 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 7 treesize of output 6 [2023-08-27 04:48:36,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 04:48:36,212 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-27 04:48:36,360 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-27 04:48:36,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 21 treesize of output 16 [2023-08-27 04:48:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:48:36,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 04:48:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:48:38,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123786498] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 04:48:38,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 04:48:38,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-27 04:48:38,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124195394] [2023-08-27 04:48:38,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 04:48:38,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-27 04:48:38,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:48:38,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-27 04:48:38,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=775, Unknown=4, NotChecked=0, Total=930 [2023-08-27 04:48:39,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 180 [2023-08-27 04:48:39,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 759 places, 2416 transitions, 46955 flow. Second operand has 31 states, 31 states have (on average 57.45161290322581) internal successors, (1781), 31 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:48:39,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:48:39,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 180 [2023-08-27 04:48:39,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:48:39,849 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 (+ 28 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (v_ArrVal_1498 Int) (v_ArrVal_1495 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_47| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| .cse0) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_1495) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1498) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|) 2147483647))) (forall ((v_ArrVal_1498 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int)) (or (< (select (store .cse1 |c_~#cache~0.offset| v_ArrVal_1498) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| .cse2))) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1498 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1496)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1498) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| .cse2))) (forall ((v_ArrVal_1498 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int)) (or (< (select (store .cse1 |c_~#cache~0.offset| v_ArrVal_1498) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| .cse0))))) is different from false [2023-08-27 04:48:53,784 INFO L124 PetriNetUnfolderBase]: 5596/11700 cut-off events. [2023-08-27 04:48:53,784 INFO L125 PetriNetUnfolderBase]: For 1682326/1682326 co-relation queries the response was YES. [2023-08-27 04:48:54,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189166 conditions, 11700 events. 5596/11700 cut-off events. For 1682326/1682326 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 105729 event pairs, 1584 based on Foata normal form. 79/11779 useless extension candidates. Maximal degree in co-relation 188834. Up to 8716 conditions per place. [2023-08-27 04:48:54,186 INFO L140 encePairwiseOnDemand]: 166/180 looper letters, 2193 selfloop transitions, 966 changer transitions 7/3166 dead transitions. [2023-08-27 04:48:54,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 814 places, 3166 transitions, 73857 flow [2023-08-27 04:48:54,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-08-27 04:48:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2023-08-27 04:48:54,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 3440 transitions. [2023-08-27 04:48:54,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3412698412698413 [2023-08-27 04:48:54,190 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 3440 transitions. [2023-08-27 04:48:54,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 3440 transitions. [2023-08-27 04:48:54,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:48:54,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 3440 transitions. [2023-08-27 04:48:54,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 61.42857142857143) internal successors, (3440), 56 states have internal predecessors, (3440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:48:54,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 180.0) internal successors, (10260), 57 states have internal predecessors, (10260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:48:54,201 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 180.0) internal successors, (10260), 57 states have internal predecessors, (10260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:48:54,201 INFO L175 Difference]: Start difference. First operand has 759 places, 2416 transitions, 46955 flow. Second operand 56 states and 3440 transitions. [2023-08-27 04:48:54,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 814 places, 3166 transitions, 73857 flow [2023-08-27 04:49:13,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 796 places, 3166 transitions, 68199 flow, removed 2692 selfloop flow, removed 18 redundant places. [2023-08-27 04:49:13,811 INFO L231 Difference]: Finished difference. Result has 837 places, 2941 transitions, 58806 flow [2023-08-27 04:49:13,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=43769, PETRI_DIFFERENCE_MINUEND_PLACES=741, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=537, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1707, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=58806, PETRI_PLACES=837, PETRI_TRANSITIONS=2941} [2023-08-27 04:49:13,814 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 810 predicate places. [2023-08-27 04:49:13,814 INFO L495 AbstractCegarLoop]: Abstraction has has 837 places, 2941 transitions, 58806 flow [2023-08-27 04:49:13,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 57.45161290322581) internal successors, (1781), 31 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:13,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:49:13,814 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:49:13,822 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 04:49:14,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:49:14,020 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:49:14,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:49:14,020 INFO L85 PathProgramCache]: Analyzing trace with hash 808334719, now seen corresponding path program 9 times [2023-08-27 04:49:14,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:49:14,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148945955] [2023-08-27 04:49:14,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:49:14,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:49:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:49:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:49:14,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:49:14,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148945955] [2023-08-27 04:49:14,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148945955] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:49:14,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723468273] [2023-08-27 04:49:14,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 04:49:14,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:49:14,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:49:14,425 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 04:49:14,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-27 04:49:14,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-27 04:49:14,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 04:49:14,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-27 04:49:14,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:49:14,553 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 7 treesize of output 6 [2023-08-27 04:49:14,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 04:49:14,631 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-27 04:49:14,813 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-27 04:49:14,885 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 21 treesize of output 16 [2023-08-27 04:49:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:49:14,934 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 04:49:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:49:19,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723468273] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 04:49:19,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 04:49:19,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-08-27 04:49:19,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893990380] [2023-08-27 04:49:19,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 04:49:19,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-27 04:49:19,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:49:19,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-27 04:49:19,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=788, Unknown=2, NotChecked=0, Total=992 [2023-08-27 04:49:19,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 180 [2023-08-27 04:49:19,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 837 places, 2941 transitions, 58806 flow. Second operand has 32 states, 32 states have (on average 57.40625) internal successors, (1837), 32 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:19,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:49:19,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 180 [2023-08-27 04:49:19,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:49:20,740 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1575 (Array Int Int)) (v_ArrVal_1578 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_48| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse0) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1575) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1578) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1578 Int) (v_ArrVal_1577 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse1) (< (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1577)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1578))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1578 Int) (v_ArrVal_1577 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1577)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1578) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1578 Int)) (or (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1578) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse0))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1578 Int) (v_ArrVal_1577 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse1) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1577)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1578) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647))))) is different from false [2023-08-27 04:49:22,176 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse0 (select |c_#memory_int| 1)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1575 (Array Int Int)) (v_ArrVal_1578 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_48| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1575) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1578) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (exists ((v_ArrVal_1578 Int)) (= .cse0 (store .cse1 0 v_ArrVal_1578))) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1578 Int) (v_ArrVal_1577 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse2) (< (select (select (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1577)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1578))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1577 Int)) (= (store .cse1 0 v_ArrVal_1577) .cse0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1578 Int) (v_ArrVal_1577 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1577)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1578) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse2))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1578 Int) (v_ArrVal_1577 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse2) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1577)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1578) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647))))) is different from false [2023-08-27 04:49:24,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 04:49:27,682 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse0 (select |c_#memory_int| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1575 (Array Int Int)) (v_ArrVal_1578 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_48| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1575) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1578) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (exists ((v_ArrVal_1578 Int)) (= .cse0 (store .cse1 0 v_ArrVal_1578))) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1578 Int) (v_ArrVal_1577 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse2) (< (select (select (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1577)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1578))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1577 Int)) (= (store .cse1 0 v_ArrVal_1577) .cse0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1578 Int) (v_ArrVal_1577 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1577)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1578) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse2))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2023-08-27 04:49:36,336 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ .cse4 28 |c_~#cache~0.offset|)) (.cse0 (+ 28 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1575 (Array Int Int)) (v_ArrVal_1578 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_48| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse0) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1575) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1578) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1578 Int) (v_ArrVal_1577 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse1) (< (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1577)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1578))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1578 Int) (v_ArrVal_1577 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1577)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1578) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1578 Int)) (or (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1578) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse0))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1578 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| (+ .cse4 |c_~#cache~0.offset|)) (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1578)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647)))))) is different from false [2023-08-27 04:49:39,618 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse0 (+ .cse3 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1575 (Array Int Int)) (v_ArrVal_1578 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_48| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1575) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1578) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (exists ((v_ArrVal_1578 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1578))) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1578 Int) (v_ArrVal_1577 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse0) (< (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1577)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1578))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647))) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1578 Int) (v_ArrVal_1577 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1577)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1578) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| .cse0))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1578 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| (+ .cse3 |c_~#cache~0.offset|)) (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1578)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647)))))) is different from false [2023-08-27 04:49:53,894 INFO L124 PetriNetUnfolderBase]: 6631/13965 cut-off events. [2023-08-27 04:49:53,894 INFO L125 PetriNetUnfolderBase]: For 2366233/2366233 co-relation queries the response was YES. [2023-08-27 04:49:54,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235342 conditions, 13965 events. 6631/13965 cut-off events. For 2366233/2366233 co-relation queries the response was YES. Maximal size of possible extension queue 1232. Compared 131174 event pairs, 1595 based on Foata normal form. 60/14025 useless extension candidates. Maximal degree in co-relation 234976. Up to 9384 conditions per place. [2023-08-27 04:49:54,257 INFO L140 encePairwiseOnDemand]: 163/180 looper letters, 2650 selfloop transitions, 1199 changer transitions 17/3866 dead transitions. [2023-08-27 04:49:54,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 896 places, 3866 transitions, 92826 flow [2023-08-27 04:49:54,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-08-27 04:49:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2023-08-27 04:49:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 3732 transitions. [2023-08-27 04:49:54,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34555555555555556 [2023-08-27 04:49:54,261 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 3732 transitions. [2023-08-27 04:49:54,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 3732 transitions. [2023-08-27 04:49:54,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:49:54,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 3732 transitions. [2023-08-27 04:49:54,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 62.2) internal successors, (3732), 60 states have internal predecessors, (3732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:54,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 180.0) internal successors, (10980), 61 states have internal predecessors, (10980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:54,274 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 180.0) internal successors, (10980), 61 states have internal predecessors, (10980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:49:54,274 INFO L175 Difference]: Start difference. First operand has 837 places, 2941 transitions, 58806 flow. Second operand 60 states and 3732 transitions. [2023-08-27 04:49:54,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 896 places, 3866 transitions, 92826 flow [2023-08-27 04:50:20,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 887 places, 3866 transitions, 90466 flow, removed 1131 selfloop flow, removed 9 redundant places. [2023-08-27 04:50:20,193 INFO L231 Difference]: Finished difference. Result has 926 places, 3534 transitions, 76090 flow [2023-08-27 04:50:20,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=56584, PETRI_DIFFERENCE_MINUEND_PLACES=828, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2941, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=696, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=76090, PETRI_PLACES=926, PETRI_TRANSITIONS=3534} [2023-08-27 04:50:20,195 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 899 predicate places. [2023-08-27 04:50:20,195 INFO L495 AbstractCegarLoop]: Abstraction has has 926 places, 3534 transitions, 76090 flow [2023-08-27 04:50:20,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 57.40625) internal successors, (1837), 32 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:20,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:50:20,196 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:50:20,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-08-27 04:50:20,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-08-27 04:50:20,396 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:50:20,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:50:20,397 INFO L85 PathProgramCache]: Analyzing trace with hash -769806081, now seen corresponding path program 10 times [2023-08-27 04:50:20,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:50:20,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582283291] [2023-08-27 04:50:20,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:50:20,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:50:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:50:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:50:20,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:50:20,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582283291] [2023-08-27 04:50:20,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582283291] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:50:20,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255453699] [2023-08-27 04:50:20,807 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 04:50:20,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:50:20,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:50:20,808 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 04:50:20,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-27 04:50:20,952 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 04:50:20,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 04:50:20,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-27 04:50:20,954 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:50:20,958 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 7 treesize of output 6 [2023-08-27 04:50:21,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 04:50:21,035 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-27 04:50:21,119 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-27 04:50:21,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 21 treesize of output 16 [2023-08-27 04:50:21,298 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:50:21,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 04:50:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:50:29,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255453699] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 04:50:29,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 04:50:29,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 28 [2023-08-27 04:50:29,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135076960] [2023-08-27 04:50:29,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 04:50:29,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-27 04:50:29,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:50:29,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-27 04:50:29,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=700, Unknown=6, NotChecked=0, Total=870 [2023-08-27 04:50:29,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 180 [2023-08-27 04:50:29,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 926 places, 3534 transitions, 76090 flow. Second operand has 30 states, 30 states have (on average 57.5) internal successors, (1725), 30 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:29,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:50:29,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 180 [2023-08-27 04:50:29,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:50:29,559 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1657 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1657))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1657 Int) (v_ArrVal_1658 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1657)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1658) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56|) 2147483647))) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (v_ArrVal_1655 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1658 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_49| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1655) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1658) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| (+ 28 |c_~#cache~0.offset|))))) is different from false [2023-08-27 04:50:29,793 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (exists ((v_ArrVal_1657 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1657))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1657 Int) (v_ArrVal_1658 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1657)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1658) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56|) 2147483647))) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (v_ArrVal_1655 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1658 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_49| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1655) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1658) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| (+ 28 |c_~#cache~0.offset|))))) is different from false [2023-08-27 04:50:32,566 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (exists ((v_ArrVal_1657 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1657))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1657 Int) (v_ArrVal_1658 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1657)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1658) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56|) 2147483647))) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (v_ArrVal_1655 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1658 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_49| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1655) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1658) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| (+ 28 |c_~#cache~0.offset|))))) is different from false [2023-08-27 04:50:36,538 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1658 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| (+ .cse0 |c_~#cache~0.offset|)) (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1658)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56|) 2147483647))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1657 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1657))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1657 Int) (v_ArrVal_1658 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| (+ .cse0 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1657)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1658) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56|) 2147483647))) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (v_ArrVal_1655 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1658 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_49| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1655) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1658) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| (+ 28 |c_~#cache~0.offset|)))))) is different from false [2023-08-27 04:50:50,011 INFO L124 PetriNetUnfolderBase]: 6959/14694 cut-off events. [2023-08-27 04:50:50,011 INFO L125 PetriNetUnfolderBase]: For 2990654/2990654 co-relation queries the response was YES. [2023-08-27 04:50:50,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271914 conditions, 14694 events. 6959/14694 cut-off events. For 2990654/2990654 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 140079 event pairs, 2105 based on Foata normal form. 16/14710 useless extension candidates. Maximal degree in co-relation 271509. Up to 12690 conditions per place. [2023-08-27 04:50:50,429 INFO L140 encePairwiseOnDemand]: 164/180 looper letters, 3147 selfloop transitions, 757 changer transitions 7/3911 dead transitions. [2023-08-27 04:50:50,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 963 places, 3911 transitions, 96191 flow [2023-08-27 04:50:50,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-27 04:50:50,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-27 04:50:50,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2341 transitions. [2023-08-27 04:50:50,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3422514619883041 [2023-08-27 04:50:50,433 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 2341 transitions. [2023-08-27 04:50:50,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 2341 transitions. [2023-08-27 04:50:50,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:50:50,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 2341 transitions. [2023-08-27 04:50:50,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 61.60526315789474) internal successors, (2341), 38 states have internal predecessors, (2341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:50,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 180.0) internal successors, (7020), 39 states have internal predecessors, (7020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:50,440 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 180.0) internal successors, (7020), 39 states have internal predecessors, (7020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:50:50,440 INFO L175 Difference]: Start difference. First operand has 926 places, 3534 transitions, 76090 flow. Second operand 38 states and 2341 transitions. [2023-08-27 04:50:50,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 963 places, 3911 transitions, 96191 flow [2023-08-27 04:51:26,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 953 places, 3911 transitions, 92252 flow, removed 1913 selfloop flow, removed 10 redundant places. [2023-08-27 04:51:26,979 INFO L231 Difference]: Finished difference. Result has 975 places, 3779 transitions, 82281 flow [2023-08-27 04:51:26,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=72646, PETRI_DIFFERENCE_MINUEND_PLACES=916, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=546, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2841, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=82281, PETRI_PLACES=975, PETRI_TRANSITIONS=3779} [2023-08-27 04:51:26,982 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 948 predicate places. [2023-08-27 04:51:26,982 INFO L495 AbstractCegarLoop]: Abstraction has has 975 places, 3779 transitions, 82281 flow [2023-08-27 04:51:26,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 57.5) internal successors, (1725), 30 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:51:26,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:51:26,982 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:51:26,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-08-27 04:51:27,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:51:27,185 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:51:27,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:51:27,186 INFO L85 PathProgramCache]: Analyzing trace with hash -615625053, now seen corresponding path program 1 times [2023-08-27 04:51:27,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:51:27,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003981382] [2023-08-27 04:51:27,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:51:27,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:51:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:51:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:51:27,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:51:27,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003981382] [2023-08-27 04:51:27,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003981382] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:51:27,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944327901] [2023-08-27 04:51:27,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:51:27,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:51:27,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:51:27,574 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 04:51:27,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-27 04:51:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:51:27,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-27 04:51:27,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:51:27,716 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 7 treesize of output 6 [2023-08-27 04:51:27,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 04:51:27,791 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-27 04:51:27,898 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-27 04:51:27,990 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 21 treesize of output 16 [2023-08-27 04:51:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:51:28,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 04:51:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:51:32,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944327901] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 04:51:32,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 04:51:32,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 28 [2023-08-27 04:51:32,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823665291] [2023-08-27 04:51:32,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 04:51:32,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-27 04:51:32,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:51:32,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-27 04:51:32,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=692, Unknown=6, NotChecked=0, Total=870 [2023-08-27 04:51:32,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 180 [2023-08-27 04:51:32,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 975 places, 3779 transitions, 82281 flow. Second operand has 30 states, 30 states have (on average 57.5) internal successors, (1725), 30 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:51:32,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:51:32,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 180 [2023-08-27 04:51:32,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:51:35,995 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_ArrVal_1737 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1737) (select |c_#memory_int| 1))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1738 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int)) (or (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1738)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (forall ((v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1737 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_50| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_50| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_50| v_ArrVal_1735) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1737) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76|) 2147483647)))) is different from false [2023-08-27 04:51:43,466 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse1 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse3 (+ .cse4 28 |c_~#cache~0.offset|))) (and (= .cse0 (store .cse1 .cse2 0)) (or (= .cse0 .cse1) (and (<= .cse2 |c_~#cache~0.offset|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_ArrVal_1737 Int)) (= (store .cse0 0 v_ArrVal_1737) (select |c_#memory_int| 1))) (forall ((v_ArrVal_1737 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1737)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| .cse3))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse4 |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1737 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| .cse3) (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1737) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76|) 2147483647))) (forall ((v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1737 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_50| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_50| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_50| v_ArrVal_1735) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1737) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76|) 2147483647)))))) is different from false [2023-08-27 04:51:55,769 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 04:52:03,988 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 04:52:22,397 INFO L124 PetriNetUnfolderBase]: 7639/15952 cut-off events. [2023-08-27 04:52:22,397 INFO L125 PetriNetUnfolderBase]: For 3643730/3643730 co-relation queries the response was YES. [2023-08-27 04:52:22,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308161 conditions, 15952 events. 7639/15952 cut-off events. For 3643730/3643730 co-relation queries the response was YES. Maximal size of possible extension queue 1265. Compared 152289 event pairs, 1287 based on Foata normal form. 414/16366 useless extension candidates. Maximal degree in co-relation 307779. Up to 10034 conditions per place. [2023-08-27 04:52:22,879 INFO L140 encePairwiseOnDemand]: 164/180 looper letters, 3156 selfloop transitions, 1449 changer transitions 18/4623 dead transitions. [2023-08-27 04:52:22,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 4623 transitions, 115455 flow [2023-08-27 04:52:22,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-08-27 04:52:22,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2023-08-27 04:52:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 3939 transitions. [2023-08-27 04:52:22,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419270833333333 [2023-08-27 04:52:22,886 INFO L72 ComplementDD]: Start complementDD. Operand 64 states and 3939 transitions. [2023-08-27 04:52:22,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 3939 transitions. [2023-08-27 04:52:22,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 04:52:22,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 64 states and 3939 transitions. [2023-08-27 04:52:22,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 65 states, 64 states have (on average 61.546875) internal successors, (3939), 64 states have internal predecessors, (3939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:52:22,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 65 states, 65 states have (on average 180.0) internal successors, (11700), 65 states have internal predecessors, (11700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:52:22,899 INFO L81 ComplementDD]: Finished complementDD. Result has 65 states, 65 states have (on average 180.0) internal successors, (11700), 65 states have internal predecessors, (11700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:52:22,899 INFO L175 Difference]: Start difference. First operand has 975 places, 3779 transitions, 82281 flow. Second operand 64 states and 3939 transitions. [2023-08-27 04:52:22,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 4623 transitions, 115455 flow [2023-08-27 04:53:02,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1013 places, 4623 transitions, 112969 flow, removed 1118 selfloop flow, removed 16 redundant places. [2023-08-27 04:53:02,478 INFO L231 Difference]: Finished difference. Result has 1046 places, 4125 transitions, 95748 flow [2023-08-27 04:53:02,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=77267, PETRI_DIFFERENCE_MINUEND_PLACES=950, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1041, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=95748, PETRI_PLACES=1046, PETRI_TRANSITIONS=4125} [2023-08-27 04:53:02,482 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 1019 predicate places. [2023-08-27 04:53:02,482 INFO L495 AbstractCegarLoop]: Abstraction has has 1046 places, 4125 transitions, 95748 flow [2023-08-27 04:53:02,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 57.5) internal successors, (1725), 30 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:53:02,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 04:53:02,483 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:53:02,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-27 04:53:02,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:53:02,688 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 04:53:02,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 04:53:02,688 INFO L85 PathProgramCache]: Analyzing trace with hash -967825648, now seen corresponding path program 1 times [2023-08-27 04:53:02,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 04:53:02,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033889598] [2023-08-27 04:53:02,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:53:02,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 04:53:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:53:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:53:03,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 04:53:03,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033889598] [2023-08-27 04:53:03,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033889598] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 04:53:03,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399310717] [2023-08-27 04:53:03,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 04:53:03,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 04:53:03,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 04:53:03,112 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 04:53:03,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-27 04:53:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 04:53:03,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-27 04:53:03,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 04:53:03,251 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 7 treesize of output 6 [2023-08-27 04:53:03,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 04:53:03,331 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-27 04:53:03,483 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 27 treesize of output 20 [2023-08-27 04:53:03,657 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 21 treesize of output 16 [2023-08-27 04:53:03,695 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:53:03,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 04:53:10,699 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 04:53:10,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399310717] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 04:53:10,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 04:53:10,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-27 04:53:10,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846246481] [2023-08-27 04:53:10,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 04:53:10,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-27 04:53:10,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 04:53:10,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-27 04:53:10,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=992, Unknown=4, NotChecked=0, Total=1190 [2023-08-27 04:53:10,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 180 [2023-08-27 04:53:10,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1046 places, 4125 transitions, 95748 flow. Second operand has 35 states, 35 states have (on average 51.285714285714285) internal successors, (1795), 35 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 04:53:10,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 04:53:10,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 180 [2023-08-27 04:53:10,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 04:53:11,504 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (<= |c_~#cache~0.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_main_~i~2#1| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1816 Int) (v_ArrVal_1819 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1816)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_59| v_ArrVal_1819) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 2147483647) (< (+ |c_ULTIMATE.start_cache_entry_addref_#t~post32#1| 1) v_ArrVal_1816) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_59| (+ .cse0 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (<= (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 1) (exists ((v_ArrVal_1816 Int)) (let ((.cse2 ((as const (Array Int Int)) 0))) (and (<= v_ArrVal_1816 (+ (select .cse2 0) 1)) (= (store .cse2 0 v_ArrVal_1816) (select |c_#memory_int| 1))))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1816 Int) (v_ArrVal_1819 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_51| Int) (v_ArrVal_1815 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_51| v_ArrVal_1815) |c_~#cache~0.base|))) (or (< (+ (select .cse3 |c_~#cache~0.offset|) 1) v_ArrVal_1816) (< (select (store (store .cse3 |c_~#cache~0.offset| v_ArrVal_1816) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_59| v_ArrVal_1819) |c_~#cache~0.offset|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_59| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_51| |c_#StackHeapBarrier|)))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|))) is different from false [2023-08-27 04:53:25,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 04:53:27,134 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 04:53:29,160 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 04:53:31,281 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 04:53:33,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 04:53:44,320 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 04:53:48,156 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 04:53:58,000 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 04:54:00,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 04:54:08,440 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 04:54:10,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 04:54:18,025 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 04:54:20,030 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 04:54:22,035 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 04:54:24,041 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 04:54:26,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 [1] [2023-08-27 04:54:28,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 [1] [2023-08-27 04:54:30,060 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 04:54:32,074 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 04:54:34,079 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 04:54:36,089 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 04:54:38,098 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 04:54:40,104 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 04:54:42,109 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 04:54:44,115 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 04:54:46,121 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 04:54:48,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 04:54:50,132 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 04:54:52,141 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 04:54:54,148 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 04:54:56,154 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 04:54:58,159 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 04:55:00,272 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 04:55:02,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 04:55:04,282 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 04:55:06,288 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 04:55:08,296 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 04:55:10,302 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 04:55:12,307 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 04:55:14,312 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 04:55:19,937 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 04:55:23,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 04:55:29,212 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 04:55:31,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 04:55:42,253 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 04:55:44,256 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 04:55:46,261 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 04:55:48,329 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 04:55:50,334 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 04:55:52,342 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 04:55:54,348 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] Received shutdown request... [2023-08-27 04:55:55,108 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 04:55:55,108 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 04:55:56,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-27 04:55:56,309 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-27 04:55:56,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-27 04:55:56,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 15 remaining) [2023-08-27 04:55:56,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-08-27 04:55:56,341 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-27 04:55:56,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2023-08-27 04:55:56,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2023-08-27 04:55:56,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2023-08-27 04:55:56,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2023-08-27 04:55:56,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2023-08-27 04:55:56,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 15 remaining) [2023-08-27 04:55:56,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 15 remaining) [2023-08-27 04:55:56,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2023-08-27 04:55:56,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2023-08-27 04:55:56,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2023-08-27 04:55:56,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2023-08-27 04:55:56,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2023-08-27 04:55:56,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2023-08-27 04:55:56,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2023-08-27 04:55:56,344 INFO L445 BasicCegarLoop]: Path program histogram: [10, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 04:55:56,347 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 04:55:56,347 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 04:55:56,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 04:55:56 BasicIcfg [2023-08-27 04:55:56,349 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 04:55:56,349 INFO L158 Benchmark]: Toolchain (without parser) took 839159.61ms. Allocated memory was 394.3MB in the beginning and 6.7GB in the end (delta: 6.3GB). Free memory was 368.8MB in the beginning and 4.0GB in the end (delta: -3.6GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. [2023-08-27 04:55:56,350 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 394.3MB. Free memory was 372.2MB in the beginning and 372.1MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 04:55:56,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.21ms. Allocated memory is still 394.3MB. Free memory was 368.8MB in the beginning and 340.9MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-27 04:55:56,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.66ms. Allocated memory is still 394.3MB. Free memory was 340.9MB in the beginning and 338.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 04:55:56,350 INFO L158 Benchmark]: Boogie Preprocessor took 32.72ms. Allocated memory is still 394.3MB. Free memory was 338.8MB in the beginning and 337.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 04:55:56,350 INFO L158 Benchmark]: RCFGBuilder took 407.12ms. Allocated memory is still 394.3MB. Free memory was 336.7MB in the beginning and 322.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-27 04:55:56,350 INFO L158 Benchmark]: TraceAbstraction took 838116.41ms. Allocated memory was 394.3MB in the beginning and 6.7GB in the end (delta: 6.3GB). Free memory was 321.5MB in the beginning and 4.0GB in the end (delta: -3.7GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. [2023-08-27 04:55:56,351 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.15ms. Allocated memory is still 394.3MB. Free memory was 372.2MB in the beginning and 372.1MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 537.21ms. Allocated memory is still 394.3MB. Free memory was 368.8MB in the beginning and 340.9MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 60.66ms. Allocated memory is still 394.3MB. Free memory was 340.9MB in the beginning and 338.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.72ms. Allocated memory is still 394.3MB. Free memory was 338.8MB in the beginning and 337.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 407.12ms. Allocated memory is still 394.3MB. Free memory was 336.7MB in the beginning and 322.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 838116.41ms. Allocated memory was 394.3MB in the beginning and 6.7GB in the end (delta: 6.3GB). Free memory was 321.5MB in the beginning and 4.0GB in the end (delta: -3.7GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 736]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [736] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 90 PlacesBefore, 27 PlacesAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 2108 CoEnabledTransitionPairs, 4 FixpointIterations, 23 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 87 TotalNumberOfCompositions, 2651 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1847, independent: 1758, independent conditional: 0, independent unconditional: 1758, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1147, independent: 1122, independent conditional: 0, independent unconditional: 1122, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1847, independent: 636, independent conditional: 0, independent unconditional: 636, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 1147, unknown conditional: 0, unknown unconditional: 1147] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 933]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 933]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 938]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 938]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 937]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 928]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 928]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 119 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 838.0s, OverallIterations: 36, TraceHistogramMax: 10, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 745.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 384 mSolverCounterUnknown, 5105 SdHoareTripleChecker+Valid, 308.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5105 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 305.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4209 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 945 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18312 IncrementalHoareTripleChecker+Invalid, 23851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 945 mSolverCounterUnsat, 0 mSDtfsCounter, 18312 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1595 GetRequests, 442 SyntacticMatches, 18 SemanticMatches, 1135 ConstructedPredicates, 34 IntricatePredicates, 0 DeprecatedPredicates, 25086 ImplicationChecksByTransitivity, 283.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95748occurred in iteration=35, InterpolantAutomatonStates: 832, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 83.5s InterpolantComputationTime, 1108 NumberOfCodeBlocks, 1082 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 1382 ConstructedInterpolants, 376 QuantifiedInterpolants, 22133 SizeOfPredicates, 238 NumberOfNonLiveVariables, 3525 ConjunctsInSsa, 627 ConjunctsInUnsatCore, 71 InterpolantComputations, 20 PerfectInterpolantSequences, 3385/3522 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