./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.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.dk.perfect-tracechecks-8be7027-m [2024-11-12 17:54:35,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 17:54:35,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 17:54:35,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 17:54:35,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 17:54:35,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 17:54:35,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 17:54:35,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 17:54:35,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 17:54:35,173 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 17:54:35,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 17:54:35,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 17:54:35,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 17:54:35,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 17:54:35,175 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 17:54:35,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 17:54:35,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 17:54:35,176 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 17:54:35,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 17:54:35,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 17:54:35,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 17:54:35,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 17:54:35,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 17:54:35,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 17:54:35,179 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 17:54:35,179 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 17:54:35,180 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 17:54:35,183 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 17:54:35,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 17:54:35,183 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 17:54:35,183 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 17:54:35,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 17:54:35,184 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 17:54:35,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 17:54:35,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:54:35,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 17:54:35,185 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 17:54:35,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 17:54:35,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 17:54:35,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 17:54:35,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 17:54:35,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 17:54:35,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 17:54:35,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 17:54:35,189 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-11-12 17:54:35,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 17:54:35,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 17:54:35,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 17:54:35,469 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 17:54:35,469 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 17:54:35,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2024-11-12 17:54:36,920 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 17:54:37,162 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 17:54:37,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2024-11-12 17:54:37,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df7334ed0/e2bce875ab5f472d8a2a696cb2171cfc/FLAGedd5a554f [2024-11-12 17:54:37,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df7334ed0/e2bce875ab5f472d8a2a696cb2171cfc [2024-11-12 17:54:37,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 17:54:37,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 17:54:37,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 17:54:37,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 17:54:37,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 17:54:37,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:54:37" (1/1) ... [2024-11-12 17:54:37,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@af26280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:37, skipping insertion in model container [2024-11-12 17:54:37,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:54:37" (1/1) ... [2024-11-12 17:54:37,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 17:54:37,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:54:37,548 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 17:54:37,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:54:37,646 INFO L204 MainTranslator]: Completed translation [2024-11-12 17:54:37,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:37 WrapperNode [2024-11-12 17:54:37,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 17:54:37,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 17:54:37,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 17:54:37,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 17:54:37,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:37" (1/1) ... [2024-11-12 17:54:37,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:37" (1/1) ... [2024-11-12 17:54:37,705 INFO L138 Inliner]: procedures = 28, calls = 52, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 428 [2024-11-12 17:54:37,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 17:54:37,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 17:54:37,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 17:54:37,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 17:54:37,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:37" (1/1) ... [2024-11-12 17:54:37,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:37" (1/1) ... [2024-11-12 17:54:37,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:37" (1/1) ... [2024-11-12 17:54:37,751 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 17:54:37,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:37" (1/1) ... [2024-11-12 17:54:37,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:37" (1/1) ... [2024-11-12 17:54:37,762 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:37" (1/1) ... [2024-11-12 17:54:37,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:37" (1/1) ... [2024-11-12 17:54:37,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:37" (1/1) ... [2024-11-12 17:54:37,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:37" (1/1) ... [2024-11-12 17:54:37,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 17:54:37,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 17:54:37,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 17:54:37,777 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 17:54:37,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:37" (1/1) ... [2024-11-12 17:54:37,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:54:37,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:37,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 17:54:37,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 17:54:37,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 17:54:37,878 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-11-12 17:54:37,878 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-11-12 17:54:37,878 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-12 17:54:37,878 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-12 17:54:37,879 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-11-12 17:54:37,879 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-11-12 17:54:37,879 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-11-12 17:54:37,879 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-11-12 17:54:37,880 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-11-12 17:54:37,880 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-11-12 17:54:37,881 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 17:54:37,881 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 17:54:37,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 17:54:37,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 17:54:37,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 17:54:37,988 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 17:54:37,990 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 17:54:38,570 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-11-12 17:54:38,570 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 17:54:38,596 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 17:54:38,597 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 17:54:38,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:54:38 BoogieIcfgContainer [2024-11-12 17:54:38,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 17:54:38,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 17:54:38,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 17:54:38,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 17:54:38,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:54:37" (1/3) ... [2024-11-12 17:54:38,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7717d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:54:38, skipping insertion in model container [2024-11-12 17:54:38,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:37" (2/3) ... [2024-11-12 17:54:38,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7717d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:54:38, skipping insertion in model container [2024-11-12 17:54:38,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:54:38" (3/3) ... [2024-11-12 17:54:38,607 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2024-11-12 17:54:38,623 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 17:54:38,624 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-12 17:54:38,691 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 17:54:38,696 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;@65dee40b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 17:54:38,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-12 17:54:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 193 states, 141 states have (on average 1.5957446808510638) internal successors, (225), 153 states have internal predecessors, (225), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-12 17:54:38,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 17:54:38,706 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:38,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:38,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:38,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:38,712 INFO L85 PathProgramCache]: Analyzing trace with hash -324035863, now seen corresponding path program 1 times [2024-11-12 17:54:38,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:38,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32409501] [2024-11-12 17:54:38,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:38,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:39,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:54:39,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:39,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32409501] [2024-11-12 17:54:39,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32409501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:39,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:54:39,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:54:39,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893214294] [2024-11-12 17:54:39,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:39,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:54:39,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:39,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:54:39,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:54:39,086 INFO L87 Difference]: Start difference. First operand has 193 states, 141 states have (on average 1.5957446808510638) internal successors, (225), 153 states have internal predecessors, (225), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:54:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:39,215 INFO L93 Difference]: Finished difference Result 402 states and 661 transitions. [2024-11-12 17:54:39,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:54:39,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-12 17:54:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:39,237 INFO L225 Difference]: With dead ends: 402 [2024-11-12 17:54:39,237 INFO L226 Difference]: Without dead ends: 211 [2024-11-12 17:54:39,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:54:39,246 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 37 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:39,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 862 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-12 17:54:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 204. [2024-11-12 17:54:39,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 151 states have (on average 1.5695364238410596) internal successors, (237), 162 states have internal predecessors, (237), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-12 17:54:39,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 313 transitions. [2024-11-12 17:54:39,313 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 313 transitions. Word has length 11 [2024-11-12 17:54:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:39,314 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 313 transitions. [2024-11-12 17:54:39,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:54:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 313 transitions. [2024-11-12 17:54:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 17:54:39,316 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:39,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:39,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 17:54:39,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:39,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:39,318 INFO L85 PathProgramCache]: Analyzing trace with hash 972050568, now seen corresponding path program 1 times [2024-11-12 17:54:39,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:39,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41791733] [2024-11-12 17:54:39,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:39,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:39,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 17:54:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:39,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:54:39,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:39,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41791733] [2024-11-12 17:54:39,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41791733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:39,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:54:39,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:54:39,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182485398] [2024-11-12 17:54:39,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:39,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:54:39,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:39,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:54:39,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:54:39,533 INFO L87 Difference]: Start difference. First operand 204 states and 313 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 17:54:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:39,592 INFO L93 Difference]: Finished difference Result 431 states and 671 transitions. [2024-11-12 17:54:39,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:54:39,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-12 17:54:39,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:39,596 INFO L225 Difference]: With dead ends: 431 [2024-11-12 17:54:39,596 INFO L226 Difference]: Without dead ends: 239 [2024-11-12 17:54:39,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:54:39,598 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 19 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:39,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 862 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:39,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-12 17:54:39,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 235. [2024-11-12 17:54:39,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 177 states have (on average 1.536723163841808) internal successors, (272), 188 states have internal predecessors, (272), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-12 17:54:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 358 transitions. [2024-11-12 17:54:39,625 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 358 transitions. Word has length 16 [2024-11-12 17:54:39,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:39,626 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 358 transitions. [2024-11-12 17:54:39,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 17:54:39,626 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 358 transitions. [2024-11-12 17:54:39,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 17:54:39,627 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:39,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:39,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 17:54:39,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:39,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:39,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1383802397, now seen corresponding path program 1 times [2024-11-12 17:54:39,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:39,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947427066] [2024-11-12 17:54:39,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:39,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:39,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 17:54:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:39,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 17:54:39,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:39,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947427066] [2024-11-12 17:54:39,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947427066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:39,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415064357] [2024-11-12 17:54:39,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:39,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:39,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:39,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:39,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 17:54:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:39,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 17:54:39,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 17:54:40,034 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:40,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415064357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:40,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:40,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-12 17:54:40,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399741100] [2024-11-12 17:54:40,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:40,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:54:40,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:40,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:54:40,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:40,040 INFO L87 Difference]: Start difference. First operand 235 states and 358 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:54:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:40,086 INFO L93 Difference]: Finished difference Result 239 states and 364 transitions. [2024-11-12 17:54:40,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:54:40,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-12 17:54:40,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:40,093 INFO L225 Difference]: With dead ends: 239 [2024-11-12 17:54:40,093 INFO L226 Difference]: Without dead ends: 238 [2024-11-12 17:54:40,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:40,099 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 19 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:40,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 824 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:40,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-12 17:54:40,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-11-12 17:54:40,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 177 states have (on average 1.5197740112994351) internal successors, (269), 187 states have internal predecessors, (269), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-12 17:54:40,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 355 transitions. [2024-11-12 17:54:40,135 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 355 transitions. Word has length 29 [2024-11-12 17:54:40,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:40,136 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 355 transitions. [2024-11-12 17:54:40,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:54:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 355 transitions. [2024-11-12 17:54:40,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 17:54:40,138 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:40,138 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:40,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 17:54:40,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:40,339 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:40,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:40,340 INFO L85 PathProgramCache]: Analyzing trace with hash 51799170, now seen corresponding path program 1 times [2024-11-12 17:54:40,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:40,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973737253] [2024-11-12 17:54:40,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:40,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:40,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 17:54:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:40,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 17:54:40,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:40,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973737253] [2024-11-12 17:54:40,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973737253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:40,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:54:40,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:54:40,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593676453] [2024-11-12 17:54:40,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:40,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:54:40,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:40,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:54:40,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:54:40,463 INFO L87 Difference]: Start difference. First operand 234 states and 355 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:54:40,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:40,502 INFO L93 Difference]: Finished difference Result 238 states and 361 transitions. [2024-11-12 17:54:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:54:40,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-11-12 17:54:40,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:40,507 INFO L225 Difference]: With dead ends: 238 [2024-11-12 17:54:40,507 INFO L226 Difference]: Without dead ends: 237 [2024-11-12 17:54:40,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:54:40,511 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 18 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:40,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 826 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:40,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-12 17:54:40,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 204. [2024-11-12 17:54:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 153 states have (on average 1.522875816993464) internal successors, (233), 162 states have internal predecessors, (233), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-12 17:54:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 309 transitions. [2024-11-12 17:54:40,541 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 309 transitions. Word has length 30 [2024-11-12 17:54:40,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:40,543 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 309 transitions. [2024-11-12 17:54:40,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:54:40,543 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 309 transitions. [2024-11-12 17:54:40,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 17:54:40,551 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:40,552 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:40,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 17:54:40,553 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:40,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:40,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1290767981, now seen corresponding path program 1 times [2024-11-12 17:54:40,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:40,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917539743] [2024-11-12 17:54:40,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:40,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:40,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:54:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:40,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:40,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:40,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 17:54:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:40,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:54:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:40,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 17:54:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:40,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 17:54:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:40,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 17:54:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:40,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 17:54:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:40,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 17:54:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:40,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 17:54:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-12 17:54:40,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:40,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917539743] [2024-11-12 17:54:40,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917539743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:40,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066122086] [2024-11-12 17:54:40,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:40,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:40,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:40,840 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:40,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 17:54:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:41,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:54:41,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:41,053 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-12 17:54:41,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:41,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066122086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:41,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:41,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-12 17:54:41,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378325368] [2024-11-12 17:54:41,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:41,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:54:41,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:41,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:54:41,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:41,058 INFO L87 Difference]: Start difference. First operand 204 states and 309 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 17:54:41,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:41,118 INFO L93 Difference]: Finished difference Result 355 states and 546 transitions. [2024-11-12 17:54:41,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:54:41,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 92 [2024-11-12 17:54:41,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:41,122 INFO L225 Difference]: With dead ends: 355 [2024-11-12 17:54:41,124 INFO L226 Difference]: Without dead ends: 211 [2024-11-12 17:54:41,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:54:41,125 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 10 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:41,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 832 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-12 17:54:41,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-12 17:54:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 158 states have (on average 1.5253164556962024) internal successors, (241), 168 states have internal predecessors, (241), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 17:54:41,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 319 transitions. [2024-11-12 17:54:41,140 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 319 transitions. Word has length 92 [2024-11-12 17:54:41,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:41,141 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 319 transitions. [2024-11-12 17:54:41,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 17:54:41,142 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 319 transitions. [2024-11-12 17:54:41,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 17:54:41,147 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:41,148 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:41,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 17:54:41,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:41,349 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:41,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:41,350 INFO L85 PathProgramCache]: Analyzing trace with hash -587374587, now seen corresponding path program 1 times [2024-11-12 17:54:41,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:41,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762251846] [2024-11-12 17:54:41,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:41,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:41,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:54:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:41,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:41,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:41,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 17:54:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:41,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:54:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:41,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 17:54:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:41,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 17:54:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:41,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 17:54:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:41,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 17:54:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:41,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 17:54:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:41,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 17:54:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-12 17:54:41,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:41,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762251846] [2024-11-12 17:54:41,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762251846] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:41,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196723518] [2024-11-12 17:54:41,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:41,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:41,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:41,641 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:41,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 17:54:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:41,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:54:41,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-12 17:54:41,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:41,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196723518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:41,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:41,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-12 17:54:41,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733843284] [2024-11-12 17:54:41,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:41,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:54:41,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:41,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:54:41,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:41,831 INFO L87 Difference]: Start difference. First operand 211 states and 319 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 17:54:41,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:41,884 INFO L93 Difference]: Finished difference Result 369 states and 565 transitions. [2024-11-12 17:54:41,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:54:41,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-12 17:54:41,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:41,887 INFO L225 Difference]: With dead ends: 369 [2024-11-12 17:54:41,888 INFO L226 Difference]: Without dead ends: 218 [2024-11-12 17:54:41,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:54:41,889 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 8 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:41,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 827 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:41,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-12 17:54:41,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-12 17:54:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 163 states have (on average 1.5276073619631902) internal successors, (249), 174 states have internal predecessors, (249), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 17:54:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 329 transitions. [2024-11-12 17:54:41,901 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 329 transitions. Word has length 94 [2024-11-12 17:54:41,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:41,902 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 329 transitions. [2024-11-12 17:54:41,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 17:54:41,902 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 329 transitions. [2024-11-12 17:54:41,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-12 17:54:41,904 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:41,904 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:41,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 17:54:42,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:42,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:42,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:42,111 INFO L85 PathProgramCache]: Analyzing trace with hash -315083275, now seen corresponding path program 1 times [2024-11-12 17:54:42,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:42,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140990433] [2024-11-12 17:54:42,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:42,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:42,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:54:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:42,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:42,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:42,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 17:54:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:42,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:54:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:42,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 17:54:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:42,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-12 17:54:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:42,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 17:54:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:42,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 17:54:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:42,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 17:54:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:42,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 17:54:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-12 17:54:42,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:42,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140990433] [2024-11-12 17:54:42,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140990433] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223615928] [2024-11-12 17:54:42,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:42,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:42,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:42,341 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:42,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 17:54:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:42,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:54:42,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-12 17:54:42,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:42,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223615928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:42,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:42,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-12 17:54:42,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026454782] [2024-11-12 17:54:42,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:42,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:54:42,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:42,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:54:42,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:42,534 INFO L87 Difference]: Start difference. First operand 218 states and 329 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 17:54:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:42,667 INFO L93 Difference]: Finished difference Result 394 states and 615 transitions. [2024-11-12 17:54:42,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:54:42,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 95 [2024-11-12 17:54:42,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:42,670 INFO L225 Difference]: With dead ends: 394 [2024-11-12 17:54:42,671 INFO L226 Difference]: Without dead ends: 236 [2024-11-12 17:54:42,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:54:42,672 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 39 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:42,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 788 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:54:42,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-12 17:54:42,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 232. [2024-11-12 17:54:42,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 175 states have (on average 1.542857142857143) internal successors, (270), 186 states have internal predecessors, (270), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-12 17:54:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 352 transitions. [2024-11-12 17:54:42,690 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 352 transitions. Word has length 95 [2024-11-12 17:54:42,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:42,690 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 352 transitions. [2024-11-12 17:54:42,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 17:54:42,691 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 352 transitions. [2024-11-12 17:54:42,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 17:54:42,692 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:42,693 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:42,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 17:54:42,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:42,894 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:42,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:42,895 INFO L85 PathProgramCache]: Analyzing trace with hash 316307424, now seen corresponding path program 1 times [2024-11-12 17:54:42,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:42,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437590516] [2024-11-12 17:54:42,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:42,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:42,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:54:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:42,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:42,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 17:54:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:54:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 17:54:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-12 17:54:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 17:54:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 17:54:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 17:54:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 17:54:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-12 17:54:43,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:43,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437590516] [2024-11-12 17:54:43,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437590516] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:43,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502543593] [2024-11-12 17:54:43,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:43,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:43,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:43,068 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:43,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 17:54:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:54:43,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 17:54:43,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:43,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502543593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:43,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:43,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-12 17:54:43,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638224789] [2024-11-12 17:54:43,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:43,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:54:43,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:43,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:54:43,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:43,263 INFO L87 Difference]: Start difference. First operand 232 states and 352 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 17:54:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:43,330 INFO L93 Difference]: Finished difference Result 469 states and 727 transitions. [2024-11-12 17:54:43,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:54:43,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-11-12 17:54:43,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:43,334 INFO L225 Difference]: With dead ends: 469 [2024-11-12 17:54:43,335 INFO L226 Difference]: Without dead ends: 256 [2024-11-12 17:54:43,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:54:43,336 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 21 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:43,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 808 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:43,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-12 17:54:43,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2024-11-12 17:54:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 195 states have (on average 1.558974358974359) internal successors, (304), 206 states have internal predecessors, (304), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-12 17:54:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 390 transitions. [2024-11-12 17:54:43,350 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 390 transitions. Word has length 98 [2024-11-12 17:54:43,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:43,351 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 390 transitions. [2024-11-12 17:54:43,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 17:54:43,351 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 390 transitions. [2024-11-12 17:54:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 17:54:43,353 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:43,353 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:43,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 17:54:43,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:43,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:43,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:43,559 INFO L85 PathProgramCache]: Analyzing trace with hash 587919294, now seen corresponding path program 1 times [2024-11-12 17:54:43,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:43,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276185049] [2024-11-12 17:54:43,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:43,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:54:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 17:54:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:54:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 17:54:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-12 17:54:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 17:54:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 17:54:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 17:54:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 17:54:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,752 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-12 17:54:43,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:43,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276185049] [2024-11-12 17:54:43,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276185049] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:43,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171915196] [2024-11-12 17:54:43,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:43,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:43,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:43,754 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:43,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 17:54:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:43,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:54:43,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-12 17:54:43,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:43,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171915196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:43,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:43,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-12 17:54:43,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255719169] [2024-11-12 17:54:43,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:43,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:54:43,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:43,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:54:43,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:43,940 INFO L87 Difference]: Start difference. First operand 256 states and 390 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 17:54:44,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:44,008 INFO L93 Difference]: Finished difference Result 513 states and 792 transitions. [2024-11-12 17:54:44,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:54:44,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2024-11-12 17:54:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:44,011 INFO L225 Difference]: With dead ends: 513 [2024-11-12 17:54:44,011 INFO L226 Difference]: Without dead ends: 276 [2024-11-12 17:54:44,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:54:44,013 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 19 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:44,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 795 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:44,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-12 17:54:44,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-11-12 17:54:44,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 211 states have (on average 1.5639810426540284) internal successors, (330), 222 states have internal predecessors, (330), 45 states have call successors, (45), 14 states have call predecessors, (45), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-12 17:54:44,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 420 transitions. [2024-11-12 17:54:44,024 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 420 transitions. Word has length 100 [2024-11-12 17:54:44,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:44,025 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 420 transitions. [2024-11-12 17:54:44,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 17:54:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 420 transitions. [2024-11-12 17:54:44,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 17:54:44,026 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:44,027 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:44,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-12 17:54:44,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:44,228 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:44,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:44,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1416958404, now seen corresponding path program 1 times [2024-11-12 17:54:44,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:44,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379938013] [2024-11-12 17:54:44,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:44,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:44,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:54:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:44,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:44,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:44,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 17:54:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:44,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:54:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:44,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 17:54:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:44,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-12 17:54:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:44,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 17:54:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:44,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 17:54:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:44,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 17:54:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:44,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 17:54:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 17:54:44,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:44,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379938013] [2024-11-12 17:54:44,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379938013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:44,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756973005] [2024-11-12 17:54:44,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:44,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:44,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:44,389 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:44,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 17:54:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:44,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:54:44,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-12 17:54:44,573 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:44,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756973005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:44,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:44,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-12 17:54:44,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970730248] [2024-11-12 17:54:44,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:44,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:54:44,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:44,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:54:44,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:44,578 INFO L87 Difference]: Start difference. First operand 276 states and 420 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 17:54:44,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:44,609 INFO L93 Difference]: Finished difference Result 284 states and 435 transitions. [2024-11-12 17:54:44,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:54:44,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-11-12 17:54:44,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:44,612 INFO L225 Difference]: With dead ends: 284 [2024-11-12 17:54:44,612 INFO L226 Difference]: Without dead ends: 283 [2024-11-12 17:54:44,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:44,613 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 12 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:44,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 815 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:44,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-12 17:54:44,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 275. [2024-11-12 17:54:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 211 states have (on average 1.5592417061611374) internal successors, (329), 221 states have internal predecessors, (329), 45 states have call successors, (45), 14 states have call predecessors, (45), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-12 17:54:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 419 transitions. [2024-11-12 17:54:44,630 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 419 transitions. Word has length 101 [2024-11-12 17:54:44,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:44,630 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 419 transitions. [2024-11-12 17:54:44,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 17:54:44,631 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 419 transitions. [2024-11-12 17:54:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 17:54:44,632 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:44,633 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:44,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-12 17:54:44,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:44,834 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:44,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:44,834 INFO L85 PathProgramCache]: Analyzing trace with hash 976037875, now seen corresponding path program 1 times [2024-11-12 17:54:44,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:44,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429649683] [2024-11-12 17:54:44,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:44,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:54:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 17:54:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:54:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 17:54:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-12 17:54:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 17:54:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 17:54:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 17:54:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 17:54:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,087 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 17:54:45,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:45,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429649683] [2024-11-12 17:54:45,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429649683] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:45,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692663856] [2024-11-12 17:54:45,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:45,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:45,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:45,090 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:45,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 17:54:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:54:45,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:45,281 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-12 17:54:45,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:45,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692663856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:45,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:45,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-12 17:54:45,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553692921] [2024-11-12 17:54:45,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:45,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:54:45,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:45,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:54:45,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:45,284 INFO L87 Difference]: Start difference. First operand 275 states and 419 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 17:54:45,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:45,326 INFO L93 Difference]: Finished difference Result 470 states and 720 transitions. [2024-11-12 17:54:45,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:54:45,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2024-11-12 17:54:45,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:45,329 INFO L225 Difference]: With dead ends: 470 [2024-11-12 17:54:45,330 INFO L226 Difference]: Without dead ends: 285 [2024-11-12 17:54:45,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:45,331 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 11 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:45,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 846 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:45,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-12 17:54:45,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-12 17:54:45,342 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-11-12 17:54:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 436 transitions. [2024-11-12 17:54:45,345 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 436 transitions. Word has length 102 [2024-11-12 17:54:45,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:45,346 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 436 transitions. [2024-11-12 17:54:45,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 17:54:45,346 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 436 transitions. [2024-11-12 17:54:45,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 17:54:45,348 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:45,348 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:45,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-12 17:54:45,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-12 17:54:45,549 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:45,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:45,550 INFO L85 PathProgramCache]: Analyzing trace with hash -686130286, now seen corresponding path program 1 times [2024-11-12 17:54:45,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:45,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645965400] [2024-11-12 17:54:45,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:45,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:54:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 17:54:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:54:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 17:54:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-12 17:54:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 17:54:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 17:54:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 17:54:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 17:54:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 17:54:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-12 17:54:45,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:45,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645965400] [2024-11-12 17:54:45,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645965400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:45,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671801999] [2024-11-12 17:54:45,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:45,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:45,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:45,732 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:45,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-12 17:54:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:45,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:54:45,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-12 17:54:45,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:45,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671801999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:45,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:45,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-12 17:54:45,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056994287] [2024-11-12 17:54:45,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:45,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:54:45,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:45,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:54:45,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:45,931 INFO L87 Difference]: Start difference. First operand 285 states and 436 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 17:54:45,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:45,990 INFO L93 Difference]: Finished difference Result 296 states and 455 transitions. [2024-11-12 17:54:45,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:54:45,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-12 17:54:45,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:45,993 INFO L225 Difference]: With dead ends: 296 [2024-11-12 17:54:45,993 INFO L226 Difference]: Without dead ends: 295 [2024-11-12 17:54:45,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:45,994 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 10 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:45,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 842 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:45,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-12 17:54:46,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 286. [2024-11-12 17:54:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 221 states have (on average 1.5520361990950227) internal successors, (343), 230 states have internal predecessors, (343), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-12 17:54:46,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 437 transitions. [2024-11-12 17:54:46,010 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 437 transitions. Word has length 109 [2024-11-12 17:54:46,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:46,010 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 437 transitions. [2024-11-12 17:54:46,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 17:54:46,010 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 437 transitions. [2024-11-12 17:54:46,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-12 17:54:46,012 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:46,013 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:46,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-12 17:54:46,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:46,213 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:46,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:46,214 INFO L85 PathProgramCache]: Analyzing trace with hash 204797937, now seen corresponding path program 1 times [2024-11-12 17:54:46,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:46,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008402937] [2024-11-12 17:54:46,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:46,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:54:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 17:54:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:54:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 17:54:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-12 17:54:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 17:54:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 17:54:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 17:54:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 17:54:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 17:54:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,375 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-12 17:54:46,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:46,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008402937] [2024-11-12 17:54:46,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008402937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:46,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340015431] [2024-11-12 17:54:46,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:46,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:46,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:46,377 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:46,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-12 17:54:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:54:46,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-12 17:54:46,573 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:46,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340015431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:46,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:46,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-12 17:54:46,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014723106] [2024-11-12 17:54:46,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:46,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:54:46,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:46,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:54:46,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:46,575 INFO L87 Difference]: Start difference. First operand 286 states and 437 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 17:54:46,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:46,609 INFO L93 Difference]: Finished difference Result 288 states and 439 transitions. [2024-11-12 17:54:46,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:54:46,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-11-12 17:54:46,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:46,612 INFO L225 Difference]: With dead ends: 288 [2024-11-12 17:54:46,612 INFO L226 Difference]: Without dead ends: 287 [2024-11-12 17:54:46,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:46,613 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 9 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:46,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 857 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-12 17:54:46,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-11-12 17:54:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 222 states have (on average 1.5495495495495495) internal successors, (344), 231 states have internal predecessors, (344), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-12 17:54:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 438 transitions. [2024-11-12 17:54:46,626 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 438 transitions. Word has length 110 [2024-11-12 17:54:46,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:46,626 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 438 transitions. [2024-11-12 17:54:46,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 17:54:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 438 transitions. [2024-11-12 17:54:46,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 17:54:46,628 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:46,629 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:46,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-12 17:54:46,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-12 17:54:46,829 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:46,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:46,831 INFO L85 PathProgramCache]: Analyzing trace with hash -282600266, now seen corresponding path program 1 times [2024-11-12 17:54:46,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:46,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374804393] [2024-11-12 17:54:46,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:46,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:54:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 17:54:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:54:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 17:54:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-12 17:54:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 17:54:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 17:54:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 17:54:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 17:54:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 17:54:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-12 17:54:46,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:46,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374804393] [2024-11-12 17:54:46,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374804393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:46,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700573461] [2024-11-12 17:54:46,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:46,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:46,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:46,998 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:47,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-12 17:54:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:47,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 17:54:47,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:47,220 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-12 17:54:47,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:47,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700573461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:47,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:47,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-12 17:54:47,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668757244] [2024-11-12 17:54:47,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:47,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:54:47,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:47,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:54:47,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:54:47,221 INFO L87 Difference]: Start difference. First operand 287 states and 438 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 17:54:47,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:47,265 INFO L93 Difference]: Finished difference Result 292 states and 448 transitions. [2024-11-12 17:54:47,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:54:47,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 111 [2024-11-12 17:54:47,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:47,267 INFO L225 Difference]: With dead ends: 292 [2024-11-12 17:54:47,267 INFO L226 Difference]: Without dead ends: 291 [2024-11-12 17:54:47,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:54:47,268 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 12 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:47,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1071 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:47,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-12 17:54:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 286. [2024-11-12 17:54:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 222 states have (on average 1.545045045045045) internal successors, (343), 230 states have internal predecessors, (343), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-12 17:54:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 437 transitions. [2024-11-12 17:54:47,282 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 437 transitions. Word has length 111 [2024-11-12 17:54:47,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:47,283 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 437 transitions. [2024-11-12 17:54:47,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 17:54:47,283 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 437 transitions. [2024-11-12 17:54:47,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-12 17:54:47,285 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:47,285 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:47,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-12 17:54:47,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-12 17:54:47,486 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:47,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:47,487 INFO L85 PathProgramCache]: Analyzing trace with hash -170673331, now seen corresponding path program 1 times [2024-11-12 17:54:47,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:47,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852377841] [2024-11-12 17:54:47,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:47,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:47,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:54:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:47,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:47,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:47,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 17:54:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:47,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:54:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:47,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 17:54:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:47,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-12 17:54:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:47,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 17:54:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:47,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 17:54:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:47,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 17:54:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:47,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 17:54:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:47,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 17:54:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-12 17:54:47,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:47,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852377841] [2024-11-12 17:54:47,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852377841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:47,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138048075] [2024-11-12 17:54:47,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:47,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:47,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:47,659 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:47,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-12 17:54:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:47,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:54:47,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-12 17:54:47,872 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:47,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138048075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:47,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:47,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-12 17:54:47,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986241746] [2024-11-12 17:54:47,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:47,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:54:47,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:47,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:54:47,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-12 17:54:47,873 INFO L87 Difference]: Start difference. First operand 286 states and 437 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 17:54:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:47,922 INFO L93 Difference]: Finished difference Result 489 states and 751 transitions. [2024-11-12 17:54:47,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:54:47,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2024-11-12 17:54:47,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:47,925 INFO L225 Difference]: With dead ends: 489 [2024-11-12 17:54:47,926 INFO L226 Difference]: Without dead ends: 293 [2024-11-12 17:54:47,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-12 17:54:47,927 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 20 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1340 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-11-12 17:54:47,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1340 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-12 17:54:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 289. [2024-11-12 17:54:47,936 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-11-12 17:54:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 445 transitions. [2024-11-12 17:54:47,938 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 445 transitions. Word has length 112 [2024-11-12 17:54:47,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:47,939 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 445 transitions. [2024-11-12 17:54:47,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 17:54:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 445 transitions. [2024-11-12 17:54:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-12 17:54:47,941 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:47,941 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:47,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-12 17:54:48,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-12 17:54:48,142 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:48,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:48,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2058156192, now seen corresponding path program 1 times [2024-11-12 17:54:48,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:48,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668880307] [2024-11-12 17:54:48,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:48,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:54:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 17:54:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:54:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 17:54:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-12 17:54:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 17:54:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 17:54:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 17:54:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 17:54:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 17:54:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 17:54:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-12 17:54:48,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:48,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668880307] [2024-11-12 17:54:48,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668880307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:48,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155269885] [2024-11-12 17:54:48,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:48,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:48,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:48,331 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:48,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-12 17:54:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:54:48,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-12 17:54:48,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:48,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155269885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:48,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:48,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-12 17:54:48,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008813500] [2024-11-12 17:54:48,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:48,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:54:48,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:48,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:54:48,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:48,530 INFO L87 Difference]: Start difference. First operand 289 states and 445 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 17:54:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:48,570 INFO L93 Difference]: Finished difference Result 298 states and 460 transitions. [2024-11-12 17:54:48,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:54:48,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2024-11-12 17:54:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:48,573 INFO L225 Difference]: With dead ends: 298 [2024-11-12 17:54:48,573 INFO L226 Difference]: Without dead ends: 297 [2024-11-12 17:54:48,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:48,574 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 8 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:48,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 851 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:48,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-12 17:54:48,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 290. [2024-11-12 17:54:48,585 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-11-12 17:54:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 446 transitions. [2024-11-12 17:54:48,587 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 446 transitions. Word has length 117 [2024-11-12 17:54:48,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:48,589 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 446 transitions. [2024-11-12 17:54:48,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 17:54:48,589 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 446 transitions. [2024-11-12 17:54:48,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 17:54:48,591 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:48,591 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:48,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-12 17:54:48,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-12 17:54:48,792 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:48,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:48,793 INFO L85 PathProgramCache]: Analyzing trace with hash -621667153, now seen corresponding path program 1 times [2024-11-12 17:54:48,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:48,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589902396] [2024-11-12 17:54:48,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:48,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:54:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 17:54:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:54:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 17:54:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-12 17:54:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 17:54:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 17:54:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 17:54:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 17:54:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 17:54:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 17:54:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-12 17:54:48,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:48,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589902396] [2024-11-12 17:54:48,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589902396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:48,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901039025] [2024-11-12 17:54:48,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:48,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:48,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:48,946 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:48,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-12 17:54:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:49,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:54:49,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-12 17:54:49,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:49,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901039025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:49,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:49,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-12 17:54:49,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20406192] [2024-11-12 17:54:49,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:49,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:54:49,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:49,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:54:49,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:49,148 INFO L87 Difference]: Start difference. First operand 290 states and 446 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 17:54:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:49,180 INFO L93 Difference]: Finished difference Result 293 states and 449 transitions. [2024-11-12 17:54:49,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:54:49,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-11-12 17:54:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:49,183 INFO L225 Difference]: With dead ends: 293 [2024-11-12 17:54:49,183 INFO L226 Difference]: Without dead ends: 292 [2024-11-12 17:54:49,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:49,184 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 7 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:49,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 851 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:49,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-12 17:54:49,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2024-11-12 17:54:49,192 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-11-12 17:54:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 447 transitions. [2024-11-12 17:54:49,194 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 447 transitions. Word has length 118 [2024-11-12 17:54:49,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:49,194 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 447 transitions. [2024-11-12 17:54:49,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 17:54:49,197 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 447 transitions. [2024-11-12 17:54:49,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 17:54:49,199 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:49,199 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:49,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-12 17:54:49,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:49,400 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:49,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:49,401 INFO L85 PathProgramCache]: Analyzing trace with hash -43452988, now seen corresponding path program 1 times [2024-11-12 17:54:49,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:49,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456869731] [2024-11-12 17:54:49,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:49,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:49,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:54:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:49,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:49,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:49,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 17:54:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:49,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:54:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:49,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 17:54:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:49,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-12 17:54:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:49,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 17:54:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:49,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 17:54:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:49,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 17:54:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:49,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 17:54:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:49,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 17:54:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:49,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 17:54:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-12 17:54:49,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:49,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456869731] [2024-11-12 17:54:49,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456869731] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:49,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658302888] [2024-11-12 17:54:49,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:49,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:49,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:49,597 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:49,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-12 17:54:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:49,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 17:54:49,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-12 17:54:49,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:49,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658302888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:49,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:49,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-12 17:54:49,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748834845] [2024-11-12 17:54:49,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:49,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:54:49,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:49,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:54:49,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:54:49,839 INFO L87 Difference]: Start difference. First operand 291 states and 447 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 17:54:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:49,883 INFO L93 Difference]: Finished difference Result 299 states and 461 transitions. [2024-11-12 17:54:49,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:54:49,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2024-11-12 17:54:49,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:49,886 INFO L225 Difference]: With dead ends: 299 [2024-11-12 17:54:49,886 INFO L226 Difference]: Without dead ends: 298 [2024-11-12 17:54:49,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:54:49,887 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 10 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:49,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1072 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:49,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-12 17:54:49,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 292. [2024-11-12 17:54:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 228 states have (on average 1.543859649122807) internal successors, (352), 235 states have internal predecessors, (352), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 17:54:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 448 transitions. [2024-11-12 17:54:49,897 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 448 transitions. Word has length 119 [2024-11-12 17:54:49,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:49,898 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 448 transitions. [2024-11-12 17:54:49,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 17:54:49,898 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 448 transitions. [2024-11-12 17:54:49,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 17:54:49,900 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:49,900 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:49,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-12 17:54:50,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-12 17:54:50,105 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:50,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:50,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1625366468, now seen corresponding path program 1 times [2024-11-12 17:54:50,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:50,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623245274] [2024-11-12 17:54:50,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:50,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:54:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 17:54:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:54:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 17:54:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-12 17:54:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 17:54:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 17:54:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 17:54:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 17:54:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 17:54:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 17:54:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,261 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-12 17:54:50,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:50,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623245274] [2024-11-12 17:54:50,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623245274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:50,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868750425] [2024-11-12 17:54:50,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:50,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:50,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:50,264 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:50,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-12 17:54:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 17:54:50,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-12 17:54:50,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:50,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868750425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:50,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:50,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-12 17:54:50,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845469620] [2024-11-12 17:54:50,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:50,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:54:50,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:50,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:54:50,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:54:50,478 INFO L87 Difference]: Start difference. First operand 292 states and 448 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 17:54:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:50,525 INFO L93 Difference]: Finished difference Result 300 states and 462 transitions. [2024-11-12 17:54:50,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:54:50,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2024-11-12 17:54:50,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:50,527 INFO L225 Difference]: With dead ends: 300 [2024-11-12 17:54:50,527 INFO L226 Difference]: Without dead ends: 299 [2024-11-12 17:54:50,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:54:50,528 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 12 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:50,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1115 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:50,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-12 17:54:50,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 290. [2024-11-12 17:54:50,537 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-11-12 17:54:50,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 446 transitions. [2024-11-12 17:54:50,539 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 446 transitions. Word has length 119 [2024-11-12 17:54:50,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:50,540 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 446 transitions. [2024-11-12 17:54:50,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 17:54:50,540 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 446 transitions. [2024-11-12 17:54:50,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-12 17:54:50,542 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:50,542 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:50,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-12 17:54:50,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:50,743 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:50,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:50,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1347042293, now seen corresponding path program 1 times [2024-11-12 17:54:50,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:50,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709466852] [2024-11-12 17:54:50,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:50,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:54:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 17:54:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:54:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 17:54:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-12 17:54:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 17:54:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 17:54:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 17:54:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 17:54:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 17:54:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 17:54:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-12 17:54:50,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:50,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709466852] [2024-11-12 17:54:50,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709466852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:50,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939386954] [2024-11-12 17:54:50,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:50,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:50,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:50,907 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:50,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-12 17:54:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:51,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:54:51,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-12 17:54:51,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:51,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939386954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:51,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:51,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-12 17:54:51,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319203427] [2024-11-12 17:54:51,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:51,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:54:51,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:51,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:54:51,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-12 17:54:51,140 INFO L87 Difference]: Start difference. First operand 290 states and 446 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-12 17:54:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:51,194 INFO L93 Difference]: Finished difference Result 295 states and 452 transitions. [2024-11-12 17:54:51,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:54:51,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 120 [2024-11-12 17:54:51,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:51,197 INFO L225 Difference]: With dead ends: 295 [2024-11-12 17:54:51,197 INFO L226 Difference]: Without dead ends: 294 [2024-11-12 17:54:51,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-12 17:54:51,198 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 18 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:51,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1348 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:51,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-12 17:54:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2024-11-12 17:54:51,212 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-11-12 17:54:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 446 transitions. [2024-11-12 17:54:51,214 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 446 transitions. Word has length 120 [2024-11-12 17:54:51,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:51,215 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 446 transitions. [2024-11-12 17:54:51,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-12 17:54:51,215 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 446 transitions. [2024-11-12 17:54:51,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-12 17:54:51,217 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:51,217 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:51,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-12 17:54:51,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:51,418 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:51,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:51,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1153246709, now seen corresponding path program 1 times [2024-11-12 17:54:51,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:51,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147406273] [2024-11-12 17:54:51,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:51,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:51,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:54:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:51,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:51,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:51,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 17:54:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:51,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:54:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:51,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 17:54:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:51,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-12 17:54:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:51,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 17:54:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:51,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 17:54:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:51,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 17:54:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:51,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 17:54:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:51,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 17:54:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:51,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 17:54:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:51,564 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-12 17:54:51,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:51,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147406273] [2024-11-12 17:54:51,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147406273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:51,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016222911] [2024-11-12 17:54:51,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:51,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:51,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:51,568 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:51,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-12 17:54:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:51,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:54:51,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-12 17:54:51,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:51,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016222911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:51,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:51,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-12 17:54:51,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999486958] [2024-11-12 17:54:51,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:51,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:54:51,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:51,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:54:51,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-12 17:54:51,804 INFO L87 Difference]: Start difference. First operand 290 states and 446 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-12 17:54:51,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:51,864 INFO L93 Difference]: Finished difference Result 505 states and 777 transitions. [2024-11-12 17:54:51,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:54:51,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 120 [2024-11-12 17:54:51,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:51,867 INFO L225 Difference]: With dead ends: 505 [2024-11-12 17:54:51,867 INFO L226 Difference]: Without dead ends: 305 [2024-11-12 17:54:51,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-12 17:54:51,869 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 16 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:51,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1418 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:51,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-12 17:54:51,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 292. [2024-11-12 17:54:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 229 states have (on average 1.537117903930131) internal successors, (352), 235 states have internal predecessors, (352), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 17:54:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 448 transitions. [2024-11-12 17:54:51,878 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 448 transitions. Word has length 120 [2024-11-12 17:54:51,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:51,878 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 448 transitions. [2024-11-12 17:54:51,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-12 17:54:51,879 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 448 transitions. [2024-11-12 17:54:51,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-12 17:54:51,880 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:51,880 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:51,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-12 17:54:52,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:52,081 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:52,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:52,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1840912999, now seen corresponding path program 1 times [2024-11-12 17:54:52,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:52,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821530129] [2024-11-12 17:54:52,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:52,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:52,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:54:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:52,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:52,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:54:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:52,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 17:54:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:52,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:54:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:52,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 17:54:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:52,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-12 17:54:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:52,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 17:54:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:52,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 17:54:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:52,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 17:54:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:52,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 17:54:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:52,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 17:54:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:52,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 17:54:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-12 17:54:52,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:52,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821530129] [2024-11-12 17:54:52,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821530129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:52,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403148804] [2024-11-12 17:54:52,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:52,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:52,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:52,263 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:52,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-12 17:54:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:52,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 17:54:52,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-12 17:54:52,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:52,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403148804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:52,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:52,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2024-11-12 17:54:52,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68974575] [2024-11-12 17:54:52,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:52,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 17:54:52,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:52,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 17:54:52,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-12 17:54:52,527 INFO L87 Difference]: Start difference. First operand 292 states and 448 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-12 17:54:52,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:52,608 INFO L93 Difference]: Finished difference Result 306 states and 473 transitions. [2024-11-12 17:54:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 17:54:52,609 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 122 [2024-11-12 17:54:52,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:52,610 INFO L225 Difference]: With dead ends: 306 [2024-11-12 17:54:52,610 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 17:54:52,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-12 17:54:52,611 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 28 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:52,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1680 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:54:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 17:54:52,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 17:54:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:54:52,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 17:54:52,613 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122 [2024-11-12 17:54:52,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:52,614 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 17:54:52,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-12 17:54:52,614 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 17:54:52,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 17:54:52,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-12 17:54:52,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-12 17:54:52,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-12 17:54:52,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-12 17:54:52,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-12 17:54:52,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-12 17:54:52,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-12 17:54:52,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-12 17:54:52,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-12 17:54:52,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:52,821 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:52,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 17:54:53,142 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 17:54:53,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:54:53 BoogieIcfgContainer [2024-11-12 17:54:53,180 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 17:54:53,181 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 17:54:53,182 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 17:54:53,183 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 17:54:53,183 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:54:38" (3/4) ... [2024-11-12 17:54:53,186 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 17:54:53,189 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_int8 [2024-11-12 17:54:53,190 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_bool [2024-11-12 17:54:53,190 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert [2024-11-12 17:54:53,190 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure add_history_type [2024-11-12 17:54:53,190 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 17:54:53,190 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure write_history_bool [2024-11-12 17:54:53,205 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-12 17:54:53,208 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-12 17:54:53,208 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 17:54:53,209 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 17:54:53,240 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2024-11-12 17:54:53,307 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2024-11-12 17:54:53,361 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 17:54:53,362 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 17:54:53,362 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 17:54:53,363 INFO L158 Benchmark]: Toolchain (without parser) took 16174.17ms. Allocated memory was 184.5MB in the beginning and 358.6MB in the end (delta: 174.1MB). Free memory was 113.7MB in the beginning and 212.5MB in the end (delta: -98.8MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2024-11-12 17:54:53,363 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 184.5MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:54:53,363 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.94ms. Allocated memory is still 184.5MB. Free memory was 113.5MB in the beginning and 149.5MB in the end (delta: -36.0MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-11-12 17:54:53,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.00ms. Allocated memory is still 184.5MB. Free memory was 149.5MB in the beginning and 146.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:54:53,366 INFO L158 Benchmark]: Boogie Preprocessor took 65.97ms. Allocated memory is still 184.5MB. Free memory was 146.5MB in the beginning and 142.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 17:54:53,367 INFO L158 Benchmark]: RCFGBuilder took 821.50ms. Allocated memory is still 184.5MB. Free memory was 142.3MB in the beginning and 102.2MB in the end (delta: 40.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-12 17:54:53,367 INFO L158 Benchmark]: TraceAbstraction took 14580.38ms. Allocated memory was 184.5MB in the beginning and 358.6MB in the end (delta: 174.1MB). Free memory was 101.3MB in the beginning and 225.1MB in the end (delta: -123.8MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. [2024-11-12 17:54:53,367 INFO L158 Benchmark]: Witness Printer took 181.30ms. Allocated memory is still 358.6MB. Free memory was 225.1MB in the beginning and 212.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 17:54:53,369 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.99ms. Allocated memory is still 184.5MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.94ms. Allocated memory is still 184.5MB. Free memory was 113.5MB in the beginning and 149.5MB in the end (delta: -36.0MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.00ms. Allocated memory is still 184.5MB. Free memory was 149.5MB in the beginning and 146.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.97ms. Allocated memory is still 184.5MB. Free memory was 146.5MB in the beginning and 142.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 821.50ms. Allocated memory is still 184.5MB. Free memory was 142.3MB in the beginning and 102.2MB in the end (delta: 40.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14580.38ms. Allocated memory was 184.5MB in the beginning and 358.6MB in the end (delta: 174.1MB). Free memory was 101.3MB in the beginning and 225.1MB in the end (delta: -123.8MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. * Witness Printer took 181.30ms. Allocated memory is still 358.6MB. Free memory was 225.1MB in the beginning and 212.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 193 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 14.2s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 398 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 363 mSDsluCounter, 21530 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15296 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1012 IncrementalHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 6234 mSDtfsCounter, 1012 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2527 GetRequests, 2369 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=292occurred in iteration=18, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 118 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 4033 NumberOfCodeBlocks, 4033 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3992 ConstructedInterpolants, 0 QuantifiedInterpolants, 6070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 10641 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 41 InterpolantComputations, 22 PerfectInterpolantSequences, 1814/1875 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 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))) - ProcedureContractResult [Line: 104]: Procedure Contract for read_history_int8 Derived contract for procedure read_history_int8. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 124]: Procedure Contract for read_history_bool Derived contract for procedure read_history_bool. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 526]: Procedure Contract for assert Derived contract for procedure assert. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 60]: Procedure Contract for add_history_type Derived contract for procedure add_history_type. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 36]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 179]: Procedure Contract for write_history_bool Derived contract for procedure write_history_bool. Ensures: (((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) RESULT: Ultimate proved your program to be correct! [2024-11-12 17:54:53,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE