./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.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.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 6ff1cedc7411bab7c4dff496b498f1be2a7af9e572a1448d390780005c75fec3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 19:11:05,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 19:11:05,355 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:05,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 19:11:05,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 19:11:05,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 19:11:05,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 19:11:05,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 19:11:05,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 19:11:05,398 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 19:11:05,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 19:11:05,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 19:11:05,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 19:11:05,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 19:11:05,404 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 19:11:05,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 19:11:05,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 19:11:05,405 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 19:11:05,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 19:11:05,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 19:11:05,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 19:11:05,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 19:11:05,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 19:11:05,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 19:11:05,409 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 19:11:05,409 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 19:11:05,409 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 19:11:05,409 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 19:11:05,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 19:11:05,410 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 19:11:05,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 19:11:05,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 19:11:05,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 19:11:05,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 19:11:05,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:11:05,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 19:11:05,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 19:11:05,414 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 19:11:05,414 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 19:11:05,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 19:11:05,415 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 19:11:05,415 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 19:11:05,415 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 19:11:05,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 19:11:05,416 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 -> 6ff1cedc7411bab7c4dff496b498f1be2a7af9e572a1448d390780005c75fec3 [2024-11-20 19:11:05,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 19:11:05,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 19:11:05,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 19:11:05,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 19:11:05,724 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 19:11:05,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2024-11-20 19:11:07,121 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 19:11:07,374 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 19:11:07,376 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2024-11-20 19:11:07,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06998e92c/e4159473223e4f0aba34e84f45d5b870/FLAG81e7633e7 [2024-11-20 19:11:07,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06998e92c/e4159473223e4f0aba34e84f45d5b870 [2024-11-20 19:11:07,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 19:11:07,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 19:11:07,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 19:11:07,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 19:11:07,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 19:11:07,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:11:07" (1/1) ... [2024-11-20 19:11:07,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c88871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:07, skipping insertion in model container [2024-11-20 19:11:07,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:11:07" (1/1) ... [2024-11-20 19:11:07,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 19:11:07,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:11:07,992 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 19:11:08,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:11:08,096 INFO L204 MainTranslator]: Completed translation [2024-11-20 19:11:08,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:08 WrapperNode [2024-11-20 19:11:08,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 19:11:08,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 19:11:08,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 19:11:08,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 19:11:08,109 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:08" (1/1) ... [2024-11-20 19:11:08,124 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:08" (1/1) ... [2024-11-20 19:11:08,171 INFO L138 Inliner]: procedures = 28, calls = 52, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 433 [2024-11-20 19:11:08,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 19:11:08,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 19:11:08,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 19:11:08,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 19:11:08,182 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:08" (1/1) ... [2024-11-20 19:11:08,182 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:08" (1/1) ... [2024-11-20 19:11:08,188 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:08" (1/1) ... [2024-11-20 19:11:08,211 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:08,212 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:08" (1/1) ... [2024-11-20 19:11:08,212 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:08" (1/1) ... [2024-11-20 19:11:08,228 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:08" (1/1) ... [2024-11-20 19:11:08,237 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:08" (1/1) ... [2024-11-20 19:11:08,243 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:08" (1/1) ... [2024-11-20 19:11:08,249 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:08" (1/1) ... [2024-11-20 19:11:08,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 19:11:08,277 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 19:11:08,279 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 19:11:08,279 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 19:11:08,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:08" (1/1) ... [2024-11-20 19:11:08,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:11:08,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:08,313 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:08,316 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:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 19:11:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-11-20 19:11:08,366 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-11-20 19:11:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-20 19:11:08,367 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-20 19:11:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-11-20 19:11:08,367 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-11-20 19:11:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-11-20 19:11:08,367 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-11-20 19:11:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-11-20 19:11:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-11-20 19:11:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 19:11:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 19:11:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 19:11:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 19:11:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 19:11:08,469 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 19:11:08,470 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 19:11:09,080 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-11-20 19:11:09,081 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 19:11:09,103 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 19:11:09,103 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 19:11:09,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:11:09 BoogieIcfgContainer [2024-11-20 19:11:09,103 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 19:11:09,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 19:11:09,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 19:11:09,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 19:11:09,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:11:07" (1/3) ... [2024-11-20 19:11:09,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:11:09, skipping insertion in model container [2024-11-20 19:11:09,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:08" (2/3) ... [2024-11-20 19:11:09,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:11:09, skipping insertion in model container [2024-11-20 19:11:09,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:11:09" (3/3) ... [2024-11-20 19:11:09,113 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2024-11-20 19:11:09,127 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 19:11:09,127 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-20 19:11:09,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 19:11:09,185 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;@7e94ad95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 19:11:09,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-20 19:11:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 143 states have (on average 1.6013986013986015) internal successors, (229), 155 states have internal predecessors, (229), 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:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 19:11:09,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:09,200 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:09,201 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:09,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:09,206 INFO L85 PathProgramCache]: Analyzing trace with hash 462902644, now seen corresponding path program 1 times [2024-11-20 19:11:09,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:09,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177907723] [2024-11-20 19:11:09,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:09,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,566 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:09,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:09,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177907723] [2024-11-20 19:11:09,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177907723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:09,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:11:09,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 19:11:09,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233150931] [2024-11-20 19:11:09,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:09,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:09,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:09,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:09,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 19:11:09,604 INFO L87 Difference]: Start difference. First operand has 195 states, 143 states have (on average 1.6013986013986015) internal successors, (229), 155 states have internal predecessors, (229), 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:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:09,735 INFO L93 Difference]: Finished difference Result 406 states and 669 transitions. [2024-11-20 19:11:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:09,737 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:09,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:09,748 INFO L225 Difference]: With dead ends: 406 [2024-11-20 19:11:09,749 INFO L226 Difference]: Without dead ends: 213 [2024-11-20 19:11:09,755 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:09,758 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 37 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 874 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:09,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 874 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:09,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-20 19:11:09,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 206. [2024-11-20 19:11:09,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 153 states have (on average 1.5751633986928104) internal successors, (241), 164 states have internal predecessors, (241), 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:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 317 transitions. [2024-11-20 19:11:09,817 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 317 transitions. Word has length 11 [2024-11-20 19:11:09,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:09,817 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 317 transitions. [2024-11-20 19:11:09,817 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:09,818 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 317 transitions. [2024-11-20 19:11:09,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 19:11:09,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:09,821 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:09,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 19:11:09,822 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:09,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:09,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1750537448, now seen corresponding path program 1 times [2024-11-20 19:11:09,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:09,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166745487] [2024-11-20 19:11:09,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:09,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-20 19:11:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:09,972 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:09,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:09,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166745487] [2024-11-20 19:11:09,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166745487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:09,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:11:09,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 19:11:09,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106902170] [2024-11-20 19:11:09,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:09,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:09,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:09,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:09,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 19:11:09,979 INFO L87 Difference]: Start difference. First operand 206 states and 317 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:10,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:10,058 INFO L93 Difference]: Finished difference Result 435 states and 679 transitions. [2024-11-20 19:11:10,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:10,059 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:10,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:10,062 INFO L225 Difference]: With dead ends: 435 [2024-11-20 19:11:10,062 INFO L226 Difference]: Without dead ends: 241 [2024-11-20 19:11:10,063 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:10,067 INFO L432 NwaCegarLoop]: 294 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, 874 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:10,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 874 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:10,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-20 19:11:10,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 237. [2024-11-20 19:11:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 179 states have (on average 1.541899441340782) internal successors, (276), 190 states have internal predecessors, (276), 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:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 362 transitions. [2024-11-20 19:11:10,108 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 362 transitions. Word has length 16 [2024-11-20 19:11:10,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:10,109 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 362 transitions. [2024-11-20 19:11:10,109 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:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 362 transitions. [2024-11-20 19:11:10,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 19:11:10,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:10,111 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:10,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 19:11:10,112 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:10,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:10,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1874375666, now seen corresponding path program 1 times [2024-11-20 19:11:10,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:10,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961699383] [2024-11-20 19:11:10,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:10,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-20 19:11:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,297 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:10,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:10,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961699383] [2024-11-20 19:11:10,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961699383] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:10,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050140126] [2024-11-20 19:11:10,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:10,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:10,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:10,304 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:10,306 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:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 19:11:10,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:10,522 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:10,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:10,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050140126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:10,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:10,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-20 19:11:10,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865152463] [2024-11-20 19:11:10,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:10,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 19:11:10,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:10,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 19:11:10,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:10,526 INFO L87 Difference]: Start difference. First operand 237 states and 362 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:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:10,559 INFO L93 Difference]: Finished difference Result 241 states and 368 transitions. [2024-11-20 19:11:10,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:10,559 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:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:10,564 INFO L225 Difference]: With dead ends: 241 [2024-11-20 19:11:10,565 INFO L226 Difference]: Without dead ends: 240 [2024-11-20 19:11:10,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:10,566 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 19 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 836 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:10,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 836 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:10,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-20 19:11:10,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 236. [2024-11-20 19:11:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 179 states have (on average 1.5251396648044693) internal successors, (273), 189 states have internal predecessors, (273), 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:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 359 transitions. [2024-11-20 19:11:10,592 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 359 transitions. Word has length 29 [2024-11-20 19:11:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:10,593 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 359 transitions. [2024-11-20 19:11:10,593 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:10,593 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 359 transitions. [2024-11-20 19:11:10,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 19:11:10,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:10,599 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:10,607 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:10,799 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:10,800 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:10,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:10,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2023897026, now seen corresponding path program 1 times [2024-11-20 19:11:10,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:10,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593921611] [2024-11-20 19:11:10,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:10,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-20 19:11:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:10,901 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:10,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:10,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593921611] [2024-11-20 19:11:10,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593921611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:10,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:11:10,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 19:11:10,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77590996] [2024-11-20 19:11:10,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:10,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:10,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:10,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:10,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 19:11:10,904 INFO L87 Difference]: Start difference. First operand 236 states and 359 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:10,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:10,930 INFO L93 Difference]: Finished difference Result 240 states and 365 transitions. [2024-11-20 19:11:10,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:10,931 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:10,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:10,933 INFO L225 Difference]: With dead ends: 240 [2024-11-20 19:11:10,933 INFO L226 Difference]: Without dead ends: 239 [2024-11-20 19:11:10,933 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:10,937 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 18 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 838 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:10,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 838 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:10,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-20 19:11:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 206. [2024-11-20 19:11:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 155 states have (on average 1.5290322580645161) internal successors, (237), 164 states have internal predecessors, (237), 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:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 313 transitions. [2024-11-20 19:11:10,959 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 313 transitions. Word has length 30 [2024-11-20 19:11:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:10,959 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 313 transitions. [2024-11-20 19:11:10,959 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:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 313 transitions. [2024-11-20 19:11:10,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-20 19:11:10,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:10,964 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, 1] [2024-11-20 19:11:10,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 19:11:10,965 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:10,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:10,965 INFO L85 PathProgramCache]: Analyzing trace with hash 205728696, now seen corresponding path program 1 times [2024-11-20 19:11:10,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:10,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522475703] [2024-11-20 19:11:10,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:10,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 19:11:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 19:11:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 19:11:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 19:11:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 19:11:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 19:11:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,201 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:11,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:11,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522475703] [2024-11-20 19:11:11,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522475703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:11,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896776716] [2024-11-20 19:11:11,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:11,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:11,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:11,205 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:11,215 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:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:11,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:11,417 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:11,417 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:11,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896776716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:11,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:11,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-20 19:11:11,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147392783] [2024-11-20 19:11:11,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:11,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:11,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:11,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:11,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:11,424 INFO L87 Difference]: Start difference. First operand 206 states and 313 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:11,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:11,485 INFO L93 Difference]: Finished difference Result 359 states and 554 transitions. [2024-11-20 19:11:11,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:11,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 92 [2024-11-20 19:11:11,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:11,488 INFO L225 Difference]: With dead ends: 359 [2024-11-20 19:11:11,488 INFO L226 Difference]: Without dead ends: 213 [2024-11-20 19:11:11,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 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:11,493 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 10 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 844 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:11,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 844 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:11,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-20 19:11:11,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-20 19:11:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 160 states have (on average 1.53125) internal successors, (245), 170 states have internal predecessors, (245), 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:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 323 transitions. [2024-11-20 19:11:11,508 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 323 transitions. Word has length 92 [2024-11-20 19:11:11,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:11,509 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 323 transitions. [2024-11-20 19:11:11,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:11,509 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 323 transitions. [2024-11-20 19:11:11,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-20 19:11:11,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:11,512 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, 1] [2024-11-20 19:11:11,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 19:11:11,713 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:11,713 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:11,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:11,714 INFO L85 PathProgramCache]: Analyzing trace with hash -527112528, now seen corresponding path program 1 times [2024-11-20 19:11:11,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:11,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190220489] [2024-11-20 19:11:11,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:11,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:11:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 19:11:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-20 19:11:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 19:11:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 19:11:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:11,934 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:11,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:11,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190220489] [2024-11-20 19:11:11,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190220489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:11,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384187438] [2024-11-20 19:11:11,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:11,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:11,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:11,937 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:11,939 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:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:12,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:12,179 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:12,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:12,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384187438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:12,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:12,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-20 19:11:12,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940360615] [2024-11-20 19:11:12,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:12,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:12,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:12,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:12,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:12,186 INFO L87 Difference]: Start difference. First operand 213 states and 323 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:12,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:12,247 INFO L93 Difference]: Finished difference Result 373 states and 573 transitions. [2024-11-20 19:11:12,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:12,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:12,250 INFO L225 Difference]: With dead ends: 373 [2024-11-20 19:11:12,251 INFO L226 Difference]: Without dead ends: 220 [2024-11-20 19:11:12,252 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:12,252 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 8 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 839 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:12,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 839 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:12,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-20 19:11:12,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-11-20 19:11:12,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 165 states have (on average 1.5333333333333334) internal successors, (253), 176 states have internal predecessors, (253), 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:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 333 transitions. [2024-11-20 19:11:12,266 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 333 transitions. Word has length 94 [2024-11-20 19:11:12,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:12,267 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 333 transitions. [2024-11-20 19:11:12,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 333 transitions. [2024-11-20 19:11:12,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-20 19:11:12,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:12,268 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, 1] [2024-11-20 19:11:12,278 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:12,469 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:12,470 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:12,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:12,470 INFO L85 PathProgramCache]: Analyzing trace with hash -747242443, now seen corresponding path program 1 times [2024-11-20 19:11:12,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:12,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067559593] [2024-11-20 19:11:12,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:12,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:12,592 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 26 [2024-11-20 19:11:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 19:11:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 19:11:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 19:11:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 19:11:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 19:11:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,659 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:12,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:12,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067559593] [2024-11-20 19:11:12,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067559593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:12,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178682843] [2024-11-20 19:11:12,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:12,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:12,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:12,666 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:12,668 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:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:12,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:12,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:12,858 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:12,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:12,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178682843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:12,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:12,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-20 19:11:12,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534589385] [2024-11-20 19:11:12,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:12,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:12,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:12,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:12,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:12,860 INFO L87 Difference]: Start difference. First operand 220 states and 333 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:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:12,964 INFO L93 Difference]: Finished difference Result 398 states and 623 transitions. [2024-11-20 19:11:12,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:12,965 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 95 [2024-11-20 19:11:12,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:12,967 INFO L225 Difference]: With dead ends: 398 [2024-11-20 19:11:12,967 INFO L226 Difference]: Without dead ends: 238 [2024-11-20 19:11:12,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 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:12,969 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 39 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 800 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:12,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 800 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:12,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-20 19:11:12,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-11-20 19:11:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 177 states have (on average 1.5480225988700564) internal successors, (274), 188 states have internal predecessors, (274), 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:12,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 356 transitions. [2024-11-20 19:11:12,980 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 356 transitions. Word has length 95 [2024-11-20 19:11:12,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:12,981 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 356 transitions. [2024-11-20 19:11:12,981 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:12,981 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 356 transitions. [2024-11-20 19:11:12,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 19:11:12,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:12,983 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, 1] [2024-11-20 19:11:12,992 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:13,183 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:13,184 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:13,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:13,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2094961184, now seen corresponding path program 1 times [2024-11-20 19:11:13,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:13,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912931042] [2024-11-20 19:11:13,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:13,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 19:11:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 19:11:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 19:11:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 19:11:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 19:11:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,402 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:13,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:13,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912931042] [2024-11-20 19:11:13,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912931042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:13,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867895693] [2024-11-20 19:11:13,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:13,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:13,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:13,406 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:13,407 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:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:13,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:13,587 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:13,587 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:13,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867895693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:13,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:13,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-20 19:11:13,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595953833] [2024-11-20 19:11:13,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:13,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:13,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:13,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:13,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:13,590 INFO L87 Difference]: Start difference. First operand 234 states and 356 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:13,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:13,656 INFO L93 Difference]: Finished difference Result 473 states and 735 transitions. [2024-11-20 19:11:13,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:13,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 98 [2024-11-20 19:11:13,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:13,659 INFO L225 Difference]: With dead ends: 473 [2024-11-20 19:11:13,659 INFO L226 Difference]: Without dead ends: 258 [2024-11-20 19:11:13,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 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:13,662 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 21 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 820 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:13,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 820 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:13,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-20 19:11:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-11-20 19:11:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 197 states have (on average 1.5634517766497462) internal successors, (308), 208 states have internal predecessors, (308), 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:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 394 transitions. [2024-11-20 19:11:13,675 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 394 transitions. Word has length 98 [2024-11-20 19:11:13,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:13,675 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 394 transitions. [2024-11-20 19:11:13,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:13,675 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 394 transitions. [2024-11-20 19:11:13,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 19:11:13,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:13,677 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, 1] [2024-11-20 19:11:13,686 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:13,877 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:13,878 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:13,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:13,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1724811394, now seen corresponding path program 1 times [2024-11-20 19:11:13,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:13,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627034283] [2024-11-20 19:11:13,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:13,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:13,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 19:11:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 19:11:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 19:11:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 19:11:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 19:11:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,061 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:14,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:14,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627034283] [2024-11-20 19:11:14,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627034283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:14,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467751468] [2024-11-20 19:11:14,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:14,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:14,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:14,064 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:14,067 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:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:14,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:14,250 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:14,250 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:14,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467751468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:14,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:14,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-20 19:11:14,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374225111] [2024-11-20 19:11:14,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:14,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:14,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:14,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:14,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:14,252 INFO L87 Difference]: Start difference. First operand 258 states and 394 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:14,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:14,316 INFO L93 Difference]: Finished difference Result 517 states and 800 transitions. [2024-11-20 19:11:14,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:14,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 100 [2024-11-20 19:11:14,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:14,319 INFO L225 Difference]: With dead ends: 517 [2024-11-20 19:11:14,319 INFO L226 Difference]: Without dead ends: 278 [2024-11-20 19:11:14,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 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:14,321 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 19 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 807 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:14,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 807 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:14,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-20 19:11:14,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-11-20 19:11:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 213 states have (on average 1.568075117370892) internal successors, (334), 224 states have internal predecessors, (334), 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:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 424 transitions. [2024-11-20 19:11:14,333 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 424 transitions. Word has length 100 [2024-11-20 19:11:14,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:14,334 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 424 transitions. [2024-11-20 19:11:14,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:14,334 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 424 transitions. [2024-11-20 19:11:14,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-20 19:11:14,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:14,336 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:14,345 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:14,536 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:14,537 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:14,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:14,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1043071740, now seen corresponding path program 1 times [2024-11-20 19:11:14,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:14,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417098206] [2024-11-20 19:11:14,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:14,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 19:11:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 19:11:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 19:11:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 19:11:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 19:11:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,704 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:14,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:14,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417098206] [2024-11-20 19:11:14,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417098206] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:14,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145253496] [2024-11-20 19:11:14,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:14,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:14,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:14,708 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:14,709 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:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:14,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:14,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:14,878 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:14,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:14,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145253496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:14,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:14,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-20 19:11:14,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978821316] [2024-11-20 19:11:14,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:14,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:14,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:14,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:14,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:14,880 INFO L87 Difference]: Start difference. First operand 278 states and 424 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:14,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:14,914 INFO L93 Difference]: Finished difference Result 286 states and 439 transitions. [2024-11-20 19:11:14,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:14,915 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:14,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:14,917 INFO L225 Difference]: With dead ends: 286 [2024-11-20 19:11:14,918 INFO L226 Difference]: Without dead ends: 285 [2024-11-20 19:11:14,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 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:14,919 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 12 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 827 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:14,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 827 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:14,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-20 19:11:14,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 277. [2024-11-20 19:11:14,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 213 states have (on average 1.5633802816901408) internal successors, (333), 223 states have internal predecessors, (333), 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:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 423 transitions. [2024-11-20 19:11:14,930 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 423 transitions. Word has length 101 [2024-11-20 19:11:14,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:14,930 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 423 transitions. [2024-11-20 19:11:14,930 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:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 423 transitions. [2024-11-20 19:11:14,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 19:11:14,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:14,932 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, 1] [2024-11-20 19:11:14,941 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:15,133 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:15,134 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:15,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:15,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2024514750, now seen corresponding path program 1 times [2024-11-20 19:11:15,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:15,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874700955] [2024-11-20 19:11:15,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:15,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 19:11:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 19:11:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 19:11:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 19:11:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 19:11:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,325 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:15,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:15,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874700955] [2024-11-20 19:11:15,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874700955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:15,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884311486] [2024-11-20 19:11:15,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:15,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:15,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:15,328 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:15,329 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:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:15,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:15,510 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:15,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:15,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884311486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:15,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:15,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-20 19:11:15,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994427698] [2024-11-20 19:11:15,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:15,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:15,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:15,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:15,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:15,514 INFO L87 Difference]: Start difference. First operand 277 states and 423 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, (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:15,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:15,550 INFO L93 Difference]: Finished difference Result 474 states and 728 transitions. [2024-11-20 19:11:15,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:15,551 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, (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 102 [2024-11-20 19:11:15,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:15,553 INFO L225 Difference]: With dead ends: 474 [2024-11-20 19:11:15,553 INFO L226 Difference]: Without dead ends: 287 [2024-11-20 19:11:15,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 121 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:15,555 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 11 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:15,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 858 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:15,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-20 19:11:15,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-11-20 19:11:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 222 states have (on average 1.5585585585585586) internal successors, (346), 231 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:15,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 440 transitions. [2024-11-20 19:11:15,568 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 440 transitions. Word has length 102 [2024-11-20 19:11:15,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:15,569 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 440 transitions. [2024-11-20 19:11:15,569 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, (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:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 440 transitions. [2024-11-20 19:11:15,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 19:11:15,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:15,573 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:15,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-20 19:11:15,773 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:15,773 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:15,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:15,774 INFO L85 PathProgramCache]: Analyzing trace with hash -377532014, now seen corresponding path program 1 times [2024-11-20 19:11:15,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:15,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120729359] [2024-11-20 19:11:15,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:15,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 19:11:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 19:11:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 19:11:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 19:11:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 19:11:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 19:11:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:15,959 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:15,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:15,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120729359] [2024-11-20 19:11:15,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120729359] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:15,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967084976] [2024-11-20 19:11:15,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:15,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:15,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:15,962 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:15,963 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:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:16,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:16,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:16,166 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:16,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:16,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967084976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:16,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:16,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-20 19:11:16,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565152799] [2024-11-20 19:11:16,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:16,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:16,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:16,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:16,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:16,168 INFO L87 Difference]: Start difference. First operand 287 states and 440 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:16,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:16,217 INFO L93 Difference]: Finished difference Result 298 states and 459 transitions. [2024-11-20 19:11:16,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:16,217 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:16,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:16,220 INFO L225 Difference]: With dead ends: 298 [2024-11-20 19:11:16,220 INFO L226 Difference]: Without dead ends: 297 [2024-11-20 19:11:16,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 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:16,221 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 10 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:16,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 869 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-20 19:11:16,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 288. [2024-11-20 19:11:16,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 223 states have (on average 1.5560538116591929) internal successors, (347), 232 states have internal predecessors, (347), 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:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 441 transitions. [2024-11-20 19:11:16,236 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 441 transitions. Word has length 109 [2024-11-20 19:11:16,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:16,237 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 441 transitions. [2024-11-20 19:11:16,237 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:16,237 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 441 transitions. [2024-11-20 19:11:16,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-20 19:11:16,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:16,239 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:16,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-20 19:11:16,439 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:16,440 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:16,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:16,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1181409788, now seen corresponding path program 1 times [2024-11-20 19:11:16,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:16,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289943452] [2024-11-20 19:11:16,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:16,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:16,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:16,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:16,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:16,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:16,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:16,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:16,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 19:11:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:16,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 19:11:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:16,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 19:11:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:16,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 19:11:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:16,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 19:11:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:16,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 19:11:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:16,596 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:16,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:16,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289943452] [2024-11-20 19:11:16,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289943452] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:16,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043471069] [2024-11-20 19:11:16,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:16,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:16,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:16,598 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:16,599 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:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:16,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:16,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:16,781 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:16,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:16,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043471069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:16,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:16,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-20 19:11:16,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567237618] [2024-11-20 19:11:16,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:16,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:16,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:16,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:16,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:16,783 INFO L87 Difference]: Start difference. First operand 288 states and 441 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, (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:16,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:16,816 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2024-11-20 19:11:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:16,816 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, (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:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:16,818 INFO L225 Difference]: With dead ends: 290 [2024-11-20 19:11:16,819 INFO L226 Difference]: Without dead ends: 289 [2024-11-20 19:11:16,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 131 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:16,819 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 9 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:16,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 856 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-20 19:11:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2024-11-20 19:11:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 224 states have (on average 1.5535714285714286) internal successors, (348), 233 states have internal predecessors, (348), 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:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 442 transitions. [2024-11-20 19:11:16,831 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 442 transitions. Word has length 110 [2024-11-20 19:11:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:16,832 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 442 transitions. [2024-11-20 19:11:16,832 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, (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:16,832 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 442 transitions. [2024-11-20 19:11:16,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 19:11:16,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:16,834 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:16,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-20 19:11:17,034 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:17,035 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:17,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:17,035 INFO L85 PathProgramCache]: Analyzing trace with hash -966294506, now seen corresponding path program 1 times [2024-11-20 19:11:17,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:17,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160437179] [2024-11-20 19:11:17,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:17,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 19:11:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 19:11:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 19:11:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 19:11:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 19:11:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 19:11:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,241 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:17,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:17,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160437179] [2024-11-20 19:11:17,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160437179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:17,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701307839] [2024-11-20 19:11:17,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:17,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:17,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:17,245 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:17,246 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:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 19:11:17,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:17,439 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:17,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:17,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701307839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:17,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:17,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-20 19:11:17,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343327043] [2024-11-20 19:11:17,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:17,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 19:11:17,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:17,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 19:11:17,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-20 19:11:17,442 INFO L87 Difference]: Start difference. First operand 289 states and 442 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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:17,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:17,481 INFO L93 Difference]: Finished difference Result 294 states and 452 transitions. [2024-11-20 19:11:17,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:17,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 111 [2024-11-20 19:11:17,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:17,484 INFO L225 Difference]: With dead ends: 294 [2024-11-20 19:11:17,484 INFO L226 Difference]: Without dead ends: 293 [2024-11-20 19:11:17,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 131 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:17,485 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 12 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1087 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:17,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1087 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:17,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-20 19:11:17,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 288. [2024-11-20 19:11:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 224 states have (on average 1.5491071428571428) internal successors, (347), 232 states have internal predecessors, (347), 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:17,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 441 transitions. [2024-11-20 19:11:17,499 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 441 transitions. Word has length 111 [2024-11-20 19:11:17,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:17,499 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 441 transitions. [2024-11-20 19:11:17,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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:17,500 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 441 transitions. [2024-11-20 19:11:17,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-20 19:11:17,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:17,502 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, 1] [2024-11-20 19:11:17,512 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:17,702 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:17,703 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:17,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:17,704 INFO L85 PathProgramCache]: Analyzing trace with hash 109641720, now seen corresponding path program 1 times [2024-11-20 19:11:17,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:17,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433076922] [2024-11-20 19:11:17,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:17,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 19:11:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 19:11:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 19:11:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 19:11:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 19:11:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 19:11:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:17,861 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:17,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:17,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433076922] [2024-11-20 19:11:17,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433076922] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:17,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185909243] [2024-11-20 19:11:17,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:17,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:17,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:17,865 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:17,865 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:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:18,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 19:11:18,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:18,083 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:18,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:18,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185909243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:18,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:18,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-20 19:11:18,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331914408] [2024-11-20 19:11:18,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:18,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 19:11:18,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:18,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 19:11:18,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-20 19:11:18,085 INFO L87 Difference]: Start difference. First operand 288 states and 441 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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:18,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:18,128 INFO L93 Difference]: Finished difference Result 493 states and 759 transitions. [2024-11-20 19:11:18,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 19:11:18,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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 112 [2024-11-20 19:11:18,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:18,130 INFO L225 Difference]: With dead ends: 493 [2024-11-20 19:11:18,130 INFO L226 Difference]: Without dead ends: 295 [2024-11-20 19:11:18,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 131 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:18,132 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 29 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:18,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1119 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:18,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-20 19:11:18,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 291. [2024-11-20 19:11:18,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 227 states have (on average 1.5550660792951543) internal successors, (353), 234 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:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 449 transitions. [2024-11-20 19:11:18,142 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 449 transitions. Word has length 112 [2024-11-20 19:11:18,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:18,142 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 449 transitions. [2024-11-20 19:11:18,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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:18,143 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 449 transitions. [2024-11-20 19:11:18,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-20 19:11:18,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:18,144 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:18,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-20 19:11:18,348 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:18,349 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:18,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:18,349 INFO L85 PathProgramCache]: Analyzing trace with hash 501283168, now seen corresponding path program 1 times [2024-11-20 19:11:18,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:18,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850379832] [2024-11-20 19:11:18,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:18,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:18,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:18,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:18,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:18,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:18,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:18,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:18,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 19:11:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:18,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 19:11:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:18,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 19:11:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:18,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 19:11:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:18,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 19:11:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:18,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 19:11:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:18,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 19:11:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:18,503 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:18,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:18,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850379832] [2024-11-20 19:11:18,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850379832] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:18,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931489170] [2024-11-20 19:11:18,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:18,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:18,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:18,507 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:18,508 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:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:18,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:18,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:18,693 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:18,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:18,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931489170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:18,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:18,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-20 19:11:18,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561479359] [2024-11-20 19:11:18,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:18,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:18,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:18,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:18,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:18,695 INFO L87 Difference]: Start difference. First operand 291 states and 449 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:18,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:18,731 INFO L93 Difference]: Finished difference Result 300 states and 464 transitions. [2024-11-20 19:11:18,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:18,732 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:18,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:18,734 INFO L225 Difference]: With dead ends: 300 [2024-11-20 19:11:18,734 INFO L226 Difference]: Without dead ends: 299 [2024-11-20 19:11:18,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 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:18,735 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 8 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:18,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 835 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-20 19:11:18,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 292. [2024-11-20 19:11:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 228 states have (on average 1.5526315789473684) internal successors, (354), 235 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:18,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 450 transitions. [2024-11-20 19:11:18,747 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 450 transitions. Word has length 117 [2024-11-20 19:11:18,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:18,747 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 450 transitions. [2024-11-20 19:11:18,748 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:18,748 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 450 transitions. [2024-11-20 19:11:18,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 19:11:18,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:18,750 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:18,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:18,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:18,954 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:18,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:18,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1640090630, now seen corresponding path program 1 times [2024-11-20 19:11:18,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:18,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366078097] [2024-11-20 19:11:18,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:18,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 19:11:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 19:11:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 19:11:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 19:11:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 19:11:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 19:11:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 19:11:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,118 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:19,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:19,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366078097] [2024-11-20 19:11:19,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366078097] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:19,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659387028] [2024-11-20 19:11:19,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:19,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:19,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:19,121 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:19,123 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:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:19,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:19,318 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:19,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:19,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659387028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:19,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:19,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-20 19:11:19,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492600926] [2024-11-20 19:11:19,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:19,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:19,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:19,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:19,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:19,321 INFO L87 Difference]: Start difference. First operand 292 states and 450 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 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:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:19,350 INFO L93 Difference]: Finished difference Result 295 states and 453 transitions. [2024-11-20 19:11:19,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:19,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 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:19,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:19,352 INFO L225 Difference]: With dead ends: 295 [2024-11-20 19:11:19,353 INFO L226 Difference]: Without dead ends: 294 [2024-11-20 19:11:19,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 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:19,354 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 7 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:19,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 826 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:19,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-20 19:11:19,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2024-11-20 19:11:19,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 229 states have (on average 1.5502183406113537) internal successors, (355), 236 states have internal predecessors, (355), 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:19,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 451 transitions. [2024-11-20 19:11:19,364 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 451 transitions. Word has length 118 [2024-11-20 19:11:19,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:19,366 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 451 transitions. [2024-11-20 19:11:19,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 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:19,368 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 451 transitions. [2024-11-20 19:11:19,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 19:11:19,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:19,370 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:19,379 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:19,570 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:19,570 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:19,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:19,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1673553892, now seen corresponding path program 1 times [2024-11-20 19:11:19,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:19,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413802232] [2024-11-20 19:11:19,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:19,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 19:11:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 19:11:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 19:11:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 19:11:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 19:11:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 19:11:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 19:11:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,734 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:19,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:19,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413802232] [2024-11-20 19:11:19,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413802232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:19,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988525810] [2024-11-20 19:11:19,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:19,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:19,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:19,737 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:19,740 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:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:19,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 19:11:19,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:19,946 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:19,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:19,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988525810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:19,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:19,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-20 19:11:19,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863521967] [2024-11-20 19:11:19,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:19,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 19:11:19,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:19,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 19:11:19,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-20 19:11:19,948 INFO L87 Difference]: Start difference. First operand 293 states and 451 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:19,993 INFO L93 Difference]: Finished difference Result 301 states and 465 transitions. [2024-11-20 19:11:19,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:19,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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 119 [2024-11-20 19:11:19,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:19,996 INFO L225 Difference]: With dead ends: 301 [2024-11-20 19:11:19,996 INFO L226 Difference]: Without dead ends: 300 [2024-11-20 19:11:19,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 141 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:19,997 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 10 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:19,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1088 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:19,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-20 19:11:20,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 294. [2024-11-20 19:11:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 230 states have (on average 1.5478260869565217) internal successors, (356), 237 states have internal predecessors, (356), 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:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 452 transitions. [2024-11-20 19:11:20,007 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 452 transitions. Word has length 119 [2024-11-20 19:11:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:20,008 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 452 transitions. [2024-11-20 19:11:20,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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:20,008 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 452 transitions. [2024-11-20 19:11:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 19:11:20,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:20,010 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:20,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-20 19:11:20,210 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:20,210 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:20,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:20,211 INFO L85 PathProgramCache]: Analyzing trace with hash -774880796, now seen corresponding path program 1 times [2024-11-20 19:11:20,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:20,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153358194] [2024-11-20 19:11:20,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:20,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 19:11:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 19:11:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 19:11:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 19:11:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 19:11:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 19:11:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 19:11:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,374 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:20,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:20,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153358194] [2024-11-20 19:11:20,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153358194] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:20,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542911909] [2024-11-20 19:11:20,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:20,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:20,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:20,377 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:20,379 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:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 19:11:20,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:20,573 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:20,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:20,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542911909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:20,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:20,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-20 19:11:20,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528117651] [2024-11-20 19:11:20,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:20,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 19:11:20,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:20,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 19:11:20,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-20 19:11:20,576 INFO L87 Difference]: Start difference. First operand 294 states and 452 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:20,618 INFO L93 Difference]: Finished difference Result 302 states and 466 transitions. [2024-11-20 19:11:20,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:20,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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 119 [2024-11-20 19:11:20,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:20,621 INFO L225 Difference]: With dead ends: 302 [2024-11-20 19:11:20,621 INFO L226 Difference]: Without dead ends: 301 [2024-11-20 19:11:20,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 141 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:20,622 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 12 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:20,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1103 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:20,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-20 19:11:20,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 292. [2024-11-20 19:11:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 229 states have (on average 1.5458515283842795) internal successors, (354), 235 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:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 450 transitions. [2024-11-20 19:11:20,632 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 450 transitions. Word has length 119 [2024-11-20 19:11:20,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:20,632 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 450 transitions. [2024-11-20 19:11:20,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 450 transitions. [2024-11-20 19:11:20,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-20 19:11:20,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:20,634 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] [2024-11-20 19:11:20,643 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:20,835 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:20,835 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:20,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:20,836 INFO L85 PathProgramCache]: Analyzing trace with hash 340563446, now seen corresponding path program 1 times [2024-11-20 19:11:20,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:20,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570701764] [2024-11-20 19:11:20,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:20,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 19:11:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 19:11:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 19:11:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 19:11:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 19:11:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 19:11:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 19:11:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:20,988 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:20,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:20,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570701764] [2024-11-20 19:11:20,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570701764] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:20,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241562636] [2024-11-20 19:11:20,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:20,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:20,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:20,991 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:20,992 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:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:21,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 19:11:21,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:21,228 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:21,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:21,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241562636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:21,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:21,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-20 19:11:21,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871926701] [2024-11-20 19:11:21,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:21,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 19:11:21,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:21,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 19:11:21,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-20 19:11:21,230 INFO L87 Difference]: Start difference. First operand 292 states and 450 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:21,273 INFO L93 Difference]: Finished difference Result 297 states and 456 transitions. [2024-11-20 19:11:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 19:11:21,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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 120 [2024-11-20 19:11:21,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:21,276 INFO L225 Difference]: With dead ends: 297 [2024-11-20 19:11:21,276 INFO L226 Difference]: Without dead ends: 296 [2024-11-20 19:11:21,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 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:21,277 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 19 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:21,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1125 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:21,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-20 19:11:21,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2024-11-20 19:11:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 229 states have (on average 1.5458515283842795) internal successors, (354), 235 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:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 450 transitions. [2024-11-20 19:11:21,288 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 450 transitions. Word has length 120 [2024-11-20 19:11:21,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:21,288 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 450 transitions. [2024-11-20 19:11:21,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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:21,288 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 450 transitions. [2024-11-20 19:11:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-20 19:11:21,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:21,290 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] [2024-11-20 19:11:21,299 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:21,490 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:21,490 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:21,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:21,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1748499446, now seen corresponding path program 1 times [2024-11-20 19:11:21,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:21,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16177656] [2024-11-20 19:11:21,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:21,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:21,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:21,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:21,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:21,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:21,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:21,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:21,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 19:11:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:21,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 19:11:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:21,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 19:11:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:21,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 19:11:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:21,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 19:11:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:21,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 19:11:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:21,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 19:11:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:21,634 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:21,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:21,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16177656] [2024-11-20 19:11:21,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16177656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:21,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152998599] [2024-11-20 19:11:21,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:21,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:21,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:21,637 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:21,638 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:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:21,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 19:11:21,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:21,861 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:21,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:21,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152998599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:21,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:21,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-20 19:11:21,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931269363] [2024-11-20 19:11:21,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:21,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 19:11:21,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:21,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 19:11:21,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-20 19:11:21,863 INFO L87 Difference]: Start difference. First operand 292 states and 450 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:21,930 INFO L93 Difference]: Finished difference Result 509 states and 785 transitions. [2024-11-20 19:11:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 19:11:21,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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 120 [2024-11-20 19:11:21,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:21,933 INFO L225 Difference]: With dead ends: 509 [2024-11-20 19:11:21,933 INFO L226 Difference]: Without dead ends: 307 [2024-11-20 19:11:21,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 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:21,934 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 16 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1438 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.1s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:21,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1438 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 19:11:21,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-20 19:11:21,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 294. [2024-11-20 19:11:21,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 231 states have (on average 1.5411255411255411) internal successors, (356), 237 states have internal predecessors, (356), 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:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 452 transitions. [2024-11-20 19:11:21,945 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 452 transitions. Word has length 120 [2024-11-20 19:11:21,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:21,946 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 452 transitions. [2024-11-20 19:11:21,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 452 transitions. [2024-11-20 19:11:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-20 19:11:21,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:21,948 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, 1] [2024-11-20 19:11:21,957 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:22,148 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:22,148 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:22,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:22,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1808412942, now seen corresponding path program 1 times [2024-11-20 19:11:22,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:22,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397368911] [2024-11-20 19:11:22,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:22,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:22,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:22,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-20 19:11:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:22,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:22,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:22,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:22,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 19:11:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:22,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 19:11:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:22,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 19:11:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:22,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 19:11:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:22,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 19:11:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:22,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 19:11:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:22,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 19:11:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:22,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 19:11:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:22,340 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:22,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:22,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397368911] [2024-11-20 19:11:22,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397368911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:22,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177846589] [2024-11-20 19:11:22,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:22,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:22,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:22,343 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:22,349 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:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:22,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 19:11:22,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:22,619 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:22,619 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:22,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177846589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:22,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:22,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2024-11-20 19:11:22,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812811739] [2024-11-20 19:11:22,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:22,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 19:11:22,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:22,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 19:11:22,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-20 19:11:22,622 INFO L87 Difference]: Start difference. First operand 294 states and 452 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 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:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:22,685 INFO L93 Difference]: Finished difference Result 308 states and 477 transitions. [2024-11-20 19:11:22,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 19:11:22,686 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 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 122 [2024-11-20 19:11:22,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:22,687 INFO L225 Difference]: With dead ends: 308 [2024-11-20 19:11:22,687 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 19:11:22,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 141 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:22,689 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 37 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1614 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:22,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1614 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:22,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 19:11:22,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 19:11:22,690 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:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 19:11:22,691 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122 [2024-11-20 19:11:22,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:22,691 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 19:11:22,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 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:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 19:11:22,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 19:11:22,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-20 19:11:22,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-20 19:11:22,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-20 19:11:22,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-20 19:11:22,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-20 19:11:22,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-20 19:11:22,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-20 19:11:22,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-20 19:11:22,706 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:22,897 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:22,900 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:22,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 19:11:23,234 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 19:11:23,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:11:23 BoogieIcfgContainer [2024-11-20 19:11:23,264 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 19:11:23,265 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 19:11:23,265 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 19:11:23,266 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 19:11:23,266 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:09" (3/4) ... [2024-11-20 19:11:23,268 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 19:11:23,272 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_int8 [2024-11-20 19:11:23,272 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_bool [2024-11-20 19:11:23,272 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert [2024-11-20 19:11:23,272 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure add_history_type [2024-11-20 19:11:23,272 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-20 19:11:23,272 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure write_history_bool [2024-11-20 19:11:23,288 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-20 19:11:23,289 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-20 19:11:23,291 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 19:11:23,291 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 19:11:23,323 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:23,390 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:23,446 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 19:11:23,447 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 19:11:23,447 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 19:11:23,447 INFO L158 Benchmark]: Toolchain (without parser) took 15736.29ms. Allocated memory was 134.2MB in the beginning and 346.0MB in the end (delta: 211.8MB). Free memory was 80.5MB in the beginning and 203.6MB in the end (delta: -123.1MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. [2024-11-20 19:11:23,448 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 134.2MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 19:11:23,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.51ms. Allocated memory is still 134.2MB. Free memory was 80.2MB in the beginning and 61.6MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 19:11:23,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.24ms. Allocated memory is still 134.2MB. Free memory was 61.6MB in the beginning and 58.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 19:11:23,448 INFO L158 Benchmark]: Boogie Preprocessor took 87.17ms. Allocated memory is still 134.2MB. Free memory was 58.2MB in the beginning and 54.3MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 19:11:23,449 INFO L158 Benchmark]: RCFGBuilder took 826.64ms. Allocated memory is still 134.2MB. Free memory was 105.6MB in the beginning and 65.2MB in the end (delta: 40.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-20 19:11:23,449 INFO L158 Benchmark]: TraceAbstraction took 14158.46ms. Allocated memory was 134.2MB in the beginning and 346.0MB in the end (delta: 211.8MB). Free memory was 64.5MB in the beginning and 215.2MB in the end (delta: -150.6MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. [2024-11-20 19:11:23,449 INFO L158 Benchmark]: Witness Printer took 181.61ms. Allocated memory is still 346.0MB. Free memory was 215.2MB in the beginning and 203.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 19:11:23,453 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 134.2MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.51ms. Allocated memory is still 134.2MB. Free memory was 80.2MB in the beginning and 61.6MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.24ms. Allocated memory is still 134.2MB. Free memory was 61.6MB in the beginning and 58.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.17ms. Allocated memory is still 134.2MB. Free memory was 58.2MB in the beginning and 54.3MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 826.64ms. Allocated memory is still 134.2MB. Free memory was 105.6MB in the beginning and 65.2MB in the end (delta: 40.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14158.46ms. Allocated memory was 134.2MB in the beginning and 346.0MB in the end (delta: 211.8MB). Free memory was 64.5MB in the beginning and 215.2MB in the end (delta: -150.6MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. * Witness Printer took 181.61ms. Allocated memory is still 346.0MB. Free memory was 215.2MB in the beginning and 203.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. 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, 195 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 417 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 382 mSDsluCounter, 21177 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14910 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 941 IncrementalHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 6267 mSDtfsCounter, 941 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2527 GetRequests, 2369 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=18, 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, 118 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 4033 NumberOfCodeBlocks, 4033 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3992 ConstructedInterpolants, 0 QuantifiedInterpolants, 6070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 10641 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: 515]: 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: 534]: 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:23,479 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