./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 12:19:41,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 12:19:41,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 12:19:41,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 12:19:41,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 12:19:41,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 12:19:41,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 12:19:41,386 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 12:19:41,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 12:19:41,388 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 12:19:41,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 12:19:41,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 12:19:41,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 12:19:41,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 12:19:41,391 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 12:19:41,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 12:19:41,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 12:19:41,394 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 12:19:41,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 12:19:41,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 12:19:41,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 12:19:41,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 12:19:41,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 12:19:41,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 12:19:41,396 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 12:19:41,396 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 12:19:41,397 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 12:19:41,397 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 12:19:41,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 12:19:41,398 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 12:19:41,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 12:19:41,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 12:19:41,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 12:19:41,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 12:19:41,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:19:41,402 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 12:19:41,402 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 12:19:41,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 12:19:41,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 12:19:41,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 12:19:41,403 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 12:19:41,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 12:19:41,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 12:19:41,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 12:19:41,406 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 [2024-11-09 12:19:41,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 12:19:41,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 12:19:41,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 12:19:41,727 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 12:19:41,727 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 12:19:41,729 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-11-09 12:19:43,268 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 12:19:43,498 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 12:19:43,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-11-09 12:19:43,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b203d0a3b/e81c398e2caf402aaa0a621bf9ce8af1/FLAG2f16be1d2 [2024-11-09 12:19:43,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b203d0a3b/e81c398e2caf402aaa0a621bf9ce8af1 [2024-11-09 12:19:43,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 12:19:43,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 12:19:43,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 12:19:43,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 12:19:43,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 12:19:43,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:43" (1/1) ... [2024-11-09 12:19:43,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a269e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:43, skipping insertion in model container [2024-11-09 12:19:43,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:43" (1/1) ... [2024-11-09 12:19:43,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 12:19:43,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:19:43,938 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 12:19:44,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:19:44,033 INFO L204 MainTranslator]: Completed translation [2024-11-09 12:19:44,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44 WrapperNode [2024-11-09 12:19:44,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 12:19:44,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 12:19:44,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 12:19:44,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 12:19:44,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 12:19:44,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 12:19:44,161 INFO L138 Inliner]: procedures = 28, calls = 52, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 431 [2024-11-09 12:19:44,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 12:19:44,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 12:19:44,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 12:19:44,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 12:19:44,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 12:19:44,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 12:19:44,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 12:19:44,241 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-09 12:19:44,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 12:19:44,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 12:19:44,252 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 12:19:44,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 12:19:44,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 12:19:44,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 12:19:44,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 12:19:44,283 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 12:19:44,284 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 12:19:44,284 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 12:19:44,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 12:19:44,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:19:44,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:44,325 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-09 12:19:44,339 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-09 12:19:44,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 12:19:44,391 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-11-09 12:19:44,391 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-11-09 12:19:44,391 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-09 12:19:44,392 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-09 12:19:44,392 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-11-09 12:19:44,392 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-11-09 12:19:44,392 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-11-09 12:19:44,392 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-11-09 12:19:44,394 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-11-09 12:19:44,395 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-11-09 12:19:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 12:19:44,395 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 12:19:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 12:19:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 12:19:44,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 12:19:44,524 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 12:19:44,526 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 12:19:45,200 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-11-09 12:19:45,201 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 12:19:45,229 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 12:19:45,230 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 12:19:45,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:45 BoogieIcfgContainer [2024-11-09 12:19:45,231 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 12:19:45,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 12:19:45,233 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 12:19:45,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 12:19:45,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:19:43" (1/3) ... [2024-11-09 12:19:45,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1889fb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:19:45, skipping insertion in model container [2024-11-09 12:19:45,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (2/3) ... [2024-11-09 12:19:45,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1889fb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:19:45, skipping insertion in model container [2024-11-09 12:19:45,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:45" (3/3) ... [2024-11-09 12:19:45,240 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-11-09 12:19:45,256 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 12:19:45,257 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-09 12:19:45,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 12:19:45,340 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;@5aa58786, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 12:19:45,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-09 12:19:45,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 142 states have (on average 1.5985915492957747) internal successors, (227), 154 states have internal predecessors, (227), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-09 12:19:45,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 12:19:45,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:45,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:19:45,357 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-09 12:19:45,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:45,361 INFO L85 PathProgramCache]: Analyzing trace with hash -356788114, now seen corresponding path program 1 times [2024-11-09 12:19:45,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:45,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549079346] [2024-11-09 12:19:45,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:45,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:45,722 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-09 12:19:45,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:45,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549079346] [2024-11-09 12:19:45,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549079346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:45,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:19:45,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 12:19:45,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961530868] [2024-11-09 12:19:45,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:45,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:19:45,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:45,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:19:45,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:19:45,764 INFO L87 Difference]: Start difference. First operand has 194 states, 142 states have (on average 1.5985915492957747) internal successors, (227), 154 states have internal predecessors, (227), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:19:45,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:45,905 INFO L93 Difference]: Finished difference Result 404 states and 665 transitions. [2024-11-09 12:19:45,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:19:45,909 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-09 12:19:45,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:45,924 INFO L225 Difference]: With dead ends: 404 [2024-11-09 12:19:45,925 INFO L226 Difference]: Without dead ends: 212 [2024-11-09 12:19:45,931 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-09 12:19:45,934 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 37 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:45,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 868 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:19:45,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-09 12:19:45,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 205. [2024-11-09 12:19:45,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 152 states have (on average 1.5723684210526316) internal successors, (239), 163 states have internal predecessors, (239), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 12:19:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 315 transitions. [2024-11-09 12:19:46,005 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 315 transitions. Word has length 11 [2024-11-09 12:19:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:46,005 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 315 transitions. [2024-11-09 12:19:46,005 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-09 12:19:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 315 transitions. [2024-11-09 12:19:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 12:19:46,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:46,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:19:46,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 12:19:46,008 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-09 12:19:46,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:46,009 INFO L85 PathProgramCache]: Analyzing trace with hash 545005096, now seen corresponding path program 1 times [2024-11-09 12:19:46,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:46,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076691364] [2024-11-09 12:19:46,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:46,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:46,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 12:19:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:46,251 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-09 12:19:46,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:46,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076691364] [2024-11-09 12:19:46,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076691364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:46,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:19:46,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:19:46,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041169790] [2024-11-09 12:19:46,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:46,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:19:46,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:46,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:19:46,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:19:46,260 INFO L87 Difference]: Start difference. First operand 205 states and 315 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 12:19:46,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:46,351 INFO L93 Difference]: Finished difference Result 433 states and 675 transitions. [2024-11-09 12:19:46,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:19:46,352 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-09 12:19:46,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:46,356 INFO L225 Difference]: With dead ends: 433 [2024-11-09 12:19:46,359 INFO L226 Difference]: Without dead ends: 240 [2024-11-09 12:19:46,361 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-09 12:19:46,364 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 19 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:46,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 876 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:19:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-09 12:19:46,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 236. [2024-11-09 12:19:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 178 states have (on average 1.5393258426966292) internal successors, (274), 189 states have internal predecessors, (274), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-09 12:19:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 360 transitions. [2024-11-09 12:19:46,400 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 360 transitions. Word has length 16 [2024-11-09 12:19:46,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:46,401 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 360 transitions. [2024-11-09 12:19:46,401 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-09 12:19:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 360 transitions. [2024-11-09 12:19:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 12:19:46,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:46,403 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-09 12:19:46,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 12:19:46,403 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-09 12:19:46,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1126370760, now seen corresponding path program 1 times [2024-11-09 12:19:46,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:46,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369775408] [2024-11-09 12:19:46,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:46,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:46,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 12:19:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:46,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:46,624 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-09 12:19:46,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:46,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369775408] [2024-11-09 12:19:46,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369775408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:19:46,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394225764] [2024-11-09 12:19:46,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:46,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:19:46,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:46,630 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-09 12:19:46,633 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-09 12:19:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:46,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 12:19:46,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:19:46,876 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-09 12:19:46,877 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:19:46,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394225764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:46,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:19:46,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-09 12:19:46,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459359733] [2024-11-09 12:19:46,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:46,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 12:19:46,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:46,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 12:19:46,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:19:46,881 INFO L87 Difference]: Start difference. First operand 236 states and 360 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 12:19:46,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:46,930 INFO L93 Difference]: Finished difference Result 240 states and 366 transitions. [2024-11-09 12:19:46,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:19:46,930 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-09 12:19:46,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:46,934 INFO L225 Difference]: With dead ends: 240 [2024-11-09 12:19:46,934 INFO L226 Difference]: Without dead ends: 239 [2024-11-09 12:19:46,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:19:46,938 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 19 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:46,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 830 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:19:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-09 12:19:46,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 235. [2024-11-09 12:19:46,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 178 states have (on average 1.5224719101123596) internal successors, (271), 188 states have internal predecessors, (271), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-09 12:19:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 357 transitions. [2024-11-09 12:19:46,974 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 357 transitions. Word has length 29 [2024-11-09 12:19:46,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:46,979 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 357 transitions. [2024-11-09 12:19:46,980 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-09 12:19:46,980 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 357 transitions. [2024-11-09 12:19:46,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 12:19:46,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:46,982 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-09 12:19:46,999 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-09 12:19:47,183 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-09 12:19:47,184 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-09 12:19:47,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:47,185 INFO L85 PathProgramCache]: Analyzing trace with hash 557755714, now seen corresponding path program 1 times [2024-11-09 12:19:47,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:47,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583567406] [2024-11-09 12:19:47,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:47,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:47,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 12:19:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:47,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:47,304 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-09 12:19:47,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:47,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583567406] [2024-11-09 12:19:47,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583567406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:47,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:19:47,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:19:47,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777777026] [2024-11-09 12:19:47,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:47,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:19:47,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:47,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:19:47,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:19:47,311 INFO L87 Difference]: Start difference. First operand 235 states and 357 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 12:19:47,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:47,354 INFO L93 Difference]: Finished difference Result 239 states and 363 transitions. [2024-11-09 12:19:47,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:19:47,354 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-09 12:19:47,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:47,357 INFO L225 Difference]: With dead ends: 239 [2024-11-09 12:19:47,357 INFO L226 Difference]: Without dead ends: 238 [2024-11-09 12:19:47,357 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-09 12:19:47,361 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 18 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:47,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 832 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:19:47,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-09 12:19:47,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 205. [2024-11-09 12:19:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 154 states have (on average 1.525974025974026) internal successors, (235), 163 states have internal predecessors, (235), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 12:19:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 311 transitions. [2024-11-09 12:19:47,389 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 311 transitions. Word has length 30 [2024-11-09 12:19:47,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:47,389 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 311 transitions. [2024-11-09 12:19:47,390 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-09 12:19:47,390 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 311 transitions. [2024-11-09 12:19:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 12:19:47,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:47,399 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:19:47,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 12:19:47,400 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-09 12:19:47,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:47,400 INFO L85 PathProgramCache]: Analyzing trace with hash 509755153, now seen corresponding path program 1 times [2024-11-09 12:19:47,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:47,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858685054] [2024-11-09 12:19:47,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:47,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:47,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:19:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:47,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 12:19:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:47,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:47,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:19:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:47,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 12:19:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:47,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 12:19:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:47,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 12:19:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:47,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 12:19:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:47,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 12:19:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:47,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 12:19:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:47,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 12:19:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:47,728 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-09 12:19:47,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:47,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858685054] [2024-11-09 12:19:47,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858685054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:19:47,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335830098] [2024-11-09 12:19:47,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:47,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:19:47,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:47,734 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-09 12:19:47,737 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-09 12:19:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:47,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:19:47,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:19:47,974 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-09 12:19:47,978 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:19:47,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335830098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:47,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:19:47,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-09 12:19:47,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759595984] [2024-11-09 12:19:47,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:47,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:19:47,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:47,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:19:47,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:19:47,980 INFO L87 Difference]: Start difference. First operand 205 states and 311 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 12:19:48,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:48,049 INFO L93 Difference]: Finished difference Result 357 states and 550 transitions. [2024-11-09 12:19:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:19:48,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 91 [2024-11-09 12:19:48,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:48,055 INFO L225 Difference]: With dead ends: 357 [2024-11-09 12:19:48,056 INFO L226 Difference]: Without dead ends: 212 [2024-11-09 12:19:48,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:19:48,058 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 10 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:48,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 838 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:19:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-09 12:19:48,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-09 12:19:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 159 states have (on average 1.528301886792453) internal successors, (243), 169 states have internal predecessors, (243), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-09 12:19:48,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 321 transitions. [2024-11-09 12:19:48,078 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 321 transitions. Word has length 91 [2024-11-09 12:19:48,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:48,080 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 321 transitions. [2024-11-09 12:19:48,080 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-09 12:19:48,081 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 321 transitions. [2024-11-09 12:19:48,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 12:19:48,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:48,085 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:19:48,105 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-09 12:19:48,286 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-09 12:19:48,286 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-09 12:19:48,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:48,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1851436505, now seen corresponding path program 1 times [2024-11-09 12:19:48,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:48,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598723880] [2024-11-09 12:19:48,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:48,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:48,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:19:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:48,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 12:19:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:48,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:48,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:19:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:48,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 12:19:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:48,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 12:19:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:48,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 12:19:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:48,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 12:19:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:48,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 12:19:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:48,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 12:19:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:48,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 12:19:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:48,635 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-09 12:19:48,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:48,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598723880] [2024-11-09 12:19:48,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598723880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:19:48,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636140282] [2024-11-09 12:19:48,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:48,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:19:48,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:48,639 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-09 12:19:48,640 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-09 12:19:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:48,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:19:48,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:19:48,873 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-09 12:19:48,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:19:48,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636140282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:48,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:19:48,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-09 12:19:48,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095863087] [2024-11-09 12:19:48,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:48,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:19:48,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:48,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:19:48,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:19:48,876 INFO L87 Difference]: Start difference. First operand 212 states and 321 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 12:19:48,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:48,934 INFO L93 Difference]: Finished difference Result 371 states and 569 transitions. [2024-11-09 12:19:48,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:19:48,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2024-11-09 12:19:48,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:48,937 INFO L225 Difference]: With dead ends: 371 [2024-11-09 12:19:48,937 INFO L226 Difference]: Without dead ends: 219 [2024-11-09 12:19:48,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:19:48,939 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 8 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:48,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 833 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:19:48,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-09 12:19:48,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-11-09 12:19:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 164 states have (on average 1.5304878048780488) internal successors, (251), 175 states have internal predecessors, (251), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 12:19:48,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 331 transitions. [2024-11-09 12:19:48,951 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 331 transitions. Word has length 93 [2024-11-09 12:19:48,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:48,952 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 331 transitions. [2024-11-09 12:19:48,952 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-09 12:19:48,952 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 331 transitions. [2024-11-09 12:19:48,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 12:19:48,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:48,954 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:19:48,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 12:19:49,154 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-09 12:19:49,155 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-09 12:19:49,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash 656454702, now seen corresponding path program 1 times [2024-11-09 12:19:49,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:49,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588252966] [2024-11-09 12:19:49,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:49,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:49,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:19:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:49,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 12:19:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:49,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:49,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:19:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:49,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 12:19:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:49,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 12:19:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:49,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:19:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:49,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 12:19:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:49,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 12:19:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:49,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 12:19:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:49,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 12:19:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:49,383 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-09 12:19:49,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:49,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588252966] [2024-11-09 12:19:49,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588252966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:19:49,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086400532] [2024-11-09 12:19:49,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:49,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:19:49,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:49,386 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-09 12:19:49,388 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-09 12:19:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:49,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:19:49,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:19:49,585 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-09 12:19:49,585 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:19:49,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086400532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:49,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:19:49,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-09 12:19:49,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265753086] [2024-11-09 12:19:49,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:49,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:19:49,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:49,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:19:49,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:19:49,587 INFO L87 Difference]: Start difference. First operand 219 states and 331 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 12:19:49,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:49,705 INFO L93 Difference]: Finished difference Result 396 states and 619 transitions. [2024-11-09 12:19:49,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:19:49,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-09 12:19:49,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:49,709 INFO L225 Difference]: With dead ends: 396 [2024-11-09 12:19:49,709 INFO L226 Difference]: Without dead ends: 237 [2024-11-09 12:19:49,710 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-09 12:19:49,710 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 39 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:49,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 794 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:19:49,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-09 12:19:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2024-11-09 12:19:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 176 states have (on average 1.5454545454545454) internal successors, (272), 187 states have internal predecessors, (272), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-09 12:19:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 354 transitions. [2024-11-09 12:19:49,726 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 354 transitions. Word has length 94 [2024-11-09 12:19:49,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:49,727 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 354 transitions. [2024-11-09 12:19:49,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 12:19:49,727 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 354 transitions. [2024-11-09 12:19:49,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 12:19:49,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:49,729 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:19:49,750 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-09 12:19:49,933 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-09 12:19:49,934 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-09 12:19:49,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:49,935 INFO L85 PathProgramCache]: Analyzing trace with hash 364327559, now seen corresponding path program 1 times [2024-11-09 12:19:49,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:49,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884057655] [2024-11-09 12:19:49,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:49,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:19:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 12:19:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:19:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 12:19:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 12:19:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:19:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 12:19:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 12:19:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 12:19:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 12:19:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,162 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-09 12:19:50,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:50,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884057655] [2024-11-09 12:19:50,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884057655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:19:50,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954151261] [2024-11-09 12:19:50,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:50,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:19:50,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:50,166 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-09 12:19:50,167 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-09 12:19:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:19:50,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:19:50,363 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-09 12:19:50,363 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:19:50,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954151261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:50,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:19:50,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-09 12:19:50,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279820875] [2024-11-09 12:19:50,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:50,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:19:50,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:50,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:19:50,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:19:50,366 INFO L87 Difference]: Start difference. First operand 233 states and 354 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 12:19:50,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:50,442 INFO L93 Difference]: Finished difference Result 471 states and 731 transitions. [2024-11-09 12:19:50,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:19:50,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 97 [2024-11-09 12:19:50,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:50,446 INFO L225 Difference]: With dead ends: 471 [2024-11-09 12:19:50,447 INFO L226 Difference]: Without dead ends: 257 [2024-11-09 12:19:50,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:19:50,448 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 21 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:50,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 814 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:19:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-09 12:19:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2024-11-09 12:19:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 196 states have (on average 1.5612244897959184) internal successors, (306), 207 states have internal predecessors, (306), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-09 12:19:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 392 transitions. [2024-11-09 12:19:50,465 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 392 transitions. Word has length 97 [2024-11-09 12:19:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:50,466 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 392 transitions. [2024-11-09 12:19:50,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 12:19:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 392 transitions. [2024-11-09 12:19:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 12:19:50,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:50,468 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:19:50,488 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-09 12:19:50,668 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-09 12:19:50,669 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-09 12:19:50,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:50,670 INFO L85 PathProgramCache]: Analyzing trace with hash 51521317, now seen corresponding path program 1 times [2024-11-09 12:19:50,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:50,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326243422] [2024-11-09 12:19:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:50,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:19:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 12:19:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:19:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 12:19:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 12:19:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:19:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 12:19:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 12:19:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 12:19:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 12:19:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:50,899 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-09 12:19:50,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:50,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326243422] [2024-11-09 12:19:50,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326243422] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:19:50,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12273971] [2024-11-09 12:19:50,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:50,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:19:50,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:50,901 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-09 12:19:50,903 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-09 12:19:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:51,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:19:51,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:19:51,104 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-09 12:19:51,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:19:51,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12273971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:51,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:19:51,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-09 12:19:51,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650349571] [2024-11-09 12:19:51,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:51,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:19:51,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:51,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:19:51,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:19:51,107 INFO L87 Difference]: Start difference. First operand 257 states and 392 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 12:19:51,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:51,197 INFO L93 Difference]: Finished difference Result 515 states and 796 transitions. [2024-11-09 12:19:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:19:51,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2024-11-09 12:19:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:51,201 INFO L225 Difference]: With dead ends: 515 [2024-11-09 12:19:51,201 INFO L226 Difference]: Without dead ends: 277 [2024-11-09 12:19:51,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 119 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-09 12:19:51,205 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 19 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:51,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 801 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:19:51,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-09 12:19:51,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2024-11-09 12:19:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 212 states have (on average 1.5660377358490567) internal successors, (332), 223 states have internal predecessors, (332), 45 states have call successors, (45), 14 states have call predecessors, (45), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 12:19:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 422 transitions. [2024-11-09 12:19:51,222 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 422 transitions. Word has length 99 [2024-11-09 12:19:51,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:51,224 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 422 transitions. [2024-11-09 12:19:51,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 12:19:51,224 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 422 transitions. [2024-11-09 12:19:51,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 12:19:51,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:51,227 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:19:51,249 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-09 12:19:51,427 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-09 12:19:51,428 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-09 12:19:51,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:51,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1311417283, now seen corresponding path program 1 times [2024-11-09 12:19:51,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:51,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090255658] [2024-11-09 12:19:51,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:51,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:51,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:19:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:51,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 12:19:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:51,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:51,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:19:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:51,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 12:19:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:51,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 12:19:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:51,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:19:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:51,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 12:19:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:51,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 12:19:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:51,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 12:19:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:51,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 12:19:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:51,629 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-09 12:19:51,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:51,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090255658] [2024-11-09 12:19:51,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090255658] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:19:51,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886922190] [2024-11-09 12:19:51,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:51,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:19:51,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:51,632 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-09 12:19:51,633 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-09 12:19:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:51,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:19:51,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:19:51,848 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-09 12:19:51,849 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:19:51,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886922190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:51,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:19:51,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-09 12:19:51,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093678234] [2024-11-09 12:19:51,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:51,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:19:51,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:51,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:19:51,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:19:51,853 INFO L87 Difference]: Start difference. First operand 277 states and 422 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 12:19:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:51,887 INFO L93 Difference]: Finished difference Result 285 states and 437 transitions. [2024-11-09 12:19:51,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:19:51,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2024-11-09 12:19:51,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:51,890 INFO L225 Difference]: With dead ends: 285 [2024-11-09 12:19:51,891 INFO L226 Difference]: Without dead ends: 284 [2024-11-09 12:19:51,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 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-09 12:19:51,892 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 12 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:51,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 821 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:19:51,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-09 12:19:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 276. [2024-11-09 12:19:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 212 states have (on average 1.5613207547169812) internal successors, (331), 222 states have internal predecessors, (331), 45 states have call successors, (45), 14 states have call predecessors, (45), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 12:19:51,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 421 transitions. [2024-11-09 12:19:51,908 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 421 transitions. Word has length 100 [2024-11-09 12:19:51,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:51,909 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 421 transitions. [2024-11-09 12:19:51,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 12:19:51,909 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 421 transitions. [2024-11-09 12:19:51,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 12:19:51,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:51,911 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-09 12:19:51,932 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-09 12:19:52,112 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-09 12:19:52,112 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-09 12:19:52,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:52,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1999229793, now seen corresponding path program 1 times [2024-11-09 12:19:52,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:52,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117421168] [2024-11-09 12:19:52,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:52,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:19:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 12:19:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:19:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 12:19:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 12:19:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:19:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 12:19:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 12:19:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 12:19:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 12:19:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,293 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-09 12:19:52,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:52,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117421168] [2024-11-09 12:19:52,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117421168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:19:52,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543519624] [2024-11-09 12:19:52,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:52,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:19:52,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:52,295 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-09 12:19:52,297 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-09 12:19:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:19:52,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:19:52,494 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-09 12:19:52,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:19:52,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543519624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:52,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:19:52,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-09 12:19:52,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573543732] [2024-11-09 12:19:52,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:52,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:19:52,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:52,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:19:52,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:19:52,496 INFO L87 Difference]: Start difference. First operand 276 states and 421 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 12:19:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:52,537 INFO L93 Difference]: Finished difference Result 472 states and 724 transitions. [2024-11-09 12:19:52,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:19:52,537 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-09 12:19:52,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:52,539 INFO L225 Difference]: With dead ends: 472 [2024-11-09 12:19:52,539 INFO L226 Difference]: Without dead ends: 286 [2024-11-09 12:19:52,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:19:52,541 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 11 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:52,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 863 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:19:52,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-09 12:19:52,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-11-09 12:19:52,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 221 states have (on average 1.5565610859728507) internal successors, (344), 230 states have internal predecessors, (344), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-09 12:19:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 438 transitions. [2024-11-09 12:19:52,556 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 438 transitions. Word has length 101 [2024-11-09 12:19:52,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:52,557 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 438 transitions. [2024-11-09 12:19:52,557 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-09 12:19:52,557 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 438 transitions. [2024-11-09 12:19:52,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 12:19:52,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:52,561 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:19:52,582 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-09 12:19:52,765 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-09 12:19:52,766 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-09 12:19:52,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:52,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1326737845, now seen corresponding path program 1 times [2024-11-09 12:19:52,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:52,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322040590] [2024-11-09 12:19:52,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:52,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:19:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 12:19:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:19:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 12:19:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 12:19:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:19:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 12:19:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 12:19:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 12:19:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 12:19:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:52,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 12:19:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:53,001 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-09 12:19:53,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:53,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322040590] [2024-11-09 12:19:53,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322040590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:19:53,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869577281] [2024-11-09 12:19:53,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:53,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:19:53,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:53,004 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-09 12:19:53,005 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-09 12:19:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:53,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:19:53,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:19:53,229 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-09 12:19:53,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:19:53,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869577281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:53,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:19:53,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-09 12:19:53,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905879271] [2024-11-09 12:19:53,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:53,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:19:53,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:53,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:19:53,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:19:53,233 INFO L87 Difference]: Start difference. First operand 286 states and 438 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 12:19:53,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:53,273 INFO L93 Difference]: Finished difference Result 297 states and 457 transitions. [2024-11-09 12:19:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:19:53,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-11-09 12:19:53,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:53,276 INFO L225 Difference]: With dead ends: 297 [2024-11-09 12:19:53,276 INFO L226 Difference]: Without dead ends: 296 [2024-11-09 12:19:53,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 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-09 12:19:53,278 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 10 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:53,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 848 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:19:53,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-09 12:19:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 287. [2024-11-09 12:19:53,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 222 states have (on average 1.554054054054054) internal successors, (345), 231 states have internal predecessors, (345), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-09 12:19:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 439 transitions. [2024-11-09 12:19:53,297 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 439 transitions. Word has length 108 [2024-11-09 12:19:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:53,297 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 439 transitions. [2024-11-09 12:19:53,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 12:19:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 439 transitions. [2024-11-09 12:19:53,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 12:19:53,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:53,300 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-09 12:19:53,321 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-09 12:19:53,504 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-09 12:19:53,505 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-09 12:19:53,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:53,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1820800093, now seen corresponding path program 1 times [2024-11-09 12:19:53,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:53,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292411391] [2024-11-09 12:19:53,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:53,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:53,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:19:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:53,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 12:19:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:53,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:53,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:19:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:53,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 12:19:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:53,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 12:19:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:53,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:19:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:53,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 12:19:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:53,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 12:19:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:53,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 12:19:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:53,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 12:19:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:53,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 12:19:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:53,696 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-09 12:19:53,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:53,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292411391] [2024-11-09 12:19:53,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292411391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:19:53,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604670396] [2024-11-09 12:19:53,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:53,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:19:53,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:53,699 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-09 12:19:53,701 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-09 12:19:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:53,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:19:53,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:19:53,896 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-09 12:19:53,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:19:53,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604670396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:53,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:19:53,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-09 12:19:53,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601919567] [2024-11-09 12:19:53,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:53,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:19:53,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:53,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:19:53,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:19:53,899 INFO L87 Difference]: Start difference. First operand 287 states and 439 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 12:19:53,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:53,937 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2024-11-09 12:19:53,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:19:53,938 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-09 12:19:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:53,940 INFO L225 Difference]: With dead ends: 289 [2024-11-09 12:19:53,940 INFO L226 Difference]: Without dead ends: 288 [2024-11-09 12:19:53,941 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-09 12:19:53,941 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 9 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:53,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 863 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:19:53,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-09 12:19:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-11-09 12:19:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 223 states have (on average 1.5515695067264574) internal successors, (346), 232 states have internal predecessors, (346), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-09 12:19:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 440 transitions. [2024-11-09 12:19:53,961 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 440 transitions. Word has length 109 [2024-11-09 12:19:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:53,961 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 440 transitions. [2024-11-09 12:19:53,962 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-09 12:19:53,962 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 440 transitions. [2024-11-09 12:19:53,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 12:19:53,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:53,964 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-09 12:19:53,984 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-09 12:19:54,164 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-09 12:19:54,165 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-09 12:19:54,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:54,166 INFO L85 PathProgramCache]: Analyzing trace with hash 991157711, now seen corresponding path program 1 times [2024-11-09 12:19:54,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:54,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021424167] [2024-11-09 12:19:54,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:54,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:19:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 12:19:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:19:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 12:19:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 12:19:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:19:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 12:19:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 12:19:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 12:19:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 12:19:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 12:19:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,368 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-09 12:19:54,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:54,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021424167] [2024-11-09 12:19:54,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021424167] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:19:54,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797428097] [2024-11-09 12:19:54,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:54,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:19:54,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:54,371 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-09 12:19:54,372 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-09 12:19:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 12:19:54,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:19:54,574 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-09 12:19:54,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:19:54,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797428097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:54,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:19:54,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-09 12:19:54,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123670662] [2024-11-09 12:19:54,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:54,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 12:19:54,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:54,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 12:19:54,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:19:54,576 INFO L87 Difference]: Start difference. First operand 288 states and 440 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 12:19:54,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:54,619 INFO L93 Difference]: Finished difference Result 293 states and 450 transitions. [2024-11-09 12:19:54,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:19:54,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-11-09 12:19:54,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:54,622 INFO L225 Difference]: With dead ends: 293 [2024-11-09 12:19:54,622 INFO L226 Difference]: Without dead ends: 292 [2024-11-09 12:19:54,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 130 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-09 12:19:54,623 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 12 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:54,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1079 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:19:54,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-09 12:19:54,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 287. [2024-11-09 12:19:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 223 states have (on average 1.547085201793722) internal successors, (345), 231 states have internal predecessors, (345), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-09 12:19:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 439 transitions. [2024-11-09 12:19:54,635 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 439 transitions. Word has length 110 [2024-11-09 12:19:54,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:54,635 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 439 transitions. [2024-11-09 12:19:54,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 12:19:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 439 transitions. [2024-11-09 12:19:54,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 12:19:54,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:54,638 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-09 12:19:54,660 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-09 12:19:54,838 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-09 12:19:54,839 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-09 12:19:54,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:54,840 INFO L85 PathProgramCache]: Analyzing trace with hash 661118297, now seen corresponding path program 1 times [2024-11-09 12:19:54,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:54,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303092521] [2024-11-09 12:19:54,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:54,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:19:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 12:19:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:19:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 12:19:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 12:19:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:19:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 12:19:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 12:19:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 12:19:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 12:19:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 12:19:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:54,993 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-09 12:19:54,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:54,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303092521] [2024-11-09 12:19:54,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303092521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:19:54,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478245636] [2024-11-09 12:19:54,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:54,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:19:54,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:54,996 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-09 12:19:54,998 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-09 12:19:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:55,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:19:55,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:19:55,220 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-09 12:19:55,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:19:55,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478245636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:55,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:19:55,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-09 12:19:55,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056098292] [2024-11-09 12:19:55,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:55,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:19:55,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:55,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:19:55,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 12:19:55,224 INFO L87 Difference]: Start difference. First operand 287 states and 439 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 12:19:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:55,283 INFO L93 Difference]: Finished difference Result 491 states and 755 transitions. [2024-11-09 12:19:55,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:19:55,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2024-11-09 12:19:55,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:55,287 INFO L225 Difference]: With dead ends: 491 [2024-11-09 12:19:55,287 INFO L226 Difference]: Without dead ends: 294 [2024-11-09 12:19:55,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 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-09 12:19:55,289 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 20 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:55,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1398 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:19:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-09 12:19:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2024-11-09 12:19:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 226 states have (on average 1.5530973451327434) internal successors, (351), 233 states have internal predecessors, (351), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 12:19:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 447 transitions. [2024-11-09 12:19:55,302 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 447 transitions. Word has length 111 [2024-11-09 12:19:55,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:55,303 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 447 transitions. [2024-11-09 12:19:55,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 12:19:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 447 transitions. [2024-11-09 12:19:55,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 12:19:55,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:55,305 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:19:55,326 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-09 12:19:55,506 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-09 12:19:55,506 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-09 12:19:55,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:55,507 INFO L85 PathProgramCache]: Analyzing trace with hash 205169561, now seen corresponding path program 1 times [2024-11-09 12:19:55,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:55,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903163023] [2024-11-09 12:19:55,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:55,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:55,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:19:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:55,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 12:19:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:55,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:55,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:19:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:55,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 12:19:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:55,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 12:19:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:55,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:19:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:55,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 12:19:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:55,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 12:19:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:55,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 12:19:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:55,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 12:19:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:55,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 12:19:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:55,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 12:19:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:55,723 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-09 12:19:55,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:55,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903163023] [2024-11-09 12:19:55,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903163023] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:19:55,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924188268] [2024-11-09 12:19:55,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:55,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:19:55,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:55,726 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-09 12:19:55,728 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-09 12:19:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:55,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:19:55,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:19:55,934 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-09 12:19:55,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:19:55,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924188268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:55,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:19:55,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-09 12:19:55,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176751430] [2024-11-09 12:19:55,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:55,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:19:55,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:55,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:19:55,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:19:55,937 INFO L87 Difference]: Start difference. First operand 290 states and 447 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 12:19:55,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:55,974 INFO L93 Difference]: Finished difference Result 299 states and 462 transitions. [2024-11-09 12:19:55,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:19:55,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2024-11-09 12:19:55,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:55,977 INFO L225 Difference]: With dead ends: 299 [2024-11-09 12:19:55,977 INFO L226 Difference]: Without dead ends: 298 [2024-11-09 12:19:55,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:19:55,979 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 8 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:55,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 818 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:19:55,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-09 12:19:55,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 291. [2024-11-09 12:19:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 227 states have (on average 1.550660792951542) internal successors, (352), 234 states have internal predecessors, (352), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 12:19:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 448 transitions. [2024-11-09 12:19:55,992 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 448 transitions. Word has length 116 [2024-11-09 12:19:55,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:55,994 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 448 transitions. [2024-11-09 12:19:55,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 12:19:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 448 transitions. [2024-11-09 12:19:55,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 12:19:55,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:55,997 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-09 12:19:56,017 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-09 12:19:56,197 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-09 12:19:56,198 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-09 12:19:56,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:56,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2065289435, now seen corresponding path program 1 times [2024-11-09 12:19:56,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:56,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534085358] [2024-11-09 12:19:56,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:56,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:56,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:19:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:56,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 12:19:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:56,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:56,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:19:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:56,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 12:19:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:56,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 12:19:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:56,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:19:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:56,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 12:19:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:56,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 12:19:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:56,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 12:19:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:56,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 12:19:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:56,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 12:19:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:56,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 12:19:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:56,367 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-09 12:19:56,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:56,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534085358] [2024-11-09 12:19:56,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534085358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:19:56,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441490890] [2024-11-09 12:19:56,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:56,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:19:56,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:56,370 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-09 12:19:56,372 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-09 12:19:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:56,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:19:56,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:19:56,610 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-09 12:19:56,611 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:19:56,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441490890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:56,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:19:56,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-09 12:19:56,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434428886] [2024-11-09 12:19:56,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:56,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:19:56,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:56,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:19:56,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:19:56,614 INFO L87 Difference]: Start difference. First operand 291 states and 448 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 12:19:56,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:56,650 INFO L93 Difference]: Finished difference Result 294 states and 451 transitions. [2024-11-09 12:19:56,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:19:56,651 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-09 12:19:56,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:56,654 INFO L225 Difference]: With dead ends: 294 [2024-11-09 12:19:56,654 INFO L226 Difference]: Without dead ends: 293 [2024-11-09 12:19:56,655 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-09 12:19:56,655 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 7 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:56,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 846 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:19:56,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-09 12:19:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 292. [2024-11-09 12:19:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 228 states have (on average 1.5482456140350878) internal successors, (353), 235 states have internal predecessors, (353), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 12:19:56,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 449 transitions. [2024-11-09 12:19:56,669 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 449 transitions. Word has length 117 [2024-11-09 12:19:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:56,671 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 449 transitions. [2024-11-09 12:19:56,671 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-09 12:19:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 449 transitions. [2024-11-09 12:19:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 12:19:56,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:56,675 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-09 12:19:56,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 12:19:56,875 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-09 12:19:56,876 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-09 12:19:56,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:56,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1738973469, now seen corresponding path program 1 times [2024-11-09 12:19:56,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:56,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417168442] [2024-11-09 12:19:56,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:56,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:56,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:19:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:56,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 12:19:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:56,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:19:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 12:19:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 12:19:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:19:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 12:19:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 12:19:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 12:19:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 12:19:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 12:19:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 12:19:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,053 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-09 12:19:57,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:57,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417168442] [2024-11-09 12:19:57,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417168442] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:19:57,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211472892] [2024-11-09 12:19:57,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:57,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:19:57,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:57,056 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-09 12:19:57,058 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-09 12:19:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 12:19:57,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:19:57,270 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-09 12:19:57,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:19:57,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211472892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:57,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:19:57,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-09 12:19:57,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835931769] [2024-11-09 12:19:57,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:57,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 12:19:57,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:57,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 12:19:57,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:19:57,276 INFO L87 Difference]: Start difference. First operand 292 states and 449 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 12:19:57,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:57,327 INFO L93 Difference]: Finished difference Result 302 states and 465 transitions. [2024-11-09 12:19:57,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:19:57,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-11-09 12:19:57,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:57,331 INFO L225 Difference]: With dead ends: 302 [2024-11-09 12:19:57,331 INFO L226 Difference]: Without dead ends: 301 [2024-11-09 12:19:57,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:19:57,332 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 12 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:57,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1144 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:19:57,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-09 12:19:57,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 293. [2024-11-09 12:19:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 229 states have (on average 1.5458515283842795) internal successors, (354), 236 states have internal predecessors, (354), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 12:19:57,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 450 transitions. [2024-11-09 12:19:57,345 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 450 transitions. Word has length 118 [2024-11-09 12:19:57,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:57,345 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 450 transitions. [2024-11-09 12:19:57,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 12:19:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 450 transitions. [2024-11-09 12:19:57,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 12:19:57,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:57,347 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-09 12:19:57,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-09 12:19:57,548 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-09 12:19:57,548 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-09 12:19:57,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:57,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1551181597, now seen corresponding path program 1 times [2024-11-09 12:19:57,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:57,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447893690] [2024-11-09 12:19:57,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:57,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:19:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 12:19:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:19:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 12:19:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 12:19:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:19:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 12:19:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 12:19:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 12:19:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 12:19:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 12:19:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 12:19:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,736 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-09 12:19:57,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:57,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447893690] [2024-11-09 12:19:57,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447893690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:19:57,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212337428] [2024-11-09 12:19:57,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:57,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:19:57,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:57,739 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-09 12:19:57,741 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-09 12:19:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:57,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 12:19:57,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:19:58,012 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-09 12:19:58,013 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:19:58,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212337428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:58,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:19:58,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-09 12:19:58,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514216355] [2024-11-09 12:19:58,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:58,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 12:19:58,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:58,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 12:19:58,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:19:58,016 INFO L87 Difference]: Start difference. First operand 293 states and 450 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 12:19:58,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:58,069 INFO L93 Difference]: Finished difference Result 299 states and 462 transitions. [2024-11-09 12:19:58,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:19:58,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-11-09 12:19:58,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:58,072 INFO L225 Difference]: With dead ends: 299 [2024-11-09 12:19:58,073 INFO L226 Difference]: Without dead ends: 298 [2024-11-09 12:19:58,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:19:58,074 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 10 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:58,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1123 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:19:58,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-09 12:19:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 291. [2024-11-09 12:19:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 228 states have (on average 1.543859649122807) internal successors, (352), 234 states have internal predecessors, (352), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 12:19:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 448 transitions. [2024-11-09 12:19:58,088 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 448 transitions. Word has length 118 [2024-11-09 12:19:58,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:58,089 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 448 transitions. [2024-11-09 12:19:58,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 12:19:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 448 transitions. [2024-11-09 12:19:58,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 12:19:58,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:58,091 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-09 12:19:58,112 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-09 12:19:58,292 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-09 12:19:58,293 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-09 12:19:58,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:58,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1926396969, now seen corresponding path program 1 times [2024-11-09 12:19:58,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:58,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317483860] [2024-11-09 12:19:58,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:58,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:58,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:19:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:58,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 12:19:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:58,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:58,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:19:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:58,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 12:19:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:58,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 12:19:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:58,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:19:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:58,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 12:19:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:58,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 12:19:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:58,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 12:19:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:58,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 12:19:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:58,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 12:19:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:58,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 12:19:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:58,463 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-09 12:19:58,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:58,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317483860] [2024-11-09 12:19:58,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317483860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:19:58,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794653296] [2024-11-09 12:19:58,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:58,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:19:58,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:58,466 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-09 12:19:58,467 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-09 12:19:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:58,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:19:58,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:19:58,696 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-09 12:19:58,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:19:58,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794653296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:58,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:19:58,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-09 12:19:58,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264822089] [2024-11-09 12:19:58,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:58,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:19:58,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:58,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:19:58,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 12:19:58,699 INFO L87 Difference]: Start difference. First operand 291 states and 448 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 12:19:58,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:58,765 INFO L93 Difference]: Finished difference Result 505 states and 779 transitions. [2024-11-09 12:19:58,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:19:58,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 119 [2024-11-09 12:19:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:58,770 INFO L225 Difference]: With dead ends: 505 [2024-11-09 12:19:58,770 INFO L226 Difference]: Without dead ends: 304 [2024-11-09 12:19:58,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 12:19:58,773 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 16 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:58,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1428 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:19:58,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-09 12:19:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 296. [2024-11-09 12:19:58,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 232 states have (on average 1.5387931034482758) internal successors, (357), 238 states have internal predecessors, (357), 49 states have call successors, (49), 14 states have call predecessors, (49), 14 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-09 12:19:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 455 transitions. [2024-11-09 12:19:58,787 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 455 transitions. Word has length 119 [2024-11-09 12:19:58,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:58,787 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 455 transitions. [2024-11-09 12:19:58,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 12:19:58,788 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 455 transitions. [2024-11-09 12:19:58,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 12:19:58,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:58,790 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-09 12:19:58,811 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-09 12:19:58,991 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-09 12:19:58,991 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-09 12:19:58,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:58,992 INFO L85 PathProgramCache]: Analyzing trace with hash 841989591, now seen corresponding path program 1 times [2024-11-09 12:19:58,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:58,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232229547] [2024-11-09 12:19:58,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:58,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:19:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 12:19:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:19:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 12:19:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 12:19:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:19:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 12:19:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 12:19:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 12:19:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 12:19:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 12:19:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 12:19:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,153 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-09 12:19:59,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:59,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232229547] [2024-11-09 12:19:59,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232229547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:19:59,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574722524] [2024-11-09 12:19:59,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:59,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:19:59,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:59,157 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-09 12:19:59,158 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-09 12:19:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:19:59,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:19:59,412 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-09 12:19:59,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:19:59,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574722524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:19:59,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:19:59,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-09 12:19:59,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329811742] [2024-11-09 12:19:59,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:19:59,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:19:59,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:19:59,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:19:59,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 12:19:59,415 INFO L87 Difference]: Start difference. First operand 296 states and 455 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 12:19:59,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:19:59,466 INFO L93 Difference]: Finished difference Result 307 states and 470 transitions. [2024-11-09 12:19:59,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:19:59,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 119 [2024-11-09 12:19:59,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:19:59,469 INFO L225 Difference]: With dead ends: 307 [2024-11-09 12:19:59,469 INFO L226 Difference]: Without dead ends: 306 [2024-11-09 12:19:59,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 12:19:59,470 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 18 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:19:59,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1370 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:19:59,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-09 12:19:59,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 293. [2024-11-09 12:19:59,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 230 states have (on average 1.5391304347826087) internal successors, (354), 236 states have internal predecessors, (354), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 12:19:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 450 transitions. [2024-11-09 12:19:59,481 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 450 transitions. Word has length 119 [2024-11-09 12:19:59,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:19:59,481 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 450 transitions. [2024-11-09 12:19:59,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 12:19:59,482 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 450 transitions. [2024-11-09 12:19:59,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 12:19:59,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:19:59,484 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:19:59,505 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-09 12:19:59,685 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-09 12:19:59,686 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-09 12:19:59,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:19:59,686 INFO L85 PathProgramCache]: Analyzing trace with hash -696507949, now seen corresponding path program 1 times [2024-11-09 12:19:59,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:19:59,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135539860] [2024-11-09 12:19:59,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:59,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:19:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:19:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 12:19:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 12:19:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:19:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 12:19:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 12:19:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:19:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 12:19:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 12:19:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 12:19:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 12:19:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 12:19:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 12:19:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:19:59,856 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-09 12:19:59,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:19:59,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135539860] [2024-11-09 12:19:59,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135539860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:19:59,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127272531] [2024-11-09 12:19:59,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:19:59,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:19:59,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:19:59,859 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-09 12:19:59,861 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-09 12:20:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:00,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 12:20:00,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:00,128 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-09 12:20:00,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:20:00,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127272531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:00,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:20:00,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2024-11-09 12:20:00,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860313752] [2024-11-09 12:20:00,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:00,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 12:20:00,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:00,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 12:20:00,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-09 12:20:00,131 INFO L87 Difference]: Start difference. First operand 293 states and 450 transitions. Second operand has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-09 12:20:00,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:00,204 INFO L93 Difference]: Finished difference Result 307 states and 475 transitions. [2024-11-09 12:20:00,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 12:20:00,205 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 121 [2024-11-09 12:20:00,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:00,206 INFO L225 Difference]: With dead ends: 307 [2024-11-09 12:20:00,206 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 12:20:00,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-09 12:20:00,209 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 28 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:00,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1656 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:20:00,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 12:20:00,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 12:20:00,210 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-09 12:20:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 12:20:00,211 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2024-11-09 12:20:00,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:00,211 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 12:20:00,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-09 12:20:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 12:20:00,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 12:20:00,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-09 12:20:00,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-09 12:20:00,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-09 12:20:00,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-09 12:20:00,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-09 12:20:00,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-09 12:20:00,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-09 12:20:00,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-09 12:20:00,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-09 12:20:00,417 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-09 12:20:00,421 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-09 12:20:00,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 12:20:00,758 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 12:20:00,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:20:00 BoogieIcfgContainer [2024-11-09 12:20:00,788 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 12:20:00,789 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 12:20:00,789 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 12:20:00,790 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 12:20:00,791 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:45" (3/4) ... [2024-11-09 12:20:00,793 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 12:20:00,799 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_int8 [2024-11-09 12:20:00,799 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_bool [2024-11-09 12:20:00,799 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert [2024-11-09 12:20:00,800 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure add_history_type [2024-11-09 12:20:00,800 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 12:20:00,800 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure write_history_bool [2024-11-09 12:20:00,815 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-09 12:20:00,817 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-09 12:20:00,817 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 12:20:00,818 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 12:20:00,854 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2024-11-09 12:20:00,907 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2024-11-09 12:20:00,974 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 12:20:00,978 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 12:20:00,978 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 12:20:00,979 INFO L158 Benchmark]: Toolchain (without parser) took 17442.84ms. Allocated memory was 184.5MB in the beginning and 362.8MB in the end (delta: 178.3MB). Free memory was 116.6MB in the beginning and 146.4MB in the end (delta: -29.8MB). Peak memory consumption was 150.3MB. Max. memory is 16.1GB. [2024-11-09 12:20:00,979 INFO L158 Benchmark]: CDTParser took 1.15ms. Allocated memory is still 104.9MB. Free memory is still 66.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 12:20:00,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.72ms. Allocated memory is still 184.5MB. Free memory was 116.4MB in the beginning and 97.8MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 12:20:00,980 INFO L158 Benchmark]: Boogie Procedure Inliner took 126.60ms. Allocated memory is still 184.5MB. Free memory was 97.8MB in the beginning and 155.3MB in the end (delta: -57.5MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2024-11-09 12:20:00,980 INFO L158 Benchmark]: Boogie Preprocessor took 118.87ms. Allocated memory is still 184.5MB. Free memory was 155.3MB in the beginning and 151.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 12:20:00,980 INFO L158 Benchmark]: RCFGBuilder took 947.68ms. Allocated memory is still 184.5MB. Free memory was 151.1MB in the beginning and 110.5MB in the end (delta: 40.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-09 12:20:00,981 INFO L158 Benchmark]: TraceAbstraction took 15555.17ms. Allocated memory was 184.5MB in the beginning and 362.8MB in the end (delta: 178.3MB). Free memory was 110.5MB in the beginning and 159.0MB in the end (delta: -48.5MB). Peak memory consumption was 132.3MB. Max. memory is 16.1GB. [2024-11-09 12:20:00,981 INFO L158 Benchmark]: Witness Printer took 189.68ms. Allocated memory is still 362.8MB. Free memory was 159.0MB in the beginning and 146.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 12:20:00,985 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.15ms. Allocated memory is still 104.9MB. Free memory is still 66.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.72ms. Allocated memory is still 184.5MB. Free memory was 116.4MB in the beginning and 97.8MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 126.60ms. Allocated memory is still 184.5MB. Free memory was 97.8MB in the beginning and 155.3MB in the end (delta: -57.5MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 118.87ms. Allocated memory is still 184.5MB. Free memory was 155.3MB in the beginning and 151.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 947.68ms. Allocated memory is still 184.5MB. Free memory was 151.1MB in the beginning and 110.5MB in the end (delta: 40.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15555.17ms. Allocated memory was 184.5MB in the beginning and 362.8MB in the end (delta: 178.3MB). Free memory was 110.5MB in the beginning and 159.0MB in the end (delta: -48.5MB). Peak memory consumption was 132.3MB. Max. memory is 16.1GB. * Witness Printer took 189.68ms. Allocated memory is still 362.8MB. Free memory was 159.0MB in the beginning and 146.4MB in the end (delta: 12.6MB). 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, 194 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 398 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 363 mSDsluCounter, 21743 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15454 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1000 IncrementalHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 6289 mSDtfsCounter, 1000 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2509 GetRequests, 2351 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=20, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 122 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 3997 NumberOfCodeBlocks, 3997 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3956 ConstructedInterpolants, 0 QuantifiedInterpolants, 6034 SizeOfPredicates, 0 NumberOfNonLiveVariables, 10605 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 41 InterpolantComputations, 22 PerfectInterpolantSequences, 1814/1875 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 104]: Procedure Contract for read_history_int8 Derived contract for procedure read_history_int8. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 124]: Procedure Contract for read_history_bool Derived contract for procedure read_history_bool. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 530]: Procedure Contract for assert Derived contract for procedure assert. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 60]: Procedure Contract for add_history_type Derived contract for procedure add_history_type. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 36]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 179]: Procedure Contract for write_history_bool Derived contract for procedure write_history_bool. Ensures: (((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) RESULT: Ultimate proved your program to be correct! [2024-11-09 12:20:01,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE