./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.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 5c227f1dec7d604552aae19de1afcc1049837e83568477af6195219b22e2f636 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 21:17:20,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 21:17:20,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 21:17:20,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 21:17:20,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 21:17:20,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 21:17:20,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 21:17:20,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 21:17:20,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 21:17:20,152 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 21:17:20,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 21:17:20,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 21:17:20,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 21:17:20,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 21:17:20,153 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 21:17:20,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 21:17:20,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 21:17:20,154 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 21:17:20,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 21:17:20,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 21:17:20,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 21:17:20,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 21:17:20,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 21:17:20,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 21:17:20,155 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 21:17:20,156 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 21:17:20,156 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 21:17:20,156 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 21:17:20,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 21:17:20,156 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 21:17:20,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 21:17:20,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 21:17:20,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 21:17:20,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 21:17:20,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:17:20,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 21:17:20,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 21:17:20,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 21:17:20,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 21:17:20,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 21:17:20,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 21:17:20,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 21:17:20,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 21:17:20,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 21:17:20,160 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 -> 5c227f1dec7d604552aae19de1afcc1049837e83568477af6195219b22e2f636 [2024-10-14 21:17:20,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 21:17:20,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 21:17:20,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 21:17:20,375 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 21:17:20,375 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 21:17:20,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2024-10-14 21:17:21,586 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 21:17:21,763 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 21:17:21,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2024-10-14 21:17:21,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1d804d8e/4923a2a9e047428a95ad42b9a5014ff3/FLAG73b52c7bd [2024-10-14 21:17:22,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1d804d8e/4923a2a9e047428a95ad42b9a5014ff3 [2024-10-14 21:17:22,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 21:17:22,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 21:17:22,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 21:17:22,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 21:17:22,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 21:17:22,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:17:22" (1/1) ... [2024-10-14 21:17:22,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c7e0610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:22, skipping insertion in model container [2024-10-14 21:17:22,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:17:22" (1/1) ... [2024-10-14 21:17:22,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 21:17:22,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:17:22,448 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 21:17:22,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:17:22,523 INFO L204 MainTranslator]: Completed translation [2024-10-14 21:17:22,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:22 WrapperNode [2024-10-14 21:17:22,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 21:17:22,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 21:17:22,524 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 21:17:22,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 21:17:22,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:22" (1/1) ... [2024-10-14 21:17:22,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:22" (1/1) ... [2024-10-14 21:17:22,590 INFO L138 Inliner]: procedures = 28, calls = 52, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 428 [2024-10-14 21:17:22,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 21:17:22,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 21:17:22,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 21:17:22,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 21:17:22,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:22" (1/1) ... [2024-10-14 21:17:22,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:22" (1/1) ... [2024-10-14 21:17:22,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:22" (1/1) ... [2024-10-14 21:17:22,644 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-10-14 21:17:22,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:22" (1/1) ... [2024-10-14 21:17:22,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:22" (1/1) ... [2024-10-14 21:17:22,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:22" (1/1) ... [2024-10-14 21:17:22,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:22" (1/1) ... [2024-10-14 21:17:22,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:22" (1/1) ... [2024-10-14 21:17:22,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:22" (1/1) ... [2024-10-14 21:17:22,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 21:17:22,665 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 21:17:22,665 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 21:17:22,665 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 21:17:22,666 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:22" (1/1) ... [2024-10-14 21:17:22,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:17:22,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:22,691 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-10-14 21:17:22,694 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-10-14 21:17:22,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 21:17:22,731 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-10-14 21:17:22,731 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-10-14 21:17:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-14 21:17:22,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-14 21:17:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-10-14 21:17:22,732 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-10-14 21:17:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-10-14 21:17:22,732 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-10-14 21:17:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-10-14 21:17:22,732 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-10-14 21:17:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 21:17:22,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 21:17:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 21:17:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 21:17:22,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 21:17:22,823 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 21:17:22,824 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 21:17:23,268 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-10-14 21:17:23,268 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 21:17:23,307 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 21:17:23,308 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 21:17:23,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:17:23 BoogieIcfgContainer [2024-10-14 21:17:23,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 21:17:23,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 21:17:23,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 21:17:23,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 21:17:23,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:17:22" (1/3) ... [2024-10-14 21:17:23,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85ecb6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:17:23, skipping insertion in model container [2024-10-14 21:17:23,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:17:22" (2/3) ... [2024-10-14 21:17:23,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85ecb6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:17:23, skipping insertion in model container [2024-10-14 21:17:23,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:17:23" (3/3) ... [2024-10-14 21:17:23,316 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2024-10-14 21:17:23,329 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 21:17:23,329 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-14 21:17:23,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 21:17:23,396 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;@2ba39966, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 21:17:23,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-14 21:17:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 135 states have (on average 1.6222222222222222) internal successors, (219), 147 states have internal predecessors, (219), 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-10-14 21:17:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 21:17:23,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:23,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:23,406 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-10-14 21:17:23,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:23,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1192890858, now seen corresponding path program 1 times [2024-10-14 21:17:23,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:23,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280752471] [2024-10-14 21:17:23,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:23,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:17:23,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:23,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280752471] [2024-10-14 21:17:23,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280752471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:23,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:23,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 21:17:23,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868091164] [2024-10-14 21:17:23,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:23,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:23,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:23,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:23,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:17:23,719 INFO L87 Difference]: Start difference. First operand has 187 states, 135 states have (on average 1.6222222222222222) internal successors, (219), 147 states have internal predecessors, (219), 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.25) internal successors, (9), 3 states have internal predecessors, (9), 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-10-14 21:17:23,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:23,858 INFO L93 Difference]: Finished difference Result 394 states and 653 transitions. [2024-10-14 21:17:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:17:23,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2024-10-14 21:17:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:23,871 INFO L225 Difference]: With dead ends: 394 [2024-10-14 21:17:23,871 INFO L226 Difference]: Without dead ends: 209 [2024-10-14 21:17:23,875 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-10-14 21:17:23,877 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 37 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:23,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 847 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-14 21:17:23,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 202. [2024-10-14 21:17:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 149 states have (on average 1.5771812080536913) internal successors, (235), 160 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-10-14 21:17:23,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 311 transitions. [2024-10-14 21:17:23,920 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 311 transitions. Word has length 10 [2024-10-14 21:17:23,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:23,920 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 311 transitions. [2024-10-14 21:17:23,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-10-14 21:17:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 311 transitions. [2024-10-14 21:17:23,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 21:17:23,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:23,922 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:23,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 21:17:23,923 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-10-14 21:17:23,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:23,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1904217733, now seen corresponding path program 1 times [2024-10-14 21:17:23,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:23,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639990947] [2024-10-14 21:17:23,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:23,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:24,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:17:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:24,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:17:24,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:24,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639990947] [2024-10-14 21:17:24,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639990947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:24,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:24,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:17:24,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050871539] [2024-10-14 21:17:24,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:24,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:24,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:24,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:24,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:17:24,068 INFO L87 Difference]: Start difference. First operand 202 states and 311 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-14 21:17:24,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:24,126 INFO L93 Difference]: Finished difference Result 428 states and 668 transitions. [2024-10-14 21:17:24,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:24,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 15 [2024-10-14 21:17:24,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:24,135 INFO L225 Difference]: With dead ends: 428 [2024-10-14 21:17:24,135 INFO L226 Difference]: Without dead ends: 237 [2024-10-14 21:17:24,137 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-10-14 21:17:24,139 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 19 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:24,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 850 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-14 21:17:24,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2024-10-14 21:17:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 175 states have (on average 1.542857142857143) internal successors, (270), 186 states have internal predecessors, (270), 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-10-14 21:17:24,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 356 transitions. [2024-10-14 21:17:24,168 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 356 transitions. Word has length 15 [2024-10-14 21:17:24,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:24,168 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 356 transitions. [2024-10-14 21:17:24,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-14 21:17:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 356 transitions. [2024-10-14 21:17:24,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 21:17:24,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:24,170 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:24,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 21:17:24,170 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-10-14 21:17:24,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:24,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2095029200, now seen corresponding path program 1 times [2024-10-14 21:17:24,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:24,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015119785] [2024-10-14 21:17:24,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:24,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:24,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:17:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:24,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 21:17:24,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:24,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015119785] [2024-10-14 21:17:24,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015119785] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:24,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106799583] [2024-10-14 21:17:24,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:24,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:24,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:24,273 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-10-14 21:17:24,275 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-10-14 21:17:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:24,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 21:17:24,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:24,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 21:17:24,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:24,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106799583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:24,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:24,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-14 21:17:24,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791938400] [2024-10-14 21:17:24,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:24,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:17:24,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:24,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:17:24,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:24,411 INFO L87 Difference]: Start difference. First operand 233 states and 356 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-10-14 21:17:24,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:24,446 INFO L93 Difference]: Finished difference Result 237 states and 362 transitions. [2024-10-14 21:17:24,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:24,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 28 [2024-10-14 21:17:24,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:24,450 INFO L225 Difference]: With dead ends: 237 [2024-10-14 21:17:24,451 INFO L226 Difference]: Without dead ends: 236 [2024-10-14 21:17:24,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:24,452 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 19 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:24,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 812 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:24,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-14 21:17:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 232. [2024-10-14 21:17:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 175 states have (on average 1.5257142857142858) internal successors, (267), 185 states have internal predecessors, (267), 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-10-14 21:17:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 353 transitions. [2024-10-14 21:17:24,471 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 353 transitions. Word has length 28 [2024-10-14 21:17:24,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:24,471 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 353 transitions. [2024-10-14 21:17:24,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-10-14 21:17:24,471 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 353 transitions. [2024-10-14 21:17:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 21:17:24,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:24,473 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 21:17:24,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 21:17:24,673 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-10-14 21:17:24,674 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-10-14 21:17:24,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:24,674 INFO L85 PathProgramCache]: Analyzing trace with hash 521396277, now seen corresponding path program 1 times [2024-10-14 21:17:24,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:24,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278383268] [2024-10-14 21:17:24,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:24,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:24,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 21:17:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:24,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 21:17:24,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:24,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278383268] [2024-10-14 21:17:24,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278383268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:24,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:17:24,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:17:24,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663363909] [2024-10-14 21:17:24,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:24,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:24,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:24,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:24,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:17:24,819 INFO L87 Difference]: Start difference. First operand 232 states and 353 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-10-14 21:17:24,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:24,852 INFO L93 Difference]: Finished difference Result 236 states and 359 transitions. [2024-10-14 21:17:24,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:24,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-10-14 21:17:24,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:24,854 INFO L225 Difference]: With dead ends: 236 [2024-10-14 21:17:24,854 INFO L226 Difference]: Without dead ends: 235 [2024-10-14 21:17:24,855 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-10-14 21:17:24,857 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 18 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:24,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 814 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-14 21:17:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 202. [2024-10-14 21:17:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 151 states have (on average 1.5298013245033113) internal successors, (231), 160 states have internal predecessors, (231), 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-10-14 21:17:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 307 transitions. [2024-10-14 21:17:24,874 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 307 transitions. Word has length 29 [2024-10-14 21:17:24,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:24,875 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 307 transitions. [2024-10-14 21:17:24,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-10-14 21:17:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 307 transitions. [2024-10-14 21:17:24,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 21:17:24,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:24,878 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] [2024-10-14 21:17:24,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 21:17:24,879 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-10-14 21:17:24,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:24,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1882601904, now seen corresponding path program 1 times [2024-10-14 21:17:24,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:24,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512218377] [2024-10-14 21:17:24,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:24,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:24,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:17:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:17:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 21:17:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:17:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 21:17:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 21:17:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 21:17:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 21:17:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-14 21:17:25,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:25,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512218377] [2024-10-14 21:17:25,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512218377] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:25,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622146067] [2024-10-14 21:17:25,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:25,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:25,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:25,077 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-10-14 21:17:25,078 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-10-14 21:17:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:17:25,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:25,244 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 21:17:25,245 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:25,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622146067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:25,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:25,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-14 21:17:25,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410448161] [2024-10-14 21:17:25,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:25,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:25,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:25,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:25,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:25,247 INFO L87 Difference]: Start difference. First operand 202 states and 307 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-10-14 21:17:25,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:25,295 INFO L93 Difference]: Finished difference Result 352 states and 543 transitions. [2024-10-14 21:17:25,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:17:25,296 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 90 [2024-10-14 21:17:25,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:25,297 INFO L225 Difference]: With dead ends: 352 [2024-10-14 21:17:25,297 INFO L226 Difference]: Without dead ends: 209 [2024-10-14 21:17:25,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 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-10-14 21:17:25,298 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 10 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:25,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 818 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:25,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-14 21:17:25,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-10-14 21:17:25,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 166 states have internal predecessors, (239), 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-10-14 21:17:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 317 transitions. [2024-10-14 21:17:25,307 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 317 transitions. Word has length 90 [2024-10-14 21:17:25,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:25,308 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 317 transitions. [2024-10-14 21:17:25,308 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-10-14 21:17:25,308 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 317 transitions. [2024-10-14 21:17:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 21:17:25,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:25,315 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] [2024-10-14 21:17:25,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 21:17:25,515 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-10-14 21:17:25,516 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-10-14 21:17:25,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:25,516 INFO L85 PathProgramCache]: Analyzing trace with hash 722979448, now seen corresponding path program 1 times [2024-10-14 21:17:25,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:25,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255325080] [2024-10-14 21:17:25,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:25,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:17:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:17:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 21:17:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 21:17:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 21:17:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 21:17:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 21:17:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 21:17:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,673 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-14 21:17:25,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:25,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255325080] [2024-10-14 21:17:25,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255325080] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:25,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823874475] [2024-10-14 21:17:25,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:25,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:25,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:25,675 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-10-14 21:17:25,676 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-10-14 21:17:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:25,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:17:25,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 21:17:25,823 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:25,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823874475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:25,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:25,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-14 21:17:25,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42558669] [2024-10-14 21:17:25,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:25,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:25,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:25,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:25,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:25,825 INFO L87 Difference]: Start difference. First operand 209 states and 317 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-10-14 21:17:25,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:25,881 INFO L93 Difference]: Finished difference Result 366 states and 562 transitions. [2024-10-14 21:17:25,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:17:25,882 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 92 [2024-10-14 21:17:25,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:25,884 INFO L225 Difference]: With dead ends: 366 [2024-10-14 21:17:25,884 INFO L226 Difference]: Without dead ends: 216 [2024-10-14 21:17:25,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:17:25,886 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 8 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:25,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 815 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:25,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-14 21:17:25,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-10-14 21:17:25,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 172 states have internal predecessors, (247), 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-10-14 21:17:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 327 transitions. [2024-10-14 21:17:25,898 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 327 transitions. Word has length 92 [2024-10-14 21:17:25,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:25,898 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 327 transitions. [2024-10-14 21:17:25,899 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-10-14 21:17:25,899 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 327 transitions. [2024-10-14 21:17:25,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 21:17:25,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:25,901 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] [2024-10-14 21:17:25,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 21:17:26,102 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-10-14 21:17:26,103 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-10-14 21:17:26,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:26,104 INFO L85 PathProgramCache]: Analyzing trace with hash 983826510, now seen corresponding path program 1 times [2024-10-14 21:17:26,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:26,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32653444] [2024-10-14 21:17:26,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:26,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:17:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:17:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 21:17:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:17:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 21:17:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 21:17:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 21:17:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-14 21:17:26,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:26,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32653444] [2024-10-14 21:17:26,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32653444] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:26,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750472805] [2024-10-14 21:17:26,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:26,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:26,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:26,279 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-10-14 21:17:26,280 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-10-14 21:17:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:17:26,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:26,429 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-14 21:17:26,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:26,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750472805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:26,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:26,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-14 21:17:26,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533522486] [2024-10-14 21:17:26,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:26,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:26,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:26,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:26,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:26,431 INFO L87 Difference]: Start difference. First operand 216 states and 327 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-10-14 21:17:26,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:26,524 INFO L93 Difference]: Finished difference Result 391 states and 612 transitions. [2024-10-14 21:17:26,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:17:26,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-10-14 21:17:26,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:26,526 INFO L225 Difference]: With dead ends: 391 [2024-10-14 21:17:26,526 INFO L226 Difference]: Without dead ends: 234 [2024-10-14 21:17:26,526 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-10-14 21:17:26,527 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 39 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:26,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 776 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:26,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-14 21:17:26,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2024-10-14 21:17:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 173 states have (on average 1.5491329479768785) internal successors, (268), 184 states have internal predecessors, (268), 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-10-14 21:17:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 350 transitions. [2024-10-14 21:17:26,539 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 350 transitions. Word has length 93 [2024-10-14 21:17:26,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:26,540 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 350 transitions. [2024-10-14 21:17:26,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-10-14 21:17:26,540 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 350 transitions. [2024-10-14 21:17:26,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 21:17:26,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:26,541 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] [2024-10-14 21:17:26,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 21:17:26,741 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-10-14 21:17:26,742 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-10-14 21:17:26,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:26,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1517624601, now seen corresponding path program 1 times [2024-10-14 21:17:26,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:26,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666236464] [2024-10-14 21:17:26,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:26,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:17:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:17:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 21:17:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:17:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 21:17:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 21:17:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 21:17:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,881 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-10-14 21:17:26,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:26,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666236464] [2024-10-14 21:17:26,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666236464] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:26,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485233708] [2024-10-14 21:17:26,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:26,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:26,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:26,883 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-10-14 21:17:26,886 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-10-14 21:17:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:26,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:17:27,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:17:27,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:27,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485233708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:27,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:27,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-14 21:17:27,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407419734] [2024-10-14 21:17:27,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:27,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:27,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:27,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:27,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:27,024 INFO L87 Difference]: Start difference. First operand 230 states and 350 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-10-14 21:17:27,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:27,079 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2024-10-14 21:17:27,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:17:27,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 96 [2024-10-14 21:17:27,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:27,082 INFO L225 Difference]: With dead ends: 466 [2024-10-14 21:17:27,082 INFO L226 Difference]: Without dead ends: 254 [2024-10-14 21:17:27,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:17:27,083 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 21 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:27,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 796 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-14 21:17:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-10-14 21:17:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 193 states have (on average 1.5647668393782384) internal successors, (302), 204 states have internal predecessors, (302), 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-10-14 21:17:27,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 388 transitions. [2024-10-14 21:17:27,092 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 388 transitions. Word has length 96 [2024-10-14 21:17:27,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:27,093 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 388 transitions. [2024-10-14 21:17:27,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-10-14 21:17:27,093 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 388 transitions. [2024-10-14 21:17:27,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 21:17:27,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:27,094 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] [2024-10-14 21:17:27,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 21:17:27,301 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-10-14 21:17:27,302 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-10-14 21:17:27,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:27,303 INFO L85 PathProgramCache]: Analyzing trace with hash -884165371, now seen corresponding path program 1 times [2024-10-14 21:17:27,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:27,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155810082] [2024-10-14 21:17:27,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:27,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:17:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:17:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 21:17:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:17:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 21:17:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 21:17:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 21:17:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-14 21:17:27,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:27,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155810082] [2024-10-14 21:17:27,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155810082] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:27,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106761290] [2024-10-14 21:17:27,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:27,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:27,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:27,453 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-10-14 21:17:27,454 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-10-14 21:17:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:17:27,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-14 21:17:27,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:27,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106761290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:27,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:27,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-14 21:17:27,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691987783] [2024-10-14 21:17:27,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:27,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:27,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:27,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:27,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:27,590 INFO L87 Difference]: Start difference. First operand 254 states and 388 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-10-14 21:17:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:27,651 INFO L93 Difference]: Finished difference Result 510 states and 789 transitions. [2024-10-14 21:17:27,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:17:27,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-14 21:17:27,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:27,654 INFO L225 Difference]: With dead ends: 510 [2024-10-14 21:17:27,654 INFO L226 Difference]: Without dead ends: 274 [2024-10-14 21:17:27,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:17:27,656 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 19 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:27,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 783 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:27,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-14 21:17:27,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-10-14 21:17:27,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 209 states have (on average 1.569377990430622) internal successors, (328), 220 states have internal predecessors, (328), 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-10-14 21:17:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 418 transitions. [2024-10-14 21:17:27,667 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 418 transitions. Word has length 98 [2024-10-14 21:17:27,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:27,668 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 418 transitions. [2024-10-14 21:17:27,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-10-14 21:17:27,668 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 418 transitions. [2024-10-14 21:17:27,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 21:17:27,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:27,669 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] [2024-10-14 21:17:27,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 21:17:27,869 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-10-14 21:17:27,870 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-10-14 21:17:27,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:27,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1267993251, now seen corresponding path program 1 times [2024-10-14 21:17:27,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:27,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509273388] [2024-10-14 21:17:27,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:27,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:17:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:17:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 21:17:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:17:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 21:17:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 21:17:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 21:17:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:27,992 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:17:27,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:27,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509273388] [2024-10-14 21:17:27,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509273388] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:27,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635185015] [2024-10-14 21:17:27,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:27,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:27,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:27,994 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-10-14 21:17:28,008 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-10-14 21:17:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:28,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:17:28,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:28,138 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-14 21:17:28,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:28,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635185015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:28,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:28,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-14 21:17:28,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560226067] [2024-10-14 21:17:28,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:28,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:28,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:28,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:28,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:28,142 INFO L87 Difference]: Start difference. First operand 274 states and 418 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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-10-14 21:17:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:28,177 INFO L93 Difference]: Finished difference Result 282 states and 433 transitions. [2024-10-14 21:17:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:28,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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 99 [2024-10-14 21:17:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:28,180 INFO L225 Difference]: With dead ends: 282 [2024-10-14 21:17:28,180 INFO L226 Difference]: Without dead ends: 281 [2024-10-14 21:17:28,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 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-10-14 21:17:28,181 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 12 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 833 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-10-14 21:17:28,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 833 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:28,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-14 21:17:28,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 273. [2024-10-14 21:17:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 209 states have (on average 1.5645933014354068) internal successors, (327), 219 states have internal predecessors, (327), 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-10-14 21:17:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 417 transitions. [2024-10-14 21:17:28,191 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 417 transitions. Word has length 99 [2024-10-14 21:17:28,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:28,191 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 417 transitions. [2024-10-14 21:17:28,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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-10-14 21:17:28,192 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 417 transitions. [2024-10-14 21:17:28,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 21:17:28,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:28,193 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-10-14 21:17:28,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 21:17:28,393 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-10-14 21:17:28,394 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-10-14 21:17:28,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:28,394 INFO L85 PathProgramCache]: Analyzing trace with hash -653084806, now seen corresponding path program 1 times [2024-10-14 21:17:28,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:28,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039498295] [2024-10-14 21:17:28,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:28,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:28,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:28,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:28,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:28,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:17:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:28,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:17:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:28,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 21:17:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:28,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:17:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:28,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:28,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 21:17:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:28,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 21:17:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:28,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 21:17:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:28,509 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:17:28,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:28,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039498295] [2024-10-14 21:17:28,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039498295] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:28,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404596693] [2024-10-14 21:17:28,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:28,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:28,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:28,511 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-10-14 21:17:28,512 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-10-14 21:17:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:28,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:17:28,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-14 21:17:28,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:28,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404596693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:28,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:28,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-14 21:17:28,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632808335] [2024-10-14 21:17:28,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:28,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:28,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:28,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:28,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:28,650 INFO L87 Difference]: Start difference. First operand 273 states and 417 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-10-14 21:17:28,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:28,686 INFO L93 Difference]: Finished difference Result 467 states and 717 transitions. [2024-10-14 21:17:28,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:28,686 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-10-14 21:17:28,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:28,688 INFO L225 Difference]: With dead ends: 467 [2024-10-14 21:17:28,689 INFO L226 Difference]: Without dead ends: 283 [2024-10-14 21:17:28,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:28,690 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 11 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:28,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 823 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:28,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-14 21:17:28,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-10-14 21:17:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 218 states have (on average 1.5596330275229358) internal successors, (340), 227 states have internal predecessors, (340), 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-10-14 21:17:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 434 transitions. [2024-10-14 21:17:28,699 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 434 transitions. Word has length 100 [2024-10-14 21:17:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:28,699 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 434 transitions. [2024-10-14 21:17:28,700 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-10-14 21:17:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 434 transitions. [2024-10-14 21:17:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 21:17:28,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:28,701 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] [2024-10-14 21:17:28,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 21:17:28,901 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-10-14 21:17:28,902 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-10-14 21:17:28,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:28,902 INFO L85 PathProgramCache]: Analyzing trace with hash 744797739, now seen corresponding path program 1 times [2024-10-14 21:17:28,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:28,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699776780] [2024-10-14 21:17:28,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:28,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:28,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:28,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:28,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:17:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:17:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 21:17:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:17:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 21:17:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 21:17:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 21:17:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 21:17:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-14 21:17:29,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:29,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699776780] [2024-10-14 21:17:29,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699776780] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:29,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10437088] [2024-10-14 21:17:29,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:29,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:29,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:29,047 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-10-14 21:17:29,048 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-10-14 21:17:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:17:29,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 21:17:29,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:29,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10437088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:29,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:29,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-14 21:17:29,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453990138] [2024-10-14 21:17:29,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:29,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:29,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:29,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:29,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:29,191 INFO L87 Difference]: Start difference. First operand 283 states and 434 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, (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-10-14 21:17:29,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:29,224 INFO L93 Difference]: Finished difference Result 294 states and 453 transitions. [2024-10-14 21:17:29,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:29,224 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, (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 107 [2024-10-14 21:17:29,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:29,226 INFO L225 Difference]: With dead ends: 294 [2024-10-14 21:17:29,226 INFO L226 Difference]: Without dead ends: 293 [2024-10-14 21:17:29,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 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-10-14 21:17:29,227 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 10 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:29,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 819 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:29,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-14 21:17:29,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 284. [2024-10-14 21:17:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 219 states have (on average 1.5570776255707763) internal successors, (341), 228 states have internal predecessors, (341), 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-10-14 21:17:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 435 transitions. [2024-10-14 21:17:29,235 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 435 transitions. Word has length 107 [2024-10-14 21:17:29,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:29,235 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 435 transitions. [2024-10-14 21:17:29,236 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, (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-10-14 21:17:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 435 transitions. [2024-10-14 21:17:29,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 21:17:29,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:29,237 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-10-14 21:17:29,250 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-10-14 21:17:29,437 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-10-14 21:17:29,438 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-10-14 21:17:29,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:29,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1613893752, now seen corresponding path program 1 times [2024-10-14 21:17:29,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:29,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367197658] [2024-10-14 21:17:29,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:29,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:17:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:17:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 21:17:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:17:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 21:17:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 21:17:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 21:17:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 21:17:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-14 21:17:29,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:29,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367197658] [2024-10-14 21:17:29,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367197658] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:29,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486336100] [2024-10-14 21:17:29,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:29,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:29,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:29,565 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-10-14 21:17:29,567 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-10-14 21:17:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:29,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:17:29,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 21:17:29,733 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:29,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486336100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:29,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:29,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-14 21:17:29,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945944032] [2024-10-14 21:17:29,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:29,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:29,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:29,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:29,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:29,735 INFO L87 Difference]: Start difference. First operand 284 states and 435 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-10-14 21:17:29,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:29,780 INFO L93 Difference]: Finished difference Result 286 states and 437 transitions. [2024-10-14 21:17:29,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:29,780 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-10-14 21:17:29,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:29,782 INFO L225 Difference]: With dead ends: 286 [2024-10-14 21:17:29,782 INFO L226 Difference]: Without dead ends: 285 [2024-10-14 21:17:29,782 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-10-14 21:17:29,783 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 9 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:29,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 847 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:29,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-14 21:17:29,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-10-14 21:17:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 220 states have (on average 1.5545454545454545) internal successors, (342), 229 states have internal predecessors, (342), 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-10-14 21:17:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 436 transitions. [2024-10-14 21:17:29,793 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 436 transitions. Word has length 108 [2024-10-14 21:17:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:29,793 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 436 transitions. [2024-10-14 21:17:29,794 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-10-14 21:17:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 436 transitions. [2024-10-14 21:17:29,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 21:17:29,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:29,795 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-10-14 21:17:29,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-14 21:17:29,996 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-10-14 21:17:29,996 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-10-14 21:17:29,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:29,997 INFO L85 PathProgramCache]: Analyzing trace with hash 449697039, now seen corresponding path program 1 times [2024-10-14 21:17:29,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:29,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579413805] [2024-10-14 21:17:29,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:29,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:17:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:17:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 21:17:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:17:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 21:17:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 21:17:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 21:17:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 21:17:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-14 21:17:30,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:30,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579413805] [2024-10-14 21:17:30,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579413805] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:30,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744096751] [2024-10-14 21:17:30,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:30,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:30,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:30,127 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-10-14 21:17:30,128 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-10-14 21:17:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 21:17:30,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:30,273 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 21:17:30,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:30,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744096751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:30,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:30,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-10-14 21:17:30,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342851615] [2024-10-14 21:17:30,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:30,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:17:30,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:30,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:17:30,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:17:30,275 INFO L87 Difference]: Start difference. First operand 285 states and 436 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 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-10-14 21:17:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:30,313 INFO L93 Difference]: Finished difference Result 290 states and 446 transitions. [2024-10-14 21:17:30,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:17:30,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 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-10-14 21:17:30,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:30,315 INFO L225 Difference]: With dead ends: 290 [2024-10-14 21:17:30,315 INFO L226 Difference]: Without dead ends: 289 [2024-10-14 21:17:30,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:17:30,316 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 12 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:30,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1058 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:30,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-14 21:17:30,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 284. [2024-10-14 21:17:30,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 220 states have (on average 1.55) internal successors, (341), 228 states have internal predecessors, (341), 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-10-14 21:17:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 435 transitions. [2024-10-14 21:17:30,325 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 435 transitions. Word has length 109 [2024-10-14 21:17:30,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:30,325 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 435 transitions. [2024-10-14 21:17:30,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 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-10-14 21:17:30,326 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 435 transitions. [2024-10-14 21:17:30,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 21:17:30,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:30,327 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-10-14 21:17:30,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 21:17:30,531 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-10-14 21:17:30,532 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-10-14 21:17:30,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:30,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1055706644, now seen corresponding path program 1 times [2024-10-14 21:17:30,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:30,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668836318] [2024-10-14 21:17:30,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:30,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:17:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:17:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 21:17:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:17:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 21:17:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 21:17:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 21:17:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 21:17:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-14 21:17:30,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:30,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668836318] [2024-10-14 21:17:30,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668836318] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:30,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082171664] [2024-10-14 21:17:30,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:30,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:30,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:30,667 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-10-14 21:17:30,668 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-10-14 21:17:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:30,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 21:17:30,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 21:17:30,841 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:30,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082171664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:30,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:30,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-14 21:17:30,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057017786] [2024-10-14 21:17:30,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:30,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:17:30,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:30,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:17:30,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 21:17:30,843 INFO L87 Difference]: Start difference. First operand 284 states and 435 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 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-10-14 21:17:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:30,889 INFO L93 Difference]: Finished difference Result 486 states and 748 transitions. [2024-10-14 21:17:30,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:17:30,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 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 110 [2024-10-14 21:17:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:30,891 INFO L225 Difference]: With dead ends: 486 [2024-10-14 21:17:30,891 INFO L226 Difference]: Without dead ends: 291 [2024-10-14 21:17:30,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 21:17:30,892 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 20 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:30,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1372 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-14 21:17:30,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2024-10-14 21:17:30,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 223 states have (on average 1.5560538116591929) internal successors, (347), 230 states have internal predecessors, (347), 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-10-14 21:17:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 443 transitions. [2024-10-14 21:17:30,900 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 443 transitions. Word has length 110 [2024-10-14 21:17:30,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:30,900 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 443 transitions. [2024-10-14 21:17:30,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 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-10-14 21:17:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 443 transitions. [2024-10-14 21:17:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 21:17:30,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:30,902 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] [2024-10-14 21:17:30,915 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-10-14 21:17:31,102 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-10-14 21:17:31,102 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-10-14 21:17:31,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:31,103 INFO L85 PathProgramCache]: Analyzing trace with hash 67340857, now seen corresponding path program 1 times [2024-10-14 21:17:31,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:31,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622430031] [2024-10-14 21:17:31,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:31,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:17:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:17:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 21:17:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:17:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 21:17:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 21:17:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 21:17:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 21:17:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 21:17:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,210 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 21:17:31,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:31,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622430031] [2024-10-14 21:17:31,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622430031] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:31,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580152600] [2024-10-14 21:17:31,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:31,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:31,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:31,212 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-10-14 21:17:31,214 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-10-14 21:17:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:17:31,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:31,356 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-14 21:17:31,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:31,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580152600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:31,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:31,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-14 21:17:31,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482725090] [2024-10-14 21:17:31,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:31,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:31,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:31,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:31,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:31,358 INFO L87 Difference]: Start difference. First operand 287 states and 443 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, (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-10-14 21:17:31,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:31,393 INFO L93 Difference]: Finished difference Result 296 states and 458 transitions. [2024-10-14 21:17:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:31,394 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, (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 115 [2024-10-14 21:17:31,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:31,395 INFO L225 Difference]: With dead ends: 296 [2024-10-14 21:17:31,395 INFO L226 Difference]: Without dead ends: 295 [2024-10-14 21:17:31,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 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-10-14 21:17:31,396 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 8 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:31,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 830 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:31,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-14 21:17:31,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 288. [2024-10-14 21:17:31,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 224 states have (on average 1.5535714285714286) internal successors, (348), 231 states have internal predecessors, (348), 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-10-14 21:17:31,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 444 transitions. [2024-10-14 21:17:31,404 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 444 transitions. Word has length 115 [2024-10-14 21:17:31,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:31,405 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 444 transitions. [2024-10-14 21:17:31,405 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, (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-10-14 21:17:31,405 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 444 transitions. [2024-10-14 21:17:31,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 21:17:31,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:31,406 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-10-14 21:17:31,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-14 21:17:31,606 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-10-14 21:17:31,607 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-10-14 21:17:31,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:31,607 INFO L85 PathProgramCache]: Analyzing trace with hash 2087566902, now seen corresponding path program 1 times [2024-10-14 21:17:31,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:31,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321353246] [2024-10-14 21:17:31,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:31,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:17:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:17:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 21:17:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:17:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 21:17:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 21:17:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 21:17:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 21:17:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 21:17:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,731 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 21:17:31,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:31,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321353246] [2024-10-14 21:17:31,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321353246] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:31,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062765682] [2024-10-14 21:17:31,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:31,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:31,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:31,733 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-10-14 21:17:31,735 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-10-14 21:17:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:31,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:17:31,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-14 21:17:31,894 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:31,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062765682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:31,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:31,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-14 21:17:31,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702663594] [2024-10-14 21:17:31,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:31,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:17:31,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:31,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:17:31,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:17:31,896 INFO L87 Difference]: Start difference. First operand 288 states and 444 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-10-14 21:17:31,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:31,924 INFO L93 Difference]: Finished difference Result 291 states and 447 transitions. [2024-10-14 21:17:31,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:17:31,924 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-10-14 21:17:31,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:31,926 INFO L225 Difference]: With dead ends: 291 [2024-10-14 21:17:31,926 INFO L226 Difference]: Without dead ends: 290 [2024-10-14 21:17:31,926 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-10-14 21:17:31,926 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 7 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:31,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 830 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:31,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-14 21:17:31,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2024-10-14 21:17:31,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 225 states have (on average 1.551111111111111) internal successors, (349), 232 states have internal predecessors, (349), 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-10-14 21:17:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 445 transitions. [2024-10-14 21:17:31,934 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 445 transitions. Word has length 116 [2024-10-14 21:17:31,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:31,935 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 445 transitions. [2024-10-14 21:17:31,935 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-10-14 21:17:31,935 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 445 transitions. [2024-10-14 21:17:31,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 21:17:31,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:31,936 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-10-14 21:17:31,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-14 21:17:32,136 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-10-14 21:17:32,137 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-10-14 21:17:32,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:32,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1956543203, now seen corresponding path program 1 times [2024-10-14 21:17:32,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:32,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399631410] [2024-10-14 21:17:32,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:32,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:17:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:17:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 21:17:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:17:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 21:17:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 21:17:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 21:17:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 21:17:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 21:17:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 21:17:32,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:32,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399631410] [2024-10-14 21:17:32,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399631410] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:32,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160892660] [2024-10-14 21:17:32,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:32,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:32,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:32,247 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-10-14 21:17:32,248 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-10-14 21:17:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 21:17:32,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-14 21:17:32,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:32,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160892660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:32,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:32,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-10-14 21:17:32,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163508587] [2024-10-14 21:17:32,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:32,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:17:32,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:32,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:17:32,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:17:32,406 INFO L87 Difference]: Start difference. First operand 289 states and 445 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (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-10-14 21:17:32,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:32,459 INFO L93 Difference]: Finished difference Result 297 states and 459 transitions. [2024-10-14 21:17:32,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:17:32,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (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-10-14 21:17:32,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:32,461 INFO L225 Difference]: With dead ends: 297 [2024-10-14 21:17:32,461 INFO L226 Difference]: Without dead ends: 296 [2024-10-14 21:17:32,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:17:32,462 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 10 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:32,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1105 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-14 21:17:32,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 290. [2024-10-14 21:17:32,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 226 states have (on average 1.5486725663716814) internal successors, (350), 233 states have internal predecessors, (350), 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-10-14 21:17:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 446 transitions. [2024-10-14 21:17:32,472 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 446 transitions. Word has length 117 [2024-10-14 21:17:32,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:32,474 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 446 transitions. [2024-10-14 21:17:32,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (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-10-14 21:17:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 446 transitions. [2024-10-14 21:17:32,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 21:17:32,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:32,476 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-10-14 21:17:32,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-14 21:17:32,677 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-10-14 21:17:32,677 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-10-14 21:17:32,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:32,677 INFO L85 PathProgramCache]: Analyzing trace with hash -287723747, now seen corresponding path program 1 times [2024-10-14 21:17:32,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:32,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393419528] [2024-10-14 21:17:32,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:32,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:17:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:17:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 21:17:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:17:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 21:17:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 21:17:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 21:17:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 21:17:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 21:17:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 21:17:32,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:32,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393419528] [2024-10-14 21:17:32,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393419528] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:32,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152979818] [2024-10-14 21:17:32,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:32,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:32,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:32,828 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-10-14 21:17:32,829 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-10-14 21:17:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:32,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 21:17:32,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-14 21:17:32,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:32,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152979818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:32,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:32,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-14 21:17:32,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615730744] [2024-10-14 21:17:32,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:32,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:17:32,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:32,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:17:32,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 21:17:32,997 INFO L87 Difference]: Start difference. First operand 290 states and 446 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, (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-10-14 21:17:33,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:33,044 INFO L93 Difference]: Finished difference Result 304 states and 468 transitions. [2024-10-14 21:17:33,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:17:33,044 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, (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 117 [2024-10-14 21:17:33,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:33,046 INFO L225 Difference]: With dead ends: 304 [2024-10-14 21:17:33,046 INFO L226 Difference]: Without dead ends: 303 [2024-10-14 21:17:33,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 138 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-10-14 21:17:33,046 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 17 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:33,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1127 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:33,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-14 21:17:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 295. [2024-10-14 21:17:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 230 states have (on average 1.5434782608695652) internal successors, (355), 237 states have internal predecessors, (355), 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-10-14 21:17:33,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 453 transitions. [2024-10-14 21:17:33,054 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 453 transitions. Word has length 117 [2024-10-14 21:17:33,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:33,054 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 453 transitions. [2024-10-14 21:17:33,054 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, (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-10-14 21:17:33,054 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 453 transitions. [2024-10-14 21:17:33,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 21:17:33,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:33,055 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-10-14 21:17:33,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-14 21:17:33,256 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-10-14 21:17:33,256 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-10-14 21:17:33,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:33,257 INFO L85 PathProgramCache]: Analyzing trace with hash -523296814, now seen corresponding path program 1 times [2024-10-14 21:17:33,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:33,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430481377] [2024-10-14 21:17:33,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:33,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:17:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:17:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 21:17:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:17:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 21:17:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 21:17:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 21:17:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 21:17:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 21:17:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 21:17:33,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:33,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430481377] [2024-10-14 21:17:33,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430481377] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:33,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274798899] [2024-10-14 21:17:33,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:33,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:33,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:33,366 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-10-14 21:17:33,368 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-10-14 21:17:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 21:17:33,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-14 21:17:33,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:33,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274798899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:33,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:33,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-14 21:17:33,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141657485] [2024-10-14 21:17:33,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:33,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:17:33,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:33,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:17:33,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 21:17:33,536 INFO L87 Difference]: Start difference. First operand 295 states and 453 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (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-10-14 21:17:33,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:33,578 INFO L93 Difference]: Finished difference Result 300 states and 459 transitions. [2024-10-14 21:17:33,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:17:33,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (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 118 [2024-10-14 21:17:33,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:33,580 INFO L225 Difference]: With dead ends: 300 [2024-10-14 21:17:33,580 INFO L226 Difference]: Without dead ends: 299 [2024-10-14 21:17:33,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 21:17:33,580 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 19 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:33,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1142 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:33,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-14 21:17:33,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2024-10-14 21:17:33,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 230 states have (on average 1.5434782608695652) internal successors, (355), 237 states have internal predecessors, (355), 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-10-14 21:17:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 453 transitions. [2024-10-14 21:17:33,591 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 453 transitions. Word has length 118 [2024-10-14 21:17:33,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:33,591 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 453 transitions. [2024-10-14 21:17:33,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (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-10-14 21:17:33,591 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 453 transitions. [2024-10-14 21:17:33,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 21:17:33,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:33,592 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-10-14 21:17:33,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-14 21:17:33,793 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-10-14 21:17:33,794 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-10-14 21:17:33,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:33,794 INFO L85 PathProgramCache]: Analyzing trace with hash -329501230, now seen corresponding path program 1 times [2024-10-14 21:17:33,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:33,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515161843] [2024-10-14 21:17:33,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:33,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:17:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:17:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 21:17:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:17:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 21:17:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 21:17:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 21:17:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 21:17:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 21:17:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 21:17:33,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:33,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515161843] [2024-10-14 21:17:33,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515161843] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:33,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127162026] [2024-10-14 21:17:33,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:33,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:33,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:33,947 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-10-14 21:17:33,949 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-10-14 21:17:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:34,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 21:17:34,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-14 21:17:34,128 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:34,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127162026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:34,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:34,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-14 21:17:34,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969183080] [2024-10-14 21:17:34,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:34,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:17:34,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:34,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:17:34,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 21:17:34,129 INFO L87 Difference]: Start difference. First operand 295 states and 453 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (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-10-14 21:17:34,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:34,169 INFO L93 Difference]: Finished difference Result 510 states and 784 transitions. [2024-10-14 21:17:34,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:17:34,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (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 118 [2024-10-14 21:17:34,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:34,171 INFO L225 Difference]: With dead ends: 510 [2024-10-14 21:17:34,171 INFO L226 Difference]: Without dead ends: 304 [2024-10-14 21:17:34,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 139 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-10-14 21:17:34,172 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 24 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:34,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1093 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:34,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-14 21:17:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 291. [2024-10-14 21:17:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 227 states have (on average 1.5462555066079295) internal successors, (351), 234 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-10-14 21:17:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 447 transitions. [2024-10-14 21:17:34,181 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 447 transitions. Word has length 118 [2024-10-14 21:17:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:34,181 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 447 transitions. [2024-10-14 21:17:34,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (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-10-14 21:17:34,182 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 447 transitions. [2024-10-14 21:17:34,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-14 21:17:34,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:34,183 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-10-14 21:17:34,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-14 21:17:34,383 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-10-14 21:17:34,384 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:17:34,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:34,384 INFO L85 PathProgramCache]: Analyzing trace with hash 379879681, now seen corresponding path program 1 times [2024-10-14 21:17:34,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:34,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869020352] [2024-10-14 21:17:34,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:34,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:34,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:34,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:34,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:34,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:17:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:34,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:17:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:34,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 21:17:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:34,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:17:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:34,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:34,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 21:17:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:34,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 21:17:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:34,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 21:17:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:34,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 21:17:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:34,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 21:17:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 21:17:34,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:34,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869020352] [2024-10-14 21:17:34,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869020352] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:34,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363889820] [2024-10-14 21:17:34,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:34,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:34,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:34,482 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-10-14 21:17:34,484 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-10-14 21:17:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:34,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 21:17:34,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:34,660 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-14 21:17:34,661 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:34,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363889820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:34,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:34,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-10-14 21:17:34,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842693874] [2024-10-14 21:17:34,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:34,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:17:34,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:34,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:17:34,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:17:34,662 INFO L87 Difference]: Start difference. First operand 291 states and 447 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 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-10-14 21:17:34,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:34,715 INFO L93 Difference]: Finished difference Result 306 states and 473 transitions. [2024-10-14 21:17:34,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:17:34,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 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-10-14 21:17:34,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:34,717 INFO L225 Difference]: With dead ends: 306 [2024-10-14 21:17:34,717 INFO L226 Difference]: Without dead ends: 305 [2024-10-14 21:17:34,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:17:34,718 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 30 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:34,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1333 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:17:34,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-14 21:17:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 290. [2024-10-14 21:17:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 227 states have (on average 1.5418502202643172) internal successors, (350), 233 states have internal predecessors, (350), 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-10-14 21:17:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 446 transitions. [2024-10-14 21:17:34,726 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 446 transitions. Word has length 119 [2024-10-14 21:17:34,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:34,726 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 446 transitions. [2024-10-14 21:17:34,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 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-10-14 21:17:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 446 transitions. [2024-10-14 21:17:34,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 21:17:34,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:17:34,728 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:17:34,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-10-14 21:17:34,928 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-10-14 21:17:34,929 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:17:34,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:17:34,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1108631442, now seen corresponding path program 1 times [2024-10-14 21:17:34,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:17:34,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443687902] [2024-10-14 21:17:34,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:34,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:17:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:35,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:17:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:35,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 21:17:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:35,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 21:17:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:35,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 21:17:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:35,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 21:17:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:35,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 21:17:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:35,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 21:17:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:35,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 21:17:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:35,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 21:17:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:35,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 21:17:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:35,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 21:17:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:35,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 21:17:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:35,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 21:17:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 21:17:35,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:17:35,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443687902] [2024-10-14 21:17:35,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443687902] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:17:35,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604094018] [2024-10-14 21:17:35,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:17:35,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:17:35,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:17:35,083 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:17:35,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-14 21:17:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:17:35,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 21:17:35,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:17:35,272 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-14 21:17:35,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:17:35,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604094018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:17:35,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:17:35,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2024-10-14 21:17:35,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290694712] [2024-10-14 21:17:35,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:17:35,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 21:17:35,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:17:35,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 21:17:35,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-14 21:17:35,275 INFO L87 Difference]: Start difference. First operand 290 states and 446 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 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-10-14 21:17:35,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:17:35,343 INFO L93 Difference]: Finished difference Result 304 states and 471 transitions. [2024-10-14 21:17:35,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 21:17:35,344 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 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 120 [2024-10-14 21:17:35,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:17:35,345 INFO L225 Difference]: With dead ends: 304 [2024-10-14 21:17:35,345 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 21:17:35,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 139 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-10-14 21:17:35,346 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 27 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1873 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:17:35,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1873 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:17:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 21:17:35,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 21:17:35,346 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-10-14 21:17:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 21:17:35,347 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2024-10-14 21:17:35,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:17:35,347 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 21:17:35,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 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-10-14 21:17:35,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 21:17:35,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 21:17:35,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-14 21:17:35,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-14 21:17:35,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-14 21:17:35,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-14 21:17:35,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-14 21:17:35,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-14 21:17:35,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-14 21:17:35,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-14 21:17:35,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-10-14 21:17:35,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-14 21:17:35,557 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, 1] [2024-10-14 21:17:35,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 21:17:35,799 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 21:17:35,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:17:35 BoogieIcfgContainer [2024-10-14 21:17:35,816 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 21:17:35,816 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 21:17:35,816 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 21:17:35,816 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 21:17:35,817 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:17:23" (3/4) ... [2024-10-14 21:17:35,818 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 21:17:35,822 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_int8 [2024-10-14 21:17:35,822 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_bool [2024-10-14 21:17:35,822 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert [2024-10-14 21:17:35,822 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure add_history_type [2024-10-14 21:17:35,822 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 21:17:35,823 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure write_history_bool [2024-10-14 21:17:35,834 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2024-10-14 21:17:35,835 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-14 21:17:35,836 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 21:17:35,836 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 21:17:35,860 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2024-10-14 21:17:35,904 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2024-10-14 21:17:35,936 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 21:17:35,936 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 21:17:35,936 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 21:17:35,937 INFO L158 Benchmark]: Toolchain (without parser) took 13778.81ms. Allocated memory was 151.0MB in the beginning and 362.8MB in the end (delta: 211.8MB). Free memory was 77.7MB in the beginning and 194.8MB in the end (delta: -117.1MB). Peak memory consumption was 95.3MB. Max. memory is 16.1GB. [2024-10-14 21:17:35,937 INFO L158 Benchmark]: CDTParser took 1.30ms. Allocated memory is still 151.0MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 21:17:35,937 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.18ms. Allocated memory is still 151.0MB. Free memory was 77.5MB in the beginning and 59.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 21:17:35,937 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.66ms. Allocated memory is still 151.0MB. Free memory was 59.9MB in the beginning and 120.2MB in the end (delta: -60.3MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-10-14 21:17:35,938 INFO L158 Benchmark]: Boogie Preprocessor took 71.80ms. Allocated memory was 151.0MB in the beginning and 209.7MB in the end (delta: 58.7MB). Free memory was 120.2MB in the beginning and 177.7MB in the end (delta: -57.5MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-10-14 21:17:35,938 INFO L158 Benchmark]: RCFGBuilder took 643.75ms. Allocated memory is still 209.7MB. Free memory was 177.7MB in the beginning and 132.7MB in the end (delta: 45.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-14 21:17:35,938 INFO L158 Benchmark]: TraceAbstraction took 12505.80ms. Allocated memory was 209.7MB in the beginning and 362.8MB in the end (delta: 153.1MB). Free memory was 132.7MB in the beginning and 206.3MB in the end (delta: -73.6MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. [2024-10-14 21:17:35,938 INFO L158 Benchmark]: Witness Printer took 120.31ms. Allocated memory is still 362.8MB. Free memory was 206.3MB in the beginning and 194.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 21:17:35,939 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.30ms. Allocated memory is still 151.0MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.18ms. Allocated memory is still 151.0MB. Free memory was 77.5MB in the beginning and 59.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.66ms. Allocated memory is still 151.0MB. Free memory was 59.9MB in the beginning and 120.2MB in the end (delta: -60.3MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.80ms. Allocated memory was 151.0MB in the beginning and 209.7MB in the end (delta: 58.7MB). Free memory was 120.2MB in the beginning and 177.7MB in the end (delta: -57.5MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * RCFGBuilder took 643.75ms. Allocated memory is still 209.7MB. Free memory was 177.7MB in the beginning and 132.7MB in the end (delta: 45.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12505.80ms. Allocated memory was 209.7MB in the beginning and 362.8MB in the end (delta: 153.1MB). Free memory was 132.7MB in the beginning and 206.3MB in the end (delta: -73.6MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. * Witness Printer took 120.31ms. Allocated memory is still 362.8MB. Free memory was 206.3MB in the beginning and 194.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 187 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 23, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 443 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 406 mSDsluCounter, 22396 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15964 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1202 IncrementalHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 6432 mSDtfsCounter, 1202 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2639 GetRequests, 2470 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=19, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 132 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 4194 NumberOfCodeBlocks, 4194 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 4151 ConstructedInterpolants, 0 QuantifiedInterpolants, 6366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 10478 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 43 InterpolantComputations, 23 PerfectInterpolantSequences, 1927/1991 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: 507]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-14 21:17:35,962 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