./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 19:10:59,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 19:11:00,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-20 19:11:00,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 19:11:00,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 19:11:00,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 19:11:00,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 19:11:00,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 19:11:00,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 19:11:00,022 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 19:11:00,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 19:11:00,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 19:11:00,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 19:11:00,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 19:11:00,024 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 19:11:00,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 19:11:00,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 19:11:00,025 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 19:11:00,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 19:11:00,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 19:11:00,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 19:11:00,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 19:11:00,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 19:11:00,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 19:11:00,027 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 19:11:00,027 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 19:11:00,027 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 19:11:00,027 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 19:11:00,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 19:11:00,028 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 19:11:00,028 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 19:11:00,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 19:11:00,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 19:11:00,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 19:11:00,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:11:00,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 19:11:00,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 19:11:00,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 19:11:00,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 19:11:00,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 19:11:00,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 19:11:00,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 19:11:00,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 19:11:00,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 19:11:00,031 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 [2024-11-20 19:11:00,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 19:11:00,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 19:11:00,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 19:11:00,253 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 19:11:00,253 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 19:11:00,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-11-20 19:11:01,577 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 19:11:01,765 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 19:11:01,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-11-20 19:11:01,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36093760e/fcd0fe34e6d047498f1a6971781cef8a/FLAGd479cccb8 [2024-11-20 19:11:01,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36093760e/fcd0fe34e6d047498f1a6971781cef8a [2024-11-20 19:11:01,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 19:11:01,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 19:11:01,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 19:11:01,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 19:11:01,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 19:11:01,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:11:01" (1/1) ... [2024-11-20 19:11:01,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51b2802b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:01, skipping insertion in model container [2024-11-20 19:11:01,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:11:01" (1/1) ... [2024-11-20 19:11:01,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 19:11:02,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:11:02,103 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 19:11:02,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:11:02,160 INFO L204 MainTranslator]: Completed translation [2024-11-20 19:11:02,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:02 WrapperNode [2024-11-20 19:11:02,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 19:11:02,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 19:11:02,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 19:11:02,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 19:11:02,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:02" (1/1) ... [2024-11-20 19:11:02,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:02" (1/1) ... [2024-11-20 19:11:02,215 INFO L138 Inliner]: procedures = 28, calls = 52, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 431 [2024-11-20 19:11:02,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 19:11:02,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 19:11:02,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 19:11:02,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 19:11:02,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:02" (1/1) ... [2024-11-20 19:11:02,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:02" (1/1) ... [2024-11-20 19:11:02,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:02" (1/1) ... [2024-11-20 19:11:02,273 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 19:11:02,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:02" (1/1) ... [2024-11-20 19:11:02,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:02" (1/1) ... [2024-11-20 19:11:02,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:02" (1/1) ... [2024-11-20 19:11:02,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:02" (1/1) ... [2024-11-20 19:11:02,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:02" (1/1) ... [2024-11-20 19:11:02,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:02" (1/1) ... [2024-11-20 19:11:02,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 19:11:02,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 19:11:02,315 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 19:11:02,315 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 19:11:02,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:02" (1/1) ... [2024-11-20 19:11:02,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:11:02,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:02,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 19:11:02,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 19:11:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 19:11:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-11-20 19:11:02,410 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-11-20 19:11:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-20 19:11:02,411 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-20 19:11:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-11-20 19:11:02,411 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-11-20 19:11:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-11-20 19:11:02,411 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-11-20 19:11:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-11-20 19:11:02,413 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-11-20 19:11:02,413 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 19:11:02,413 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 19:11:02,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 19:11:02,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 19:11:02,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 19:11:02,518 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 19:11:02,520 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 19:11:02,919 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-11-20 19:11:02,919 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 19:11:02,937 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 19:11:02,937 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 19:11:02,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:11:02 BoogieIcfgContainer [2024-11-20 19:11:02,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 19:11:02,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 19:11:02,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 19:11:02,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 19:11:02,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:11:01" (1/3) ... [2024-11-20 19:11:02,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582126bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:11:02, skipping insertion in model container [2024-11-20 19:11:02,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:02" (2/3) ... [2024-11-20 19:11:02,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582126bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:11:02, skipping insertion in model container [2024-11-20 19:11:02,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:11:02" (3/3) ... [2024-11-20 19:11:02,946 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-11-20 19:11:02,960 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 19:11:02,960 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-20 19:11:03,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 19:11:03,022 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@62a80c48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 19:11:03,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-20 19:11:03,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 142 states have (on average 1.5985915492957747) internal successors, (227), 154 states have internal predecessors, (227), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-20 19:11:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 19:11:03,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:03,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:03,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:03,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:03,040 INFO L85 PathProgramCache]: Analyzing trace with hash -356788114, now seen corresponding path program 1 times [2024-11-20 19:11:03,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:03,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122537629] [2024-11-20 19:11:03,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:03,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 19:11:03,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:03,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122537629] [2024-11-20 19:11:03,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122537629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:03,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:11:03,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 19:11:03,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843862583] [2024-11-20 19:11:03,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:03,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:03,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:03,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:03,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 19:11:03,413 INFO L87 Difference]: Start difference. First operand has 194 states, 142 states have (on average 1.5985915492957747) internal successors, (227), 154 states have internal predecessors, (227), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 19:11:03,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:03,559 INFO L93 Difference]: Finished difference Result 404 states and 665 transitions. [2024-11-20 19:11:03,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:03,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-20 19:11:03,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:03,569 INFO L225 Difference]: With dead ends: 404 [2024-11-20 19:11:03,569 INFO L226 Difference]: Without dead ends: 212 [2024-11-20 19:11:03,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 19:11:03,576 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 37 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:03,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 868 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:03,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-20 19:11:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 205. [2024-11-20 19:11:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 152 states have (on average 1.5723684210526316) internal successors, (239), 163 states have internal predecessors, (239), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-20 19:11:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 315 transitions. [2024-11-20 19:11:03,638 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 315 transitions. Word has length 11 [2024-11-20 19:11:03,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:03,638 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 315 transitions. [2024-11-20 19:11:03,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 19:11:03,639 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 315 transitions. [2024-11-20 19:11:03,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 19:11:03,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:03,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:03,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 19:11:03,643 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:03,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:03,644 INFO L85 PathProgramCache]: Analyzing trace with hash 545005096, now seen corresponding path program 1 times [2024-11-20 19:11:03,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:03,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504992116] [2024-11-20 19:11:03,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:03,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:03,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-20 19:11:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 19:11:03,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:03,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504992116] [2024-11-20 19:11:03,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504992116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:03,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:11:03,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 19:11:03,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291223014] [2024-11-20 19:11:03,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:03,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:03,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:03,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:03,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 19:11:03,792 INFO L87 Difference]: Start difference. First operand 205 states and 315 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 19:11:03,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:03,846 INFO L93 Difference]: Finished difference Result 433 states and 675 transitions. [2024-11-20 19:11:03,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:03,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-20 19:11:03,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:03,848 INFO L225 Difference]: With dead ends: 433 [2024-11-20 19:11:03,848 INFO L226 Difference]: Without dead ends: 240 [2024-11-20 19:11:03,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 19:11:03,850 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 19 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:03,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 876 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:03,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-20 19:11:03,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 236. [2024-11-20 19:11:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 178 states have (on average 1.5393258426966292) internal successors, (274), 189 states have internal predecessors, (274), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-20 19:11:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 360 transitions. [2024-11-20 19:11:03,875 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 360 transitions. Word has length 16 [2024-11-20 19:11:03,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:03,875 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 360 transitions. [2024-11-20 19:11:03,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 19:11:03,875 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 360 transitions. [2024-11-20 19:11:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 19:11:03,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:03,877 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:03,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 19:11:03,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:03,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:03,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1126370760, now seen corresponding path program 1 times [2024-11-20 19:11:03,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:03,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552839547] [2024-11-20 19:11:03,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:03,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:04,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-20 19:11:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:04,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 19:11:04,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:04,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552839547] [2024-11-20 19:11:04,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552839547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:04,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822793845] [2024-11-20 19:11:04,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:04,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:04,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:04,079 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) [2024-11-20 19:11:04,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 19:11:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:04,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 19:11:04,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 19:11:04,278 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:04,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822793845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:04,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:04,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-20 19:11:04,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398270331] [2024-11-20 19:11:04,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:04,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 19:11:04,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:04,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 19:11:04,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:04,280 INFO L87 Difference]: Start difference. First operand 236 states and 360 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 19:11:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:04,328 INFO L93 Difference]: Finished difference Result 240 states and 366 transitions. [2024-11-20 19:11:04,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:04,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-20 19:11:04,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:04,332 INFO L225 Difference]: With dead ends: 240 [2024-11-20 19:11:04,332 INFO L226 Difference]: Without dead ends: 239 [2024-11-20 19:11:04,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:04,333 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 19 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:04,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 830 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:04,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-20 19:11:04,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 235. [2024-11-20 19:11:04,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 178 states have (on average 1.5224719101123596) internal successors, (271), 188 states have internal predecessors, (271), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-20 19:11:04,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 357 transitions. [2024-11-20 19:11:04,360 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 357 transitions. Word has length 29 [2024-11-20 19:11:04,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:04,361 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 357 transitions. [2024-11-20 19:11:04,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 19:11:04,361 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 357 transitions. [2024-11-20 19:11:04,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 19:11:04,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:04,363 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:04,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 19:11:04,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:04,568 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:04,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:04,569 INFO L85 PathProgramCache]: Analyzing trace with hash 557755714, now seen corresponding path program 1 times [2024-11-20 19:11:04,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:04,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766206623] [2024-11-20 19:11:04,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:04,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:04,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-20 19:11:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:04,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-20 19:11:04,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:04,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766206623] [2024-11-20 19:11:04,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766206623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:04,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:11:04,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 19:11:04,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962093324] [2024-11-20 19:11:04,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:04,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:04,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:04,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:04,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 19:11:04,677 INFO L87 Difference]: Start difference. First operand 235 states and 357 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 19:11:04,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:04,743 INFO L93 Difference]: Finished difference Result 239 states and 363 transitions. [2024-11-20 19:11:04,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:04,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-11-20 19:11:04,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:04,748 INFO L225 Difference]: With dead ends: 239 [2024-11-20 19:11:04,748 INFO L226 Difference]: Without dead ends: 238 [2024-11-20 19:11:04,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 19:11:04,750 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 18 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:04,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 832 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:04,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-20 19:11:04,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 205. [2024-11-20 19:11:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 154 states have (on average 1.525974025974026) internal successors, (235), 163 states have internal predecessors, (235), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-20 19:11:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 311 transitions. [2024-11-20 19:11:04,775 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 311 transitions. Word has length 30 [2024-11-20 19:11:04,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:04,776 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 311 transitions. [2024-11-20 19:11:04,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 19:11:04,776 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 311 transitions. [2024-11-20 19:11:04,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-20 19:11:04,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:04,779 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:04,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 19:11:04,779 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:04,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:04,780 INFO L85 PathProgramCache]: Analyzing trace with hash 509755153, now seen corresponding path program 1 times [2024-11-20 19:11:04,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:04,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331890737] [2024-11-20 19:11:04,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:04,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:04,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:04,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:04,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:04,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:04,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:04,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 19:11:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:04,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 19:11:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:04,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-20 19:11:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:04,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 19:11:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:04,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 19:11:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:04,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 19:11:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-20 19:11:05,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:05,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331890737] [2024-11-20 19:11:05,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331890737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:05,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570195977] [2024-11-20 19:11:05,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:05,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:05,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:05,008 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) [2024-11-20 19:11:05,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 19:11:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:05,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:05,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-20 19:11:05,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:05,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570195977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:05,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:05,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-20 19:11:05,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845564899] [2024-11-20 19:11:05,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:05,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:05,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:05,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:05,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:05,194 INFO L87 Difference]: Start difference. First operand 205 states and 311 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 19:11:05,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:05,234 INFO L93 Difference]: Finished difference Result 357 states and 550 transitions. [2024-11-20 19:11:05,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:05,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 91 [2024-11-20 19:11:05,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:05,239 INFO L225 Difference]: With dead ends: 357 [2024-11-20 19:11:05,240 INFO L226 Difference]: Without dead ends: 212 [2024-11-20 19:11:05,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-20 19:11:05,241 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 10 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:05,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 838 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:05,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-20 19:11:05,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-20 19:11:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 159 states have (on average 1.528301886792453) internal successors, (243), 169 states have internal predecessors, (243), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 19:11:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 321 transitions. [2024-11-20 19:11:05,251 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 321 transitions. Word has length 91 [2024-11-20 19:11:05,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:05,251 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 321 transitions. [2024-11-20 19:11:05,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 19:11:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 321 transitions. [2024-11-20 19:11:05,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-20 19:11:05,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:05,254 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:05,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 19:11:05,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:05,456 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:05,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:05,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1851436505, now seen corresponding path program 1 times [2024-11-20 19:11:05,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:05,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167581698] [2024-11-20 19:11:05,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:05,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:05,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:05,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:05,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:05,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:05,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:05,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:05,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 19:11:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:05,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 19:11:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:05,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 19:11:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:05,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 19:11:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:05,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 19:11:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-20 19:11:05,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:05,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167581698] [2024-11-20 19:11:05,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167581698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:05,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966469751] [2024-11-20 19:11:05,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:05,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:05,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:05,709 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) [2024-11-20 19:11:05,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 19:11:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:05,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:05,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 19:11:05,887 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:05,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966469751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:05,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:05,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-20 19:11:05,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351716203] [2024-11-20 19:11:05,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:05,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:05,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:05,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:05,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:05,892 INFO L87 Difference]: Start difference. First operand 212 states and 321 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 19:11:05,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:05,943 INFO L93 Difference]: Finished difference Result 371 states and 569 transitions. [2024-11-20 19:11:05,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:05,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2024-11-20 19:11:05,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:05,946 INFO L225 Difference]: With dead ends: 371 [2024-11-20 19:11:05,946 INFO L226 Difference]: Without dead ends: 219 [2024-11-20 19:11:05,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-20 19:11:05,947 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 8 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:05,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 833 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:05,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-20 19:11:05,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-11-20 19:11:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 164 states have (on average 1.5304878048780488) internal successors, (251), 175 states have internal predecessors, (251), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-20 19:11:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 331 transitions. [2024-11-20 19:11:05,957 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 331 transitions. Word has length 93 [2024-11-20 19:11:05,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:05,958 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 331 transitions. [2024-11-20 19:11:05,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 19:11:05,958 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 331 transitions. [2024-11-20 19:11:05,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-20 19:11:05,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:05,960 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:05,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 19:11:06,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:06,161 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:06,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:06,162 INFO L85 PathProgramCache]: Analyzing trace with hash 656454702, now seen corresponding path program 1 times [2024-11-20 19:11:06,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:06,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063085381] [2024-11-20 19:11:06,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:06,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:06,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:06,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:06,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:06,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:06,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:06,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:06,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:11:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:06,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 19:11:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:06,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-20 19:11:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:06,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 19:11:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:06,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 19:11:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-20 19:11:06,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:06,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063085381] [2024-11-20 19:11:06,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063085381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:06,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829353456] [2024-11-20 19:11:06,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:06,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:06,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:06,334 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) [2024-11-20 19:11:06,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 19:11:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:06,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:06,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:06,513 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-20 19:11:06,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:06,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829353456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:06,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:06,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-20 19:11:06,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759240260] [2024-11-20 19:11:06,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:06,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:06,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:06,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:06,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:06,515 INFO L87 Difference]: Start difference. First operand 219 states and 331 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 19:11:06,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:06,677 INFO L93 Difference]: Finished difference Result 396 states and 619 transitions. [2024-11-20 19:11:06,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:06,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-20 19:11:06,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:06,680 INFO L225 Difference]: With dead ends: 396 [2024-11-20 19:11:06,680 INFO L226 Difference]: Without dead ends: 237 [2024-11-20 19:11:06,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-20 19:11:06,684 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 39 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:06,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 794 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 19:11:06,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-20 19:11:06,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2024-11-20 19:11:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 176 states have (on average 1.5454545454545454) internal successors, (272), 187 states have internal predecessors, (272), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-20 19:11:06,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 354 transitions. [2024-11-20 19:11:06,700 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 354 transitions. Word has length 94 [2024-11-20 19:11:06,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:06,700 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 354 transitions. [2024-11-20 19:11:06,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 19:11:06,701 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 354 transitions. [2024-11-20 19:11:06,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 19:11:06,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:06,704 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:06,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 19:11:06,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:06,905 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:06,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:06,905 INFO L85 PathProgramCache]: Analyzing trace with hash 364327559, now seen corresponding path program 1 times [2024-11-20 19:11:06,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:06,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257276367] [2024-11-20 19:11:06,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:06,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:11:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 19:11:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 19:11:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 19:11:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 19:11:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-20 19:11:07,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:07,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257276367] [2024-11-20 19:11:07,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257276367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:07,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886236314] [2024-11-20 19:11:07,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:07,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:07,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:07,233 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) [2024-11-20 19:11:07,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 19:11:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:07,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-20 19:11:07,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:07,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886236314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:07,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:07,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-20 19:11:07,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339325885] [2024-11-20 19:11:07,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:07,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:07,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:07,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:07,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:07,462 INFO L87 Difference]: Start difference. First operand 233 states and 354 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 19:11:07,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:07,517 INFO L93 Difference]: Finished difference Result 471 states and 731 transitions. [2024-11-20 19:11:07,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:07,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 97 [2024-11-20 19:11:07,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:07,520 INFO L225 Difference]: With dead ends: 471 [2024-11-20 19:11:07,520 INFO L226 Difference]: Without dead ends: 257 [2024-11-20 19:11:07,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-20 19:11:07,521 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 21 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:07,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 814 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:07,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-20 19:11:07,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2024-11-20 19:11:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 196 states have (on average 1.5612244897959184) internal successors, (306), 207 states have internal predecessors, (306), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-20 19:11:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 392 transitions. [2024-11-20 19:11:07,529 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 392 transitions. Word has length 97 [2024-11-20 19:11:07,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:07,530 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 392 transitions. [2024-11-20 19:11:07,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 19:11:07,530 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 392 transitions. [2024-11-20 19:11:07,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 19:11:07,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:07,531 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:07,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 19:11:07,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:07,732 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:07,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash 51521317, now seen corresponding path program 1 times [2024-11-20 19:11:07,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:07,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504858531] [2024-11-20 19:11:07,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:07,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:11:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 19:11:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 19:11:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 19:11:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 19:11:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,858 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-20 19:11:07,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:07,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504858531] [2024-11-20 19:11:07,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504858531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:07,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930446932] [2024-11-20 19:11:07,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:07,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:07,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:07,860 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) [2024-11-20 19:11:07,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 19:11:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:07,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:07,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-20 19:11:07,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:07,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930446932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:07,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:07,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-20 19:11:07,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401290448] [2024-11-20 19:11:07,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:07,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:07,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:07,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:07,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:07,989 INFO L87 Difference]: Start difference. First operand 257 states and 392 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 19:11:08,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:08,035 INFO L93 Difference]: Finished difference Result 515 states and 796 transitions. [2024-11-20 19:11:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:08,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2024-11-20 19:11:08,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:08,037 INFO L225 Difference]: With dead ends: 515 [2024-11-20 19:11:08,037 INFO L226 Difference]: Without dead ends: 277 [2024-11-20 19:11:08,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-20 19:11:08,039 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 19 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:08,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 801 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:08,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-20 19:11:08,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2024-11-20 19:11:08,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 212 states have (on average 1.5660377358490567) internal successors, (332), 223 states have internal predecessors, (332), 45 states have call successors, (45), 14 states have call predecessors, (45), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-20 19:11:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 422 transitions. [2024-11-20 19:11:08,047 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 422 transitions. Word has length 99 [2024-11-20 19:11:08,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:08,047 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 422 transitions. [2024-11-20 19:11:08,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 19:11:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 422 transitions. [2024-11-20 19:11:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 19:11:08,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:08,049 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:08,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-20 19:11:08,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:08,253 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:08,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:08,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1311417283, now seen corresponding path program 1 times [2024-11-20 19:11:08,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:08,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822192690] [2024-11-20 19:11:08,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:08,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:11:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 19:11:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 19:11:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 19:11:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 19:11:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-20 19:11:08,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:08,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822192690] [2024-11-20 19:11:08,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822192690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:08,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354814133] [2024-11-20 19:11:08,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:08,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:08,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:08,372 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) [2024-11-20 19:11:08,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-20 19:11:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:08,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-20 19:11:08,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:08,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354814133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:08,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:08,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-20 19:11:08,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439146301] [2024-11-20 19:11:08,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:08,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:08,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:08,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:08,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:08,533 INFO L87 Difference]: Start difference. First operand 277 states and 422 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 19:11:08,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:08,557 INFO L93 Difference]: Finished difference Result 285 states and 437 transitions. [2024-11-20 19:11:08,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:08,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2024-11-20 19:11:08,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:08,559 INFO L225 Difference]: With dead ends: 285 [2024-11-20 19:11:08,559 INFO L226 Difference]: Without dead ends: 284 [2024-11-20 19:11:08,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:08,560 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 12 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:08,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 821 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:08,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-20 19:11:08,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 276. [2024-11-20 19:11:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 212 states have (on average 1.5613207547169812) internal successors, (331), 222 states have internal predecessors, (331), 45 states have call successors, (45), 14 states have call predecessors, (45), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-20 19:11:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 421 transitions. [2024-11-20 19:11:08,570 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 421 transitions. Word has length 100 [2024-11-20 19:11:08,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:08,570 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 421 transitions. [2024-11-20 19:11:08,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 19:11:08,570 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 421 transitions. [2024-11-20 19:11:08,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-20 19:11:08,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:08,571 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:08,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-20 19:11:08,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:08,772 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:08,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:08,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1999229793, now seen corresponding path program 1 times [2024-11-20 19:11:08,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:08,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216152281] [2024-11-20 19:11:08,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:08,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:11:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 19:11:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 19:11:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 19:11:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 19:11:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-20 19:11:08,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:08,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216152281] [2024-11-20 19:11:08,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216152281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:08,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500641692] [2024-11-20 19:11:08,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:08,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:08,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:08,890 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) [2024-11-20 19:11:08,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-20 19:11:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:09,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-20 19:11:09,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:09,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500641692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:09,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:09,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-20 19:11:09,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026349729] [2024-11-20 19:11:09,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:09,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:09,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:09,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:09,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:09,024 INFO L87 Difference]: Start difference. First operand 276 states and 421 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 19:11:09,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:09,051 INFO L93 Difference]: Finished difference Result 472 states and 724 transitions. [2024-11-20 19:11:09,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:09,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-11-20 19:11:09,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:09,053 INFO L225 Difference]: With dead ends: 472 [2024-11-20 19:11:09,053 INFO L226 Difference]: Without dead ends: 286 [2024-11-20 19:11:09,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:09,054 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 11 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:09,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 863 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:09,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-20 19:11:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-11-20 19:11:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 221 states have (on average 1.5565610859728507) internal successors, (344), 230 states have internal predecessors, (344), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-20 19:11:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 438 transitions. [2024-11-20 19:11:09,063 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 438 transitions. Word has length 101 [2024-11-20 19:11:09,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:09,063 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 438 transitions. [2024-11-20 19:11:09,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 19:11:09,063 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 438 transitions. [2024-11-20 19:11:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-20 19:11:09,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:09,064 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:09,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-20 19:11:09,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-20 19:11:09,269 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:09,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:09,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1326737845, now seen corresponding path program 1 times [2024-11-20 19:11:09,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:09,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884661165] [2024-11-20 19:11:09,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:09,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:11:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 19:11:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 19:11:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 19:11:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 19:11:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 19:11:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-20 19:11:09,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:09,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884661165] [2024-11-20 19:11:09,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884661165] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:09,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943520740] [2024-11-20 19:11:09,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:09,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:09,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:09,408 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) [2024-11-20 19:11:09,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-20 19:11:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:09,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-20 19:11:09,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:09,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943520740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:09,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:09,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-20 19:11:09,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284175202] [2024-11-20 19:11:09,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:09,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:09,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:09,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:09,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:09,548 INFO L87 Difference]: Start difference. First operand 286 states and 438 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 19:11:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:09,578 INFO L93 Difference]: Finished difference Result 297 states and 457 transitions. [2024-11-20 19:11:09,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:09,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-11-20 19:11:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:09,580 INFO L225 Difference]: With dead ends: 297 [2024-11-20 19:11:09,580 INFO L226 Difference]: Without dead ends: 296 [2024-11-20 19:11:09,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:09,580 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 10 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:09,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 848 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:09,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-20 19:11:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 287. [2024-11-20 19:11:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 222 states have (on average 1.554054054054054) internal successors, (345), 231 states have internal predecessors, (345), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-20 19:11:09,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 439 transitions. [2024-11-20 19:11:09,592 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 439 transitions. Word has length 108 [2024-11-20 19:11:09,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:09,592 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 439 transitions. [2024-11-20 19:11:09,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 19:11:09,592 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 439 transitions. [2024-11-20 19:11:09,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 19:11:09,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:09,593 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:09,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-20 19:11:09,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:09,798 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:09,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:09,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1820800093, now seen corresponding path program 1 times [2024-11-20 19:11:09,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:09,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830487840] [2024-11-20 19:11:09,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:09,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:11:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 19:11:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 19:11:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 19:11:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 19:11:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 19:11:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,904 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-20 19:11:09,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:09,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830487840] [2024-11-20 19:11:09,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830487840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:09,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617944625] [2024-11-20 19:11:09,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:09,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:09,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:09,908 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) [2024-11-20 19:11:09,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-20 19:11:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:10,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-20 19:11:10,092 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:10,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617944625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:10,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:10,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-20 19:11:10,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253302256] [2024-11-20 19:11:10,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:10,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:10,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:10,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:10,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:10,093 INFO L87 Difference]: Start difference. First operand 287 states and 439 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 19:11:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:10,119 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2024-11-20 19:11:10,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:10,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-20 19:11:10,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:10,121 INFO L225 Difference]: With dead ends: 289 [2024-11-20 19:11:10,121 INFO L226 Difference]: Without dead ends: 288 [2024-11-20 19:11:10,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:10,122 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 9 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:10,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 863 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:10,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-20 19:11:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-11-20 19:11:10,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 223 states have (on average 1.5515695067264574) internal successors, (346), 232 states have internal predecessors, (346), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-20 19:11:10,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 440 transitions. [2024-11-20 19:11:10,130 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 440 transitions. Word has length 109 [2024-11-20 19:11:10,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:10,130 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 440 transitions. [2024-11-20 19:11:10,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 19:11:10,130 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 440 transitions. [2024-11-20 19:11:10,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-20 19:11:10,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:10,131 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:10,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-20 19:11:10,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-20 19:11:10,336 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:10,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash 991157711, now seen corresponding path program 1 times [2024-11-20 19:11:10,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:10,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320352280] [2024-11-20 19:11:10,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:11:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 19:11:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 19:11:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 19:11:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 19:11:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 19:11:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-20 19:11:10,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:10,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320352280] [2024-11-20 19:11:10,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320352280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:10,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121861977] [2024-11-20 19:11:10,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:10,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:10,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:10,514 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) [2024-11-20 19:11:10,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-20 19:11:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 19:11:10,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:10,666 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-20 19:11:10,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:10,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121861977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:10,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:10,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-20 19:11:10,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765157508] [2024-11-20 19:11:10,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:10,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 19:11:10,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:10,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 19:11:10,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-20 19:11:10,668 INFO L87 Difference]: Start difference. First operand 288 states and 440 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 19:11:10,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:10,703 INFO L93 Difference]: Finished difference Result 293 states and 450 transitions. [2024-11-20 19:11:10,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:10,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-11-20 19:11:10,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:10,705 INFO L225 Difference]: With dead ends: 293 [2024-11-20 19:11:10,705 INFO L226 Difference]: Without dead ends: 292 [2024-11-20 19:11:10,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-20 19:11:10,705 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 12 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:10,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1079 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-20 19:11:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 287. [2024-11-20 19:11:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 223 states have (on average 1.547085201793722) internal successors, (345), 231 states have internal predecessors, (345), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-20 19:11:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 439 transitions. [2024-11-20 19:11:10,716 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 439 transitions. Word has length 110 [2024-11-20 19:11:10,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:10,716 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 439 transitions. [2024-11-20 19:11:10,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 19:11:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 439 transitions. [2024-11-20 19:11:10,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 19:11:10,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:10,718 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:10,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-20 19:11:10,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-20 19:11:10,925 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:10,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:10,926 INFO L85 PathProgramCache]: Analyzing trace with hash 661118297, now seen corresponding path program 1 times [2024-11-20 19:11:10,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:10,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703970137] [2024-11-20 19:11:10,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:10,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:11:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 19:11:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 19:11:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 19:11:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 19:11:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 19:11:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-20 19:11:11,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:11,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703970137] [2024-11-20 19:11:11,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703970137] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:11,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125264251] [2024-11-20 19:11:11,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:11,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:11,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:11,036 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) [2024-11-20 19:11:11,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-20 19:11:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 19:11:11,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-20 19:11:11,191 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:11,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125264251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:11,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:11,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-20 19:11:11,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412980348] [2024-11-20 19:11:11,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:11,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 19:11:11,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:11,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 19:11:11,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-20 19:11:11,192 INFO L87 Difference]: Start difference. First operand 287 states and 439 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 19:11:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:11,232 INFO L93 Difference]: Finished difference Result 491 states and 755 transitions. [2024-11-20 19:11:11,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 19:11:11,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2024-11-20 19:11:11,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:11,234 INFO L225 Difference]: With dead ends: 491 [2024-11-20 19:11:11,234 INFO L226 Difference]: Without dead ends: 294 [2024-11-20 19:11:11,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-20 19:11:11,235 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 20 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:11,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1398 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:11,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-20 19:11:11,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2024-11-20 19:11:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 226 states have (on average 1.5530973451327434) internal successors, (351), 233 states have internal predecessors, (351), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 19:11:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 447 transitions. [2024-11-20 19:11:11,242 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 447 transitions. Word has length 111 [2024-11-20 19:11:11,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:11,242 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 447 transitions. [2024-11-20 19:11:11,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 19:11:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 447 transitions. [2024-11-20 19:11:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 19:11:11,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:11,262 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:11,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-20 19:11:11,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-20 19:11:11,463 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:11,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:11,464 INFO L85 PathProgramCache]: Analyzing trace with hash 205169561, now seen corresponding path program 1 times [2024-11-20 19:11:11,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:11,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538986517] [2024-11-20 19:11:11,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:11,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:11:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 19:11:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 19:11:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 19:11:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 19:11:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 19:11:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 19:11:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-20 19:11:11,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:11,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538986517] [2024-11-20 19:11:11,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538986517] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:11,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598850521] [2024-11-20 19:11:11,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:11,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:11,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:11,573 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) [2024-11-20 19:11:11,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-20 19:11:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:11,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-20 19:11:11,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:11,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598850521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:11,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:11,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-20 19:11:11,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665150147] [2024-11-20 19:11:11,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:11,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:11,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:11,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:11,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:11,715 INFO L87 Difference]: Start difference. First operand 290 states and 447 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-20 19:11:11,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:11,741 INFO L93 Difference]: Finished difference Result 299 states and 462 transitions. [2024-11-20 19:11:11,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:11,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2024-11-20 19:11:11,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:11,743 INFO L225 Difference]: With dead ends: 299 [2024-11-20 19:11:11,743 INFO L226 Difference]: Without dead ends: 298 [2024-11-20 19:11:11,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:11,744 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 8 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:11,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 818 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:11,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-20 19:11:11,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 291. [2024-11-20 19:11:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 227 states have (on average 1.550660792951542) internal successors, (352), 234 states have internal predecessors, (352), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 19:11:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 448 transitions. [2024-11-20 19:11:11,751 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 448 transitions. Word has length 116 [2024-11-20 19:11:11,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:11,751 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 448 transitions. [2024-11-20 19:11:11,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-20 19:11:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 448 transitions. [2024-11-20 19:11:11,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-20 19:11:11,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:11,752 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:11,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-20 19:11:11,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-20 19:11:11,953 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:11,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:11,953 INFO L85 PathProgramCache]: Analyzing trace with hash 2065289435, now seen corresponding path program 1 times [2024-11-20 19:11:11,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:11,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693512722] [2024-11-20 19:11:11,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:11,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:11:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 19:11:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 19:11:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 19:11:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 19:11:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 19:11:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 19:11:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-20 19:11:12,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:12,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693512722] [2024-11-20 19:11:12,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693512722] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:12,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662788894] [2024-11-20 19:11:12,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:12,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:12,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:12,111 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) [2024-11-20 19:11:12,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-20 19:11:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:12,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-20 19:11:12,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:12,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662788894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:12,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:12,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-20 19:11:12,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798332471] [2024-11-20 19:11:12,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:12,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:12,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:12,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:12,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:12,280 INFO L87 Difference]: Start difference. First operand 291 states and 448 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-20 19:11:12,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:12,340 INFO L93 Difference]: Finished difference Result 294 states and 451 transitions. [2024-11-20 19:11:12,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:12,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2024-11-20 19:11:12,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:12,345 INFO L225 Difference]: With dead ends: 294 [2024-11-20 19:11:12,345 INFO L226 Difference]: Without dead ends: 293 [2024-11-20 19:11:12,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:12,346 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 7 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:12,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 846 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:12,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-20 19:11:12,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 292. [2024-11-20 19:11:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 228 states have (on average 1.5482456140350878) internal successors, (353), 235 states have internal predecessors, (353), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 19:11:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 449 transitions. [2024-11-20 19:11:12,362 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 449 transitions. Word has length 117 [2024-11-20 19:11:12,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:12,362 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 449 transitions. [2024-11-20 19:11:12,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-20 19:11:12,363 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 449 transitions. [2024-11-20 19:11:12,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 19:11:12,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:12,367 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:12,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-20 19:11:12,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:12,568 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:12,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:12,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1738973469, now seen corresponding path program 1 times [2024-11-20 19:11:12,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:12,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371575692] [2024-11-20 19:11:12,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:12,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:11:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 19:11:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 19:11:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 19:11:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 19:11:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 19:11:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 19:11:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-20 19:11:12,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:12,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371575692] [2024-11-20 19:11:12,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371575692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:12,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174404201] [2024-11-20 19:11:12,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:12,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:12,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:12,687 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) [2024-11-20 19:11:12,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-20 19:11:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 19:11:12,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-20 19:11:12,839 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:12,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174404201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:12,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:12,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-20 19:11:12,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936544618] [2024-11-20 19:11:12,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:12,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 19:11:12,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:12,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 19:11:12,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-20 19:11:12,840 INFO L87 Difference]: Start difference. First operand 292 states and 449 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-20 19:11:12,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:12,876 INFO L93 Difference]: Finished difference Result 302 states and 465 transitions. [2024-11-20 19:11:12,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:12,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-11-20 19:11:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:12,879 INFO L225 Difference]: With dead ends: 302 [2024-11-20 19:11:12,880 INFO L226 Difference]: Without dead ends: 301 [2024-11-20 19:11:12,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-20 19:11:12,881 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 12 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:12,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1144 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:12,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-20 19:11:12,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 293. [2024-11-20 19:11:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 229 states have (on average 1.5458515283842795) internal successors, (354), 236 states have internal predecessors, (354), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 19:11:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 450 transitions. [2024-11-20 19:11:12,888 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 450 transitions. Word has length 118 [2024-11-20 19:11:12,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:12,889 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 450 transitions. [2024-11-20 19:11:12,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-20 19:11:12,889 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 450 transitions. [2024-11-20 19:11:12,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 19:11:12,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:12,890 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:12,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-20 19:11:13,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-20 19:11:13,095 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:13,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:13,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1551181597, now seen corresponding path program 1 times [2024-11-20 19:11:13,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:13,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678104289] [2024-11-20 19:11:13,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:13,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:11:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 19:11:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 19:11:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 19:11:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 19:11:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 19:11:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 19:11:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-20 19:11:13,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:13,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678104289] [2024-11-20 19:11:13,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678104289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:13,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490086291] [2024-11-20 19:11:13,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:13,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:13,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:13,210 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) [2024-11-20 19:11:13,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-20 19:11:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 19:11:13,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-20 19:11:13,400 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:13,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490086291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:13,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:13,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-20 19:11:13,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751520418] [2024-11-20 19:11:13,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:13,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 19:11:13,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:13,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 19:11:13,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-20 19:11:13,401 INFO L87 Difference]: Start difference. First operand 293 states and 450 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-20 19:11:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:13,440 INFO L93 Difference]: Finished difference Result 299 states and 462 transitions. [2024-11-20 19:11:13,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:13,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-11-20 19:11:13,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:13,442 INFO L225 Difference]: With dead ends: 299 [2024-11-20 19:11:13,442 INFO L226 Difference]: Without dead ends: 298 [2024-11-20 19:11:13,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-20 19:11:13,443 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 10 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:13,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1123 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:13,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-20 19:11:13,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 291. [2024-11-20 19:11:13,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 228 states have (on average 1.543859649122807) internal successors, (352), 234 states have internal predecessors, (352), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 19:11:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 448 transitions. [2024-11-20 19:11:13,451 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 448 transitions. Word has length 118 [2024-11-20 19:11:13,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:13,451 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 448 transitions. [2024-11-20 19:11:13,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-20 19:11:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 448 transitions. [2024-11-20 19:11:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 19:11:13,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:13,453 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:13,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-20 19:11:13,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:13,654 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:13,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:13,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1926396969, now seen corresponding path program 1 times [2024-11-20 19:11:13,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:13,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976950577] [2024-11-20 19:11:13,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:13,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:11:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 19:11:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 19:11:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 19:11:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 19:11:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 19:11:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 19:11:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-20 19:11:13,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:13,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976950577] [2024-11-20 19:11:13,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976950577] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:13,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14299150] [2024-11-20 19:11:13,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:13,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:13,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:13,759 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) [2024-11-20 19:11:13,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-20 19:11:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 19:11:13,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-20 19:11:13,978 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:13,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14299150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:13,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:13,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-20 19:11:13,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289917054] [2024-11-20 19:11:13,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:13,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 19:11:13,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:13,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 19:11:13,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-20 19:11:13,979 INFO L87 Difference]: Start difference. First operand 291 states and 448 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-20 19:11:14,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:14,025 INFO L93 Difference]: Finished difference Result 505 states and 779 transitions. [2024-11-20 19:11:14,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 19:11:14,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 119 [2024-11-20 19:11:14,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:14,027 INFO L225 Difference]: With dead ends: 505 [2024-11-20 19:11:14,027 INFO L226 Difference]: Without dead ends: 304 [2024-11-20 19:11:14,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-20 19:11:14,028 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 16 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:14,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1428 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-20 19:11:14,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 296. [2024-11-20 19:11:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 232 states have (on average 1.5387931034482758) internal successors, (357), 238 states have internal predecessors, (357), 49 states have call successors, (49), 14 states have call predecessors, (49), 14 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-20 19:11:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 455 transitions. [2024-11-20 19:11:14,035 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 455 transitions. Word has length 119 [2024-11-20 19:11:14,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:14,036 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 455 transitions. [2024-11-20 19:11:14,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-20 19:11:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 455 transitions. [2024-11-20 19:11:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 19:11:14,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:14,037 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:14,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-20 19:11:14,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:14,238 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:14,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:14,239 INFO L85 PathProgramCache]: Analyzing trace with hash 841989591, now seen corresponding path program 1 times [2024-11-20 19:11:14,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:14,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79232370] [2024-11-20 19:11:14,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:14,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:11:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 19:11:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 19:11:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 19:11:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 19:11:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 19:11:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 19:11:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-20 19:11:14,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:14,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79232370] [2024-11-20 19:11:14,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79232370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:14,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221421595] [2024-11-20 19:11:14,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:14,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:14,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:14,376 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) [2024-11-20 19:11:14,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-20 19:11:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 19:11:14,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:14,593 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-20 19:11:14,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:14,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221421595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:14,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:14,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-20 19:11:14,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742256956] [2024-11-20 19:11:14,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:14,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 19:11:14,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:14,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 19:11:14,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-20 19:11:14,596 INFO L87 Difference]: Start difference. First operand 296 states and 455 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-20 19:11:14,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:14,641 INFO L93 Difference]: Finished difference Result 307 states and 470 transitions. [2024-11-20 19:11:14,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 19:11:14,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 119 [2024-11-20 19:11:14,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:14,644 INFO L225 Difference]: With dead ends: 307 [2024-11-20 19:11:14,644 INFO L226 Difference]: Without dead ends: 306 [2024-11-20 19:11:14,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-20 19:11:14,645 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 18 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:14,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1370 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-20 19:11:14,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 293. [2024-11-20 19:11:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 230 states have (on average 1.5391304347826087) internal successors, (354), 236 states have internal predecessors, (354), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 19:11:14,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 450 transitions. [2024-11-20 19:11:14,655 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 450 transitions. Word has length 119 [2024-11-20 19:11:14,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:14,655 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 450 transitions. [2024-11-20 19:11:14,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-20 19:11:14,656 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 450 transitions. [2024-11-20 19:11:14,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-20 19:11:14,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:14,657 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:14,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-20 19:11:14,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:14,862 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-20 19:11:14,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:14,862 INFO L85 PathProgramCache]: Analyzing trace with hash -696507949, now seen corresponding path program 1 times [2024-11-20 19:11:14,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:14,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24147206] [2024-11-20 19:11:14,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:14,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:11:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 19:11:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 19:11:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 19:11:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 19:11:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 19:11:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 19:11:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-20 19:11:14,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:14,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24147206] [2024-11-20 19:11:14,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24147206] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:14,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789706842] [2024-11-20 19:11:14,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:14,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:14,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:14,980 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) [2024-11-20 19:11:14,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-20 19:11:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 19:11:15,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-20 19:11:15,162 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:15,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789706842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:15,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:15,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2024-11-20 19:11:15,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750320885] [2024-11-20 19:11:15,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:15,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 19:11:15,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:15,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 19:11:15,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-20 19:11:15,164 INFO L87 Difference]: Start difference. First operand 293 states and 450 transitions. Second operand has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-20 19:11:15,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:15,211 INFO L93 Difference]: Finished difference Result 307 states and 475 transitions. [2024-11-20 19:11:15,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 19:11:15,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 121 [2024-11-20 19:11:15,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:15,213 INFO L225 Difference]: With dead ends: 307 [2024-11-20 19:11:15,213 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 19:11:15,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-20 19:11:15,214 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 28 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:15,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1656 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 19:11:15,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 19:11:15,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 19:11:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 19:11:15,215 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2024-11-20 19:11:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:15,215 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 19:11:15,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-20 19:11:15,215 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 19:11:15,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 19:11:15,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-20 19:11:15,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-20 19:11:15,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-20 19:11:15,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-20 19:11:15,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-20 19:11:15,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-20 19:11:15,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-20 19:11:15,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-20 19:11:15,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-20 19:11:15,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:15,422 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:15,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 19:11:15,638 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 19:11:15,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:11:15 BoogieIcfgContainer [2024-11-20 19:11:15,655 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 19:11:15,655 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 19:11:15,655 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 19:11:15,655 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 19:11:15,656 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:11:02" (3/4) ... [2024-11-20 19:11:15,657 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 19:11:15,660 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_int8 [2024-11-20 19:11:15,660 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_bool [2024-11-20 19:11:15,660 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert [2024-11-20 19:11:15,661 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure add_history_type [2024-11-20 19:11:15,661 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-20 19:11:15,661 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure write_history_bool [2024-11-20 19:11:15,667 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-20 19:11:15,668 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-20 19:11:15,669 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 19:11:15,669 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 19:11:15,704 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2024-11-20 19:11:15,743 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2024-11-20 19:11:15,781 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 19:11:15,781 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 19:11:15,781 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 19:11:15,781 INFO L158 Benchmark]: Toolchain (without parser) took 13987.42ms. Allocated memory was 153.1MB in the beginning and 383.8MB in the end (delta: 230.7MB). Free memory was 80.4MB in the beginning and 161.8MB in the end (delta: -81.3MB). Peak memory consumption was 149.5MB. Max. memory is 16.1GB. [2024-11-20 19:11:15,782 INFO L158 Benchmark]: CDTParser took 0.88ms. Allocated memory is still 153.1MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 19:11:15,782 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.10ms. Allocated memory is still 153.1MB. Free memory was 80.2MB in the beginning and 61.5MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 19:11:15,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.56ms. Allocated memory is still 153.1MB. Free memory was 61.5MB in the beginning and 58.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 19:11:15,782 INFO L158 Benchmark]: Boogie Preprocessor took 97.89ms. Allocated memory was 153.1MB in the beginning and 216.0MB in the end (delta: 62.9MB). Free memory was 58.1MB in the beginning and 185.0MB in the end (delta: -126.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-20 19:11:15,782 INFO L158 Benchmark]: RCFGBuilder took 623.37ms. Allocated memory is still 216.0MB. Free memory was 185.0MB in the beginning and 144.1MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-20 19:11:15,782 INFO L158 Benchmark]: TraceAbstraction took 12715.60ms. Allocated memory was 216.0MB in the beginning and 383.8MB in the end (delta: 167.8MB). Free memory was 143.1MB in the beginning and 173.3MB in the end (delta: -30.2MB). Peak memory consumption was 138.6MB. Max. memory is 16.1GB. [2024-11-20 19:11:15,782 INFO L158 Benchmark]: Witness Printer took 125.82ms. Allocated memory is still 383.8MB. Free memory was 173.3MB in the beginning and 161.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-20 19:11:15,783 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.88ms. Allocated memory is still 153.1MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.10ms. Allocated memory is still 153.1MB. Free memory was 80.2MB in the beginning and 61.5MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.56ms. Allocated memory is still 153.1MB. Free memory was 61.5MB in the beginning and 58.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.89ms. Allocated memory was 153.1MB in the beginning and 216.0MB in the end (delta: 62.9MB). Free memory was 58.1MB in the beginning and 185.0MB in the end (delta: -126.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * RCFGBuilder took 623.37ms. Allocated memory is still 216.0MB. Free memory was 185.0MB in the beginning and 144.1MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12715.60ms. Allocated memory was 216.0MB in the beginning and 383.8MB in the end (delta: 167.8MB). Free memory was 143.1MB in the beginning and 173.3MB in the end (delta: -30.2MB). Peak memory consumption was 138.6MB. Max. memory is 16.1GB. * Witness Printer took 125.82ms. Allocated memory is still 383.8MB. Free memory was 173.3MB in the beginning and 161.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 194 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 398 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 363 mSDsluCounter, 21743 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15454 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1000 IncrementalHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 6289 mSDtfsCounter, 1000 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2509 GetRequests, 2351 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=20, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 122 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 3997 NumberOfCodeBlocks, 3997 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3956 ConstructedInterpolants, 0 QuantifiedInterpolants, 6034 SizeOfPredicates, 0 NumberOfNonLiveVariables, 10605 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 41 InterpolantComputations, 22 PerfectInterpolantSequences, 1814/1875 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 104]: Procedure Contract for read_history_int8 Derived contract for procedure read_history_int8. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 124]: Procedure Contract for read_history_bool Derived contract for procedure read_history_bool. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 530]: Procedure Contract for assert Derived contract for procedure assert. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 60]: Procedure Contract for add_history_type Derived contract for procedure add_history_type. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 36]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 179]: Procedure Contract for write_history_bool Derived contract for procedure write_history_bool. Ensures: (((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) RESULT: Ultimate proved your program to be correct! [2024-11-20 19:11:15,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE