./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 20:47:11,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 20:47:11,610 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-24 20:47:11,615 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 20:47:11,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 20:47:11,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 20:47:11,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 20:47:11,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 20:47:11,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 20:47:11,646 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 20:47:11,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 20:47:11,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 20:47:11,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 20:47:11,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 20:47:11,647 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 20:47:11,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 20:47:11,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 20:47:11,652 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 20:47:11,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 20:47:11,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 20:47:11,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 20:47:11,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 20:47:11,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 20:47:11,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 20:47:11,655 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 20:47:11,656 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 20:47:11,656 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 20:47:11,656 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 20:47:11,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 20:47:11,656 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 20:47:11,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 20:47:11,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 20:47:11,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 20:47:11,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 20:47:11,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:47:11,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 20:47:11,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 20:47:11,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 20:47:11,658 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 20:47:11,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 20:47:11,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 20:47:11,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 20:47:11,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 20:47:11,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 20:47:11,659 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 [2024-10-24 20:47:11,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 20:47:11,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 20:47:11,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 20:47:11,919 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 20:47:11,920 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 20:47:11,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-10-24 20:47:13,207 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 20:47:13,408 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 20:47:13,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-10-24 20:47:13,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5db5e9868/af197d94189a4b3a99bd67e5bd603643/FLAG4f5776c1c [2024-10-24 20:47:13,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5db5e9868/af197d94189a4b3a99bd67e5bd603643 [2024-10-24 20:47:13,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 20:47:13,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 20:47:13,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 20:47:13,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 20:47:13,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 20:47:13,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:47:13" (1/1) ... [2024-10-24 20:47:13,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a44e5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:13, skipping insertion in model container [2024-10-24 20:47:13,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:47:13" (1/1) ... [2024-10-24 20:47:13,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 20:47:13,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:47:13,704 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 20:47:13,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:47:13,773 INFO L204 MainTranslator]: Completed translation [2024-10-24 20:47:13,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:13 WrapperNode [2024-10-24 20:47:13,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 20:47:13,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 20:47:13,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 20:47:13,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 20:47:13,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:13" (1/1) ... [2024-10-24 20:47:13,793 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:13" (1/1) ... [2024-10-24 20:47:13,826 INFO L138 Inliner]: procedures = 28, calls = 52, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 431 [2024-10-24 20:47:13,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 20:47:13,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 20:47:13,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 20:47:13,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 20:47:13,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:13" (1/1) ... [2024-10-24 20:47:13,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:13" (1/1) ... [2024-10-24 20:47:13,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:13" (1/1) ... [2024-10-24 20:47:13,860 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 20:47:13,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:13" (1/1) ... [2024-10-24 20:47:13,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:13" (1/1) ... [2024-10-24 20:47:13,868 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:13" (1/1) ... [2024-10-24 20:47:13,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:13" (1/1) ... [2024-10-24 20:47:13,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:13" (1/1) ... [2024-10-24 20:47:13,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:13" (1/1) ... [2024-10-24 20:47:13,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 20:47:13,901 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 20:47:13,901 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 20:47:13,901 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 20:47:13,902 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:13" (1/1) ... [2024-10-24 20:47:13,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:47:13,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:13,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 20:47:13,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 20:47:13,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 20:47:13,991 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-10-24 20:47:13,992 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-10-24 20:47:13,992 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-24 20:47:13,992 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-24 20:47:13,992 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-10-24 20:47:13,992 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-10-24 20:47:13,992 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-10-24 20:47:13,992 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-10-24 20:47:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-10-24 20:47:13,994 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-10-24 20:47:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 20:47:13,994 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 20:47:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 20:47:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 20:47:13,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 20:47:14,082 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 20:47:14,084 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 20:47:14,572 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-10-24 20:47:14,572 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 20:47:14,657 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 20:47:14,658 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 20:47:14,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:47:14 BoogieIcfgContainer [2024-10-24 20:47:14,659 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 20:47:14,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 20:47:14,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 20:47:14,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 20:47:14,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:47:13" (1/3) ... [2024-10-24 20:47:14,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab2383e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:47:14, skipping insertion in model container [2024-10-24 20:47:14,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:13" (2/3) ... [2024-10-24 20:47:14,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab2383e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:47:14, skipping insertion in model container [2024-10-24 20:47:14,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:47:14" (3/3) ... [2024-10-24 20:47:14,665 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-10-24 20:47:14,677 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 20:47:14,677 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-24 20:47:14,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 20:47:14,730 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;@770f0c98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 20:47:14,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-24 20:47:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 136 states have (on average 1.625) internal successors, (221), 148 states have internal predecessors, (221), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-24 20:47:14,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 20:47:14,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:14,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:14,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:14,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:14,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2086756662, now seen corresponding path program 1 times [2024-10-24 20:47:14,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:14,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141410568] [2024-10-24 20:47:14,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:14,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:47:15,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:15,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141410568] [2024-10-24 20:47:15,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141410568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:15,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:47:15,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 20:47:15,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934014942] [2024-10-24 20:47:15,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:15,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:15,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:15,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:15,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:47:15,038 INFO L87 Difference]: Start difference. First operand has 188 states, 136 states have (on average 1.625) internal successors, (221), 148 states have internal predecessors, (221), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:47:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:15,155 INFO L93 Difference]: Finished difference Result 396 states and 657 transitions. [2024-10-24 20:47:15,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:47:15,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-24 20:47:15,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:15,168 INFO L225 Difference]: With dead ends: 396 [2024-10-24 20:47:15,168 INFO L226 Difference]: Without dead ends: 210 [2024-10-24 20:47:15,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:47:15,179 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 37 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:15,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 853 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:15,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-24 20:47:15,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 203. [2024-10-24 20:47:15,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 150 states have (on average 1.58) internal successors, (237), 161 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-10-24 20:47:15,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 313 transitions. [2024-10-24 20:47:15,239 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 313 transitions. Word has length 10 [2024-10-24 20:47:15,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:15,240 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 313 transitions. [2024-10-24 20:47:15,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:47:15,241 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 313 transitions. [2024-10-24 20:47:15,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 20:47:15,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:15,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:15,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 20:47:15,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:15,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:15,245 INFO L85 PathProgramCache]: Analyzing trace with hash 911528544, now seen corresponding path program 1 times [2024-10-24 20:47:15,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:15,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344928655] [2024-10-24 20:47:15,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:15,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 20:47:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:47:15,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:15,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344928655] [2024-10-24 20:47:15,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344928655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:15,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:47:15,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:47:15,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242965945] [2024-10-24 20:47:15,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:15,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:15,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:15,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:15,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:47:15,400 INFO L87 Difference]: Start difference. First operand 203 states and 313 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 20:47:15,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:15,474 INFO L93 Difference]: Finished difference Result 430 states and 672 transitions. [2024-10-24 20:47:15,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:15,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-24 20:47:15,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:15,480 INFO L225 Difference]: With dead ends: 430 [2024-10-24 20:47:15,480 INFO L226 Difference]: Without dead ends: 238 [2024-10-24 20:47:15,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:47:15,482 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 19 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:15,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 856 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:15,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-24 20:47:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-10-24 20:47:15,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 176 states have (on average 1.5454545454545454) internal successors, (272), 187 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-10-24 20:47:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2024-10-24 20:47:15,509 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 15 [2024-10-24 20:47:15,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:15,509 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2024-10-24 20:47:15,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 20:47:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2024-10-24 20:47:15,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 20:47:15,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:15,511 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:15,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 20:47:15,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:15,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:15,512 INFO L85 PathProgramCache]: Analyzing trace with hash -963447664, now seen corresponding path program 1 times [2024-10-24 20:47:15,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:15,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900880548] [2024-10-24 20:47:15,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:15,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 20:47:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 20:47:15,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:15,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900880548] [2024-10-24 20:47:15,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900880548] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:15,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331160551] [2024-10-24 20:47:15,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:15,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:15,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:15,714 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:15,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 20:47:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 20:47:15,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 20:47:15,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:15,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331160551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:15,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:15,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-24 20:47:15,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720096155] [2024-10-24 20:47:15,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:15,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:47:15,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:15,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:47:15,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:15,902 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:47:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:15,956 INFO L93 Difference]: Finished difference Result 238 states and 364 transitions. [2024-10-24 20:47:15,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:15,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-10-24 20:47:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:15,959 INFO L225 Difference]: With dead ends: 238 [2024-10-24 20:47:15,961 INFO L226 Difference]: Without dead ends: 237 [2024-10-24 20:47:15,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:15,963 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 19 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:15,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 818 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-24 20:47:15,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2024-10-24 20:47:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 186 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-10-24 20:47:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 355 transitions. [2024-10-24 20:47:15,992 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 355 transitions. Word has length 28 [2024-10-24 20:47:15,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:15,992 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 355 transitions. [2024-10-24 20:47:15,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:47:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 355 transitions. [2024-10-24 20:47:15,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-24 20:47:15,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:15,996 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-24 20:47:16,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 20:47:16,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:16,198 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:16,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:16,199 INFO L85 PathProgramCache]: Analyzing trace with hash 197894010, now seen corresponding path program 1 times [2024-10-24 20:47:16,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:16,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498471519] [2024-10-24 20:47:16,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:16,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:16,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 20:47:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:16,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:16,280 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 20:47:16,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:16,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498471519] [2024-10-24 20:47:16,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498471519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:16,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:47:16,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:47:16,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763759548] [2024-10-24 20:47:16,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:16,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:16,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:16,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:16,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:47:16,283 INFO L87 Difference]: Start difference. First operand 233 states and 355 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:47:16,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:16,320 INFO L93 Difference]: Finished difference Result 237 states and 361 transitions. [2024-10-24 20:47:16,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:16,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-10-24 20:47:16,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:16,323 INFO L225 Difference]: With dead ends: 237 [2024-10-24 20:47:16,323 INFO L226 Difference]: Without dead ends: 236 [2024-10-24 20:47:16,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:47:16,324 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 18 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:16,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 820 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:16,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-24 20:47:16,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 203. [2024-10-24 20:47:16,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 152 states have (on average 1.5328947368421053) internal successors, (233), 161 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-10-24 20:47:16,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 309 transitions. [2024-10-24 20:47:16,340 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 309 transitions. Word has length 29 [2024-10-24 20:47:16,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:16,340 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 309 transitions. [2024-10-24 20:47:16,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:47:16,340 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 309 transitions. [2024-10-24 20:47:16,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-24 20:47:16,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:16,345 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:16,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 20:47:16,345 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:16,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:16,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1324074788, now seen corresponding path program 1 times [2024-10-24 20:47:16,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:16,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529126377] [2024-10-24 20:47:16,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:16,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:16,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:16,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:16,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:16,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:16,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:16,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 20:47:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:16,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 20:47:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:16,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 20:47:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:16,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 20:47:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:16,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 20:47:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:16,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 20:47:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-24 20:47:16,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:16,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529126377] [2024-10-24 20:47:16,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529126377] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:16,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816061772] [2024-10-24 20:47:16,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:16,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:16,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:16,561 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:16,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 20:47:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:16,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:16,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 20:47:16,741 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:16,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816061772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:16,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:16,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-24 20:47:16,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730981067] [2024-10-24 20:47:16,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:16,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:16,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:16,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:16,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:16,743 INFO L87 Difference]: Start difference. First operand 203 states and 309 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 20:47:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:16,821 INFO L93 Difference]: Finished difference Result 354 states and 547 transitions. [2024-10-24 20:47:16,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:47:16,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2024-10-24 20:47:16,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:16,823 INFO L225 Difference]: With dead ends: 354 [2024-10-24 20:47:16,825 INFO L226 Difference]: Without dead ends: 210 [2024-10-24 20:47:16,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:47:16,827 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 10 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:16,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 826 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:47:16,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-24 20:47:16,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2024-10-24 20:47:16,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 157 states have (on average 1.535031847133758) internal successors, (241), 167 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-10-24 20:47:16,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 319 transitions. [2024-10-24 20:47:16,841 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 319 transitions. Word has length 89 [2024-10-24 20:47:16,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:16,843 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 319 transitions. [2024-10-24 20:47:16,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 20:47:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 319 transitions. [2024-10-24 20:47:16,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 20:47:16,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:16,847 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:16,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 20:47:17,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:17,048 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:17,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:17,048 INFO L85 PathProgramCache]: Analyzing trace with hash -798743788, now seen corresponding path program 1 times [2024-10-24 20:47:17,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:17,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873990147] [2024-10-24 20:47:17,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:17,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 20:47:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 20:47:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 20:47:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 20:47:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 20:47:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-24 20:47:17,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:17,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873990147] [2024-10-24 20:47:17,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873990147] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:17,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62853448] [2024-10-24 20:47:17,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:17,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:17,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:17,282 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:17,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 20:47:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:17,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-24 20:47:17,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:17,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62853448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:17,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:17,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-24 20:47:17,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491104962] [2024-10-24 20:47:17,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:17,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:17,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:17,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:17,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:17,447 INFO L87 Difference]: Start difference. First operand 210 states and 319 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 20:47:17,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:17,513 INFO L93 Difference]: Finished difference Result 368 states and 566 transitions. [2024-10-24 20:47:17,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:47:17,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 91 [2024-10-24 20:47:17,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:17,517 INFO L225 Difference]: With dead ends: 368 [2024-10-24 20:47:17,517 INFO L226 Difference]: Without dead ends: 217 [2024-10-24 20:47:17,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:47:17,518 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 8 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:17,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 823 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-24 20:47:17,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-10-24 20:47:17,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 162 states have (on average 1.537037037037037) internal successors, (249), 173 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-10-24 20:47:17,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 329 transitions. [2024-10-24 20:47:17,531 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 329 transitions. Word has length 91 [2024-10-24 20:47:17,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:17,531 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 329 transitions. [2024-10-24 20:47:17,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 20:47:17,531 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 329 transitions. [2024-10-24 20:47:17,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 20:47:17,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:17,533 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:17,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 20:47:17,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:17,734 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:17,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:17,734 INFO L85 PathProgramCache]: Analyzing trace with hash 858309807, now seen corresponding path program 1 times [2024-10-24 20:47:17,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:17,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514944526] [2024-10-24 20:47:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:17,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 20:47:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 20:47:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 20:47:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 20:47:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 20:47:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-24 20:47:17,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:17,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514944526] [2024-10-24 20:47:17,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514944526] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:17,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273181749] [2024-10-24 20:47:17,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:17,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:17,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:17,908 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:17,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 20:47:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:18,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:18,080 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-24 20:47:18,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:18,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273181749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:18,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:18,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-24 20:47:18,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459644282] [2024-10-24 20:47:18,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:18,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:18,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:18,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:18,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:18,081 INFO L87 Difference]: Start difference. First operand 217 states and 329 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 20:47:18,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:18,184 INFO L93 Difference]: Finished difference Result 393 states and 616 transitions. [2024-10-24 20:47:18,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:47:18,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 92 [2024-10-24 20:47:18,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:18,186 INFO L225 Difference]: With dead ends: 393 [2024-10-24 20:47:18,186 INFO L226 Difference]: Without dead ends: 235 [2024-10-24 20:47:18,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:47:18,187 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 39 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:18,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 782 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:47:18,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-24 20:47:18,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2024-10-24 20:47:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 174 states have (on average 1.5517241379310345) internal successors, (270), 185 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-10-24 20:47:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 352 transitions. [2024-10-24 20:47:18,197 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 352 transitions. Word has length 92 [2024-10-24 20:47:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:18,197 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 352 transitions. [2024-10-24 20:47:18,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 20:47:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 352 transitions. [2024-10-24 20:47:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 20:47:18,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:18,199 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:18,214 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-10-24 20:47:18,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:18,400 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:18,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:18,400 INFO L85 PathProgramCache]: Analyzing trace with hash 875546214, now seen corresponding path program 1 times [2024-10-24 20:47:18,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:18,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294581853] [2024-10-24 20:47:18,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:18,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 20:47:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 20:47:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 20:47:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 20:47:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 20:47:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-10-24 20:47:18,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:18,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294581853] [2024-10-24 20:47:18,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294581853] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:18,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47773351] [2024-10-24 20:47:18,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:18,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:18,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:18,566 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:18,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 20:47:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:18,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 20:47:18,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:18,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47773351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:18,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:18,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-24 20:47:18,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307731352] [2024-10-24 20:47:18,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:18,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:18,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:18,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:18,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:18,723 INFO L87 Difference]: Start difference. First operand 231 states and 352 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-10-24 20:47:18,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:18,787 INFO L93 Difference]: Finished difference Result 468 states and 728 transitions. [2024-10-24 20:47:18,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:47:18,788 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 95 [2024-10-24 20:47:18,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:18,789 INFO L225 Difference]: With dead ends: 468 [2024-10-24 20:47:18,789 INFO L226 Difference]: Without dead ends: 255 [2024-10-24 20:47:18,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:47:18,791 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 21 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:18,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 802 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-24 20:47:18,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2024-10-24 20:47:18,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 194 states have (on average 1.5670103092783505) internal successors, (304), 205 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-10-24 20:47:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 390 transitions. [2024-10-24 20:47:18,800 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 390 transitions. Word has length 95 [2024-10-24 20:47:18,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:18,800 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 390 transitions. [2024-10-24 20:47:18,800 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-10-24 20:47:18,800 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 390 transitions. [2024-10-24 20:47:18,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 20:47:18,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:18,802 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:18,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 20:47:19,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:19,002 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:19,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:19,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1706377028, now seen corresponding path program 1 times [2024-10-24 20:47:19,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:19,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318237961] [2024-10-24 20:47:19,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:19,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 20:47:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 20:47:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 20:47:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 20:47:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 20:47:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,141 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-24 20:47:19,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:19,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318237961] [2024-10-24 20:47:19,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318237961] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:19,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993648596] [2024-10-24 20:47:19,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:19,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:19,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:19,143 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:19,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 20:47:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:19,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-24 20:47:19,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:19,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993648596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:19,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:19,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-24 20:47:19,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445325177] [2024-10-24 20:47:19,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:19,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:19,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:19,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:19,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:19,286 INFO L87 Difference]: Start difference. First operand 255 states and 390 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-10-24 20:47:19,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:19,350 INFO L93 Difference]: Finished difference Result 512 states and 793 transitions. [2024-10-24 20:47:19,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:47:19,351 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 97 [2024-10-24 20:47:19,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:19,353 INFO L225 Difference]: With dead ends: 512 [2024-10-24 20:47:19,353 INFO L226 Difference]: Without dead ends: 275 [2024-10-24 20:47:19,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:47:19,355 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 19 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:19,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 789 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:19,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-24 20:47:19,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-10-24 20:47:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 221 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-10-24 20:47:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 420 transitions. [2024-10-24 20:47:19,370 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 420 transitions. Word has length 97 [2024-10-24 20:47:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:19,371 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 420 transitions. [2024-10-24 20:47:19,371 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-10-24 20:47:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 420 transitions. [2024-10-24 20:47:19,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 20:47:19,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:19,372 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:19,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 20:47:19,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:19,578 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:19,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:19,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1550497794, now seen corresponding path program 1 times [2024-10-24 20:47:19,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:19,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229272705] [2024-10-24 20:47:19,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:19,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 20:47:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 20:47:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 20:47:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 20:47:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 20:47:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,718 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 20:47:19,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:19,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229272705] [2024-10-24 20:47:19,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229272705] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:19,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938376747] [2024-10-24 20:47:19,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:19,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:19,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:19,720 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:19,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 20:47:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:19,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-24 20:47:19,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:19,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938376747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:19,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:19,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-24 20:47:19,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27233409] [2024-10-24 20:47:19,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:19,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:19,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:19,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:19,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:19,860 INFO L87 Difference]: Start difference. First operand 275 states and 420 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 20:47:19,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:19,892 INFO L93 Difference]: Finished difference Result 283 states and 435 transitions. [2024-10-24 20:47:19,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:19,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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 98 [2024-10-24 20:47:19,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:19,894 INFO L225 Difference]: With dead ends: 283 [2024-10-24 20:47:19,894 INFO L226 Difference]: Without dead ends: 282 [2024-10-24 20:47:19,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:19,896 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 12 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:19,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 811 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-24 20:47:19,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 274. [2024-10-24 20:47:19,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 210 states have (on average 1.5666666666666667) internal successors, (329), 220 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-10-24 20:47:19,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 419 transitions. [2024-10-24 20:47:19,907 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 419 transitions. Word has length 98 [2024-10-24 20:47:19,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:19,908 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 419 transitions. [2024-10-24 20:47:19,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 20:47:19,908 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 419 transitions. [2024-10-24 20:47:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 20:47:19,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:19,910 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:19,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-24 20:47:20,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:20,110 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:20,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:20,111 INFO L85 PathProgramCache]: Analyzing trace with hash -820791042, now seen corresponding path program 1 times [2024-10-24 20:47:20,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:20,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413556370] [2024-10-24 20:47:20,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:20,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 20:47:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 20:47:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 20:47:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 20:47:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 20:47:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 20:47:20,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:20,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413556370] [2024-10-24 20:47:20,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413556370] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:20,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120177443] [2024-10-24 20:47:20,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:20,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:20,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:20,254 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:20,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-24 20:47:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:20,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-24 20:47:20,418 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:20,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120177443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:20,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:20,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-24 20:47:20,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985043973] [2024-10-24 20:47:20,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:20,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:20,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:20,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:20,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:20,421 INFO L87 Difference]: Start difference. First operand 274 states and 419 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 20:47:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:20,456 INFO L93 Difference]: Finished difference Result 469 states and 721 transitions. [2024-10-24 20:47:20,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:20,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2024-10-24 20:47:20,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:20,458 INFO L225 Difference]: With dead ends: 469 [2024-10-24 20:47:20,459 INFO L226 Difference]: Without dead ends: 284 [2024-10-24 20:47:20,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:20,460 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 11 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:20,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 818 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-24 20:47:20,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-10-24 20:47:20,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 219 states have (on average 1.5616438356164384) internal successors, (342), 228 states have internal predecessors, (342), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-24 20:47:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 436 transitions. [2024-10-24 20:47:20,471 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 436 transitions. Word has length 99 [2024-10-24 20:47:20,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:20,472 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 436 transitions. [2024-10-24 20:47:20,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 20:47:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 436 transitions. [2024-10-24 20:47:20,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 20:47:20,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:20,474 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:20,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-24 20:47:20,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-24 20:47:20,679 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:20,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:20,679 INFO L85 PathProgramCache]: Analyzing trace with hash 220737804, now seen corresponding path program 1 times [2024-10-24 20:47:20,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:20,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906305340] [2024-10-24 20:47:20,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:20,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 20:47:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 20:47:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 20:47:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 20:47:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 20:47:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 20:47:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,831 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-24 20:47:20,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:20,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906305340] [2024-10-24 20:47:20,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906305340] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:20,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784759512] [2024-10-24 20:47:20,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:20,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:20,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:20,834 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:20,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-24 20:47:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:20,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-24 20:47:20,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:20,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784759512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:20,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:20,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-24 20:47:20,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634397582] [2024-10-24 20:47:20,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:20,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:20,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:20,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:20,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:20,987 INFO L87 Difference]: Start difference. First operand 284 states and 436 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 20:47:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:21,027 INFO L93 Difference]: Finished difference Result 295 states and 455 transitions. [2024-10-24 20:47:21,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:21,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (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 106 [2024-10-24 20:47:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:21,030 INFO L225 Difference]: With dead ends: 295 [2024-10-24 20:47:21,030 INFO L226 Difference]: Without dead ends: 294 [2024-10-24 20:47:21,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:21,031 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 10 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:21,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 838 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-24 20:47:21,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 285. [2024-10-24 20:47:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 220 states have (on average 1.559090909090909) internal successors, (343), 229 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-10-24 20:47:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 437 transitions. [2024-10-24 20:47:21,042 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 437 transitions. Word has length 106 [2024-10-24 20:47:21,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:21,042 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 437 transitions. [2024-10-24 20:47:21,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 20:47:21,042 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 437 transitions. [2024-10-24 20:47:21,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 20:47:21,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:21,044 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:21,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-24 20:47:21,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:21,245 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:21,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:21,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1747062340, now seen corresponding path program 1 times [2024-10-24 20:47:21,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:21,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049688220] [2024-10-24 20:47:21,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:21,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 20:47:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 20:47:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 20:47:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 20:47:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 20:47:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 20:47:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-24 20:47:21,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:21,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049688220] [2024-10-24 20:47:21,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049688220] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:21,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463940787] [2024-10-24 20:47:21,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:21,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:21,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:21,401 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:21,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-24 20:47:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:21,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-24 20:47:21,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:21,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463940787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:21,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:21,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-24 20:47:21,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173546528] [2024-10-24 20:47:21,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:21,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:21,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:21,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:21,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:21,557 INFO L87 Difference]: Start difference. First operand 285 states and 437 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 20:47:21,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:21,595 INFO L93 Difference]: Finished difference Result 287 states and 439 transitions. [2024-10-24 20:47:21,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:21,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2024-10-24 20:47:21,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:21,597 INFO L225 Difference]: With dead ends: 287 [2024-10-24 20:47:21,597 INFO L226 Difference]: Without dead ends: 286 [2024-10-24 20:47:21,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:21,598 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 9 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:21,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 840 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:21,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-24 20:47:21,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-10-24 20:47:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 221 states have (on average 1.5565610859728507) internal successors, (344), 230 states have internal predecessors, (344), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-24 20:47:21,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 438 transitions. [2024-10-24 20:47:21,609 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 438 transitions. Word has length 107 [2024-10-24 20:47:21,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:21,610 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 438 transitions. [2024-10-24 20:47:21,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 20:47:21,610 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 438 transitions. [2024-10-24 20:47:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 20:47:21,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:21,612 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:21,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-24 20:47:21,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-24 20:47:21,813 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:21,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:21,813 INFO L85 PathProgramCache]: Analyzing trace with hash 2056571984, now seen corresponding path program 1 times [2024-10-24 20:47:21,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:21,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451672948] [2024-10-24 20:47:21,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 20:47:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 20:47:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 20:47:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 20:47:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 20:47:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 20:47:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-24 20:47:21,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:21,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451672948] [2024-10-24 20:47:21,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451672948] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:21,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213963162] [2024-10-24 20:47:21,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:21,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:21,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:21,928 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:21,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-24 20:47:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 20:47:22,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:22,079 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-24 20:47:22,079 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:22,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213963162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:22,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:22,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-10-24 20:47:22,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880588613] [2024-10-24 20:47:22,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:22,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:47:22,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:22,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:47:22,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:47:22,081 INFO L87 Difference]: Start difference. First operand 286 states and 438 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 20:47:22,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:22,121 INFO L93 Difference]: Finished difference Result 291 states and 448 transitions. [2024-10-24 20:47:22,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:47:22,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-10-24 20:47:22,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:22,124 INFO L225 Difference]: With dead ends: 291 [2024-10-24 20:47:22,124 INFO L226 Difference]: Without dead ends: 290 [2024-10-24 20:47:22,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:47:22,124 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 12 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:22,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1066 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:22,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-24 20:47:22,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 285. [2024-10-24 20:47:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 221 states have (on average 1.5520361990950227) internal successors, (343), 229 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-10-24 20:47:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 437 transitions. [2024-10-24 20:47:22,133 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 437 transitions. Word has length 108 [2024-10-24 20:47:22,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:22,133 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 437 transitions. [2024-10-24 20:47:22,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 20:47:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 437 transitions. [2024-10-24 20:47:22,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 20:47:22,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:22,135 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:22,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-24 20:47:22,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-24 20:47:22,340 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:22,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:22,341 INFO L85 PathProgramCache]: Analyzing trace with hash -670777608, now seen corresponding path program 1 times [2024-10-24 20:47:22,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:22,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434366733] [2024-10-24 20:47:22,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:22,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 20:47:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 20:47:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 20:47:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 20:47:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 20:47:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 20:47:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-24 20:47:22,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:22,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434366733] [2024-10-24 20:47:22,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434366733] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:22,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110602575] [2024-10-24 20:47:22,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:22,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:22,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:22,476 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:22,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-24 20:47:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 20:47:22,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-24 20:47:22,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:22,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110602575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:22,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:22,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-24 20:47:22,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958933115] [2024-10-24 20:47:22,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:22,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 20:47:22,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:22,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 20:47:22,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:47:22,637 INFO L87 Difference]: Start difference. First operand 285 states and 437 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 20:47:22,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:22,689 INFO L93 Difference]: Finished difference Result 488 states and 752 transitions. [2024-10-24 20:47:22,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 20:47:22,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 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 109 [2024-10-24 20:47:22,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:22,691 INFO L225 Difference]: With dead ends: 488 [2024-10-24 20:47:22,691 INFO L226 Difference]: Without dead ends: 292 [2024-10-24 20:47:22,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:47:22,693 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 20 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:22,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1361 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:22,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-24 20:47:22,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2024-10-24 20:47:22,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 224 states have (on average 1.5580357142857142) internal successors, (349), 231 states have internal predecessors, (349), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 20:47:22,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 445 transitions. [2024-10-24 20:47:22,702 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 445 transitions. Word has length 109 [2024-10-24 20:47:22,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:22,702 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 445 transitions. [2024-10-24 20:47:22,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 20:47:22,702 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 445 transitions. [2024-10-24 20:47:22,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 20:47:22,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:22,704 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:22,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-24 20:47:22,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-24 20:47:22,904 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:22,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1591012698, now seen corresponding path program 1 times [2024-10-24 20:47:22,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:22,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317177501] [2024-10-24 20:47:22,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:22,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 20:47:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 20:47:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 20:47:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 20:47:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 20:47:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 20:47:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 20:47:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 20:47:23,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:23,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317177501] [2024-10-24 20:47:23,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317177501] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:23,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917423145] [2024-10-24 20:47:23,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:23,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:23,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:23,029 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:23,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-24 20:47:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:23,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-24 20:47:23,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:23,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917423145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:23,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:23,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-24 20:47:23,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520020501] [2024-10-24 20:47:23,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:23,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:23,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:23,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:23,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:23,176 INFO L87 Difference]: Start difference. First operand 288 states and 445 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 20:47:23,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:23,213 INFO L93 Difference]: Finished difference Result 297 states and 460 transitions. [2024-10-24 20:47:23,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:23,214 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, (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 114 [2024-10-24 20:47:23,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:23,215 INFO L225 Difference]: With dead ends: 297 [2024-10-24 20:47:23,216 INFO L226 Difference]: Without dead ends: 296 [2024-10-24 20:47:23,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:23,216 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 8 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:23,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 847 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-24 20:47:23,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 289. [2024-10-24 20:47:23,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 225 states have (on average 1.5555555555555556) internal successors, (350), 232 states have internal predecessors, (350), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 20:47:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 446 transitions. [2024-10-24 20:47:23,224 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 446 transitions. Word has length 114 [2024-10-24 20:47:23,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:23,225 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 446 transitions. [2024-10-24 20:47:23,225 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 20:47:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 446 transitions. [2024-10-24 20:47:23,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 20:47:23,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:23,227 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:23,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-24 20:47:23,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-24 20:47:23,428 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:23,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:23,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2076753722, now seen corresponding path program 1 times [2024-10-24 20:47:23,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:23,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909879137] [2024-10-24 20:47:23,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:23,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 20:47:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 20:47:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 20:47:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 20:47:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 20:47:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 20:47:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 20:47:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 20:47:23,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:23,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909879137] [2024-10-24 20:47:23,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909879137] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:23,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089366230] [2024-10-24 20:47:23,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:23,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:23,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:23,560 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:23,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-24 20:47:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:23,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-24 20:47:23,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:23,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089366230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:23,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:23,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-24 20:47:23,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642557761] [2024-10-24 20:47:23,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:23,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:23,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:23,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:23,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:23,726 INFO L87 Difference]: Start difference. First operand 289 states and 446 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 20:47:23,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:23,760 INFO L93 Difference]: Finished difference Result 292 states and 449 transitions. [2024-10-24 20:47:23,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:23,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2024-10-24 20:47:23,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:23,765 INFO L225 Difference]: With dead ends: 292 [2024-10-24 20:47:23,765 INFO L226 Difference]: Without dead ends: 291 [2024-10-24 20:47:23,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:23,765 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 7 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:23,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 836 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:23,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-24 20:47:23,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 290. [2024-10-24 20:47:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 226 states have (on average 1.5530973451327434) internal successors, (351), 233 states have internal predecessors, (351), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 20:47:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 447 transitions. [2024-10-24 20:47:23,774 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 447 transitions. Word has length 115 [2024-10-24 20:47:23,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:23,774 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 447 transitions. [2024-10-24 20:47:23,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 20:47:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 447 transitions. [2024-10-24 20:47:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 20:47:23,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:23,776 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:23,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-24 20:47:23,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:23,981 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:23,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:23,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2094366366, now seen corresponding path program 1 times [2024-10-24 20:47:23,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:23,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961884320] [2024-10-24 20:47:23,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:23,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 20:47:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 20:47:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 20:47:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 20:47:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 20:47:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 20:47:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 20:47:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 20:47:24,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:24,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961884320] [2024-10-24 20:47:24,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961884320] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:24,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671679896] [2024-10-24 20:47:24,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:24,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:24,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:24,119 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:24,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-24 20:47:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 20:47:24,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-24 20:47:24,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:24,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671679896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:24,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:24,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-24 20:47:24,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308247268] [2024-10-24 20:47:24,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:24,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 20:47:24,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:24,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 20:47:24,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:47:24,317 INFO L87 Difference]: Start difference. First operand 290 states and 447 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 20:47:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:24,383 INFO L93 Difference]: Finished difference Result 304 states and 469 transitions. [2024-10-24 20:47:24,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 20:47:24,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (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 116 [2024-10-24 20:47:24,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:24,386 INFO L225 Difference]: With dead ends: 304 [2024-10-24 20:47:24,386 INFO L226 Difference]: Without dead ends: 303 [2024-10-24 20:47:24,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:47:24,387 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 17 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:24,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1135 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:47:24,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-24 20:47:24,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2024-10-24 20:47:24,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 231 states have (on average 1.5454545454545454) internal successors, (357), 238 states have internal predecessors, (357), 49 states have call successors, (49), 14 states have call predecessors, (49), 14 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 20:47:24,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 455 transitions. [2024-10-24 20:47:24,398 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 455 transitions. Word has length 116 [2024-10-24 20:47:24,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:24,399 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 455 transitions. [2024-10-24 20:47:24,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 20:47:24,399 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 455 transitions. [2024-10-24 20:47:24,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 20:47:24,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:24,401 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:24,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-24 20:47:24,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-24 20:47:24,602 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:24,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:24,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1906574494, now seen corresponding path program 1 times [2024-10-24 20:47:24,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:24,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629684859] [2024-10-24 20:47:24,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:24,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 20:47:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 20:47:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 20:47:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 20:47:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 20:47:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 20:47:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 20:47:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 20:47:24,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:24,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629684859] [2024-10-24 20:47:24,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629684859] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:24,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367773296] [2024-10-24 20:47:24,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:24,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:24,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:24,739 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:24,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-24 20:47:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 20:47:24,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:24,920 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-24 20:47:24,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:24,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367773296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:24,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:24,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-10-24 20:47:24,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353969300] [2024-10-24 20:47:24,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:24,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:47:24,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:24,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:47:24,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:47:24,922 INFO L87 Difference]: Start difference. First operand 296 states and 455 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 20:47:24,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:24,966 INFO L93 Difference]: Finished difference Result 304 states and 469 transitions. [2024-10-24 20:47:24,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:47:24,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2024-10-24 20:47:24,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:24,968 INFO L225 Difference]: With dead ends: 304 [2024-10-24 20:47:24,969 INFO L226 Difference]: Without dead ends: 303 [2024-10-24 20:47:24,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:47:24,969 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 10 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1067 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-10-24 20:47:24,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1067 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:24,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-24 20:47:24,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2024-10-24 20:47:24,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 231 states have (on average 1.5454545454545454) internal successors, (357), 238 states have internal predecessors, (357), 49 states have call successors, (49), 14 states have call predecessors, (49), 14 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 20:47:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 455 transitions. [2024-10-24 20:47:24,979 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 455 transitions. Word has length 116 [2024-10-24 20:47:24,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:24,979 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 455 transitions. [2024-10-24 20:47:24,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 20:47:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 455 transitions. [2024-10-24 20:47:24,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 20:47:24,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:24,981 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:24,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-24 20:47:25,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:25,182 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:25,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:25,183 INFO L85 PathProgramCache]: Analyzing trace with hash 500848246, now seen corresponding path program 1 times [2024-10-24 20:47:25,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:25,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030559206] [2024-10-24 20:47:25,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:25,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 20:47:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 20:47:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 20:47:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 20:47:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 20:47:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 20:47:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 20:47:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 20:47:25,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:25,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030559206] [2024-10-24 20:47:25,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030559206] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:25,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967350940] [2024-10-24 20:47:25,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:25,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:25,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:25,340 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:25,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-24 20:47:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 20:47:25,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-24 20:47:25,539 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:25,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967350940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:25,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:25,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-24 20:47:25,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653134748] [2024-10-24 20:47:25,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:25,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 20:47:25,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:25,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 20:47:25,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:47:25,541 INFO L87 Difference]: Start difference. First operand 296 states and 455 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 20:47:25,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:25,599 INFO L93 Difference]: Finished difference Result 511 states and 787 transitions. [2024-10-24 20:47:25,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 20:47:25,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 117 [2024-10-24 20:47:25,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:25,603 INFO L225 Difference]: With dead ends: 511 [2024-10-24 20:47:25,604 INFO L226 Difference]: Without dead ends: 304 [2024-10-24 20:47:25,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:47:25,606 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 24 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:25,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1124 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:25,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-24 20:47:25,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 296. [2024-10-24 20:47:25,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 231 states have (on average 1.5454545454545454) internal successors, (357), 238 states have internal predecessors, (357), 49 states have call successors, (49), 14 states have call predecessors, (49), 14 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 20:47:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 455 transitions. [2024-10-24 20:47:25,619 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 455 transitions. Word has length 117 [2024-10-24 20:47:25,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:25,619 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 455 transitions. [2024-10-24 20:47:25,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 20:47:25,620 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 455 transitions. [2024-10-24 20:47:25,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 20:47:25,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:25,621 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:25,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-24 20:47:25,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:25,822 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:25,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:25,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1025732490, now seen corresponding path program 1 times [2024-10-24 20:47:25,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:25,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109918450] [2024-10-24 20:47:25,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:25,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 20:47:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 20:47:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 20:47:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 20:47:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 20:47:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 20:47:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 20:47:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 20:47:25,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:25,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109918450] [2024-10-24 20:47:25,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109918450] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:25,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896714411] [2024-10-24 20:47:25,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:25,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:25,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:25,939 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:25,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-24 20:47:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 20:47:26,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-24 20:47:26,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:26,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896714411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:26,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:26,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-24 20:47:26,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557313036] [2024-10-24 20:47:26,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:26,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 20:47:26,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:26,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 20:47:26,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:47:26,116 INFO L87 Difference]: Start difference. First operand 296 states and 455 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 20:47:26,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:26,156 INFO L93 Difference]: Finished difference Result 306 states and 469 transitions. [2024-10-24 20:47:26,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 20:47:26,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 117 [2024-10-24 20:47:26,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:26,159 INFO L225 Difference]: With dead ends: 306 [2024-10-24 20:47:26,159 INFO L226 Difference]: Without dead ends: 305 [2024-10-24 20:47:26,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:47:26,160 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 26 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:26,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1093 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:26,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-24 20:47:26,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 292. [2024-10-24 20:47:26,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 228 states have (on average 1.5482456140350878) internal successors, (353), 235 states have internal predecessors, (353), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 20:47:26,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 449 transitions. [2024-10-24 20:47:26,169 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 449 transitions. Word has length 117 [2024-10-24 20:47:26,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:26,170 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 449 transitions. [2024-10-24 20:47:26,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 20:47:26,170 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 449 transitions. [2024-10-24 20:47:26,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 20:47:26,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:26,171 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:26,186 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-10-24 20:47:26,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:26,375 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:26,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:26,376 INFO L85 PathProgramCache]: Analyzing trace with hash 406574306, now seen corresponding path program 1 times [2024-10-24 20:47:26,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:26,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201109458] [2024-10-24 20:47:26,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:26,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 20:47:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 20:47:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 20:47:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 20:47:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 20:47:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 20:47:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 20:47:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 20:47:26,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:26,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201109458] [2024-10-24 20:47:26,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201109458] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:26,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152828792] [2024-10-24 20:47:26,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:26,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:26,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:26,506 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:26,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-24 20:47:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 20:47:26,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-24 20:47:26,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:26,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152828792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:26,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:26,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-10-24 20:47:26,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736823530] [2024-10-24 20:47:26,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:26,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 20:47:26,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:26,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 20:47:26,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-24 20:47:26,701 INFO L87 Difference]: Start difference. First operand 292 states and 449 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 20:47:26,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:26,762 INFO L93 Difference]: Finished difference Result 307 states and 475 transitions. [2024-10-24 20:47:26,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 20:47:26,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 118 [2024-10-24 20:47:26,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:26,765 INFO L225 Difference]: With dead ends: 307 [2024-10-24 20:47:26,765 INFO L226 Difference]: Without dead ends: 306 [2024-10-24 20:47:26,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-24 20:47:26,765 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 31 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:26,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1326 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:26,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-24 20:47:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 291. [2024-10-24 20:47:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 228 states have (on average 1.543859649122807) internal successors, (352), 234 states have internal predecessors, (352), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 20:47:26,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 448 transitions. [2024-10-24 20:47:26,774 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 448 transitions. Word has length 118 [2024-10-24 20:47:26,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:26,774 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 448 transitions. [2024-10-24 20:47:26,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 20:47:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 448 transitions. [2024-10-24 20:47:26,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 20:47:26,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:26,776 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:26,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-10-24 20:47:26,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:26,976 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:26,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:26,977 INFO L85 PathProgramCache]: Analyzing trace with hash -281098062, now seen corresponding path program 1 times [2024-10-24 20:47:26,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:26,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246341932] [2024-10-24 20:47:26,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:26,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 20:47:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 20:47:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 20:47:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 20:47:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 20:47:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 20:47:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 20:47:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,080 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 20:47:27,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:27,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246341932] [2024-10-24 20:47:27,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246341932] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:27,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997523945] [2024-10-24 20:47:27,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:27,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:27,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:27,083 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:27,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-24 20:47:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 20:47:27,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-24 20:47:27,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:27,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997523945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:27,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:27,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2024-10-24 20:47:27,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247192670] [2024-10-24 20:47:27,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:27,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 20:47:27,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:27,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 20:47:27,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-24 20:47:27,277 INFO L87 Difference]: Start difference. First operand 291 states and 448 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 20:47:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:27,353 INFO L93 Difference]: Finished difference Result 305 states and 473 transitions. [2024-10-24 20:47:27,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 20:47:27,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 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 119 [2024-10-24 20:47:27,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:27,354 INFO L225 Difference]: With dead ends: 305 [2024-10-24 20:47:27,354 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 20:47:27,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-24 20:47:27,355 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 28 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:27,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1637 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:47:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 20:47:27,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 20:47:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:47:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 20:47:27,357 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2024-10-24 20:47:27,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:27,357 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 20:47:27,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 20:47:27,357 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 20:47:27,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 20:47:27,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-24 20:47:27,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-24 20:47:27,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-24 20:47:27,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-24 20:47:27,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-24 20:47:27,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-24 20:47:27,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-24 20:47:27,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-24 20:47:27,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-10-24 20:47:27,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-24 20:47:27,565 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:27,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 20:47:27,842 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 20:47:27,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:47:27 BoogieIcfgContainer [2024-10-24 20:47:27,873 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 20:47:27,873 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 20:47:27,873 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 20:47:27,874 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 20:47:27,874 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:47:14" (3/4) ... [2024-10-24 20:47:27,876 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 20:47:27,878 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_int8 [2024-10-24 20:47:27,879 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_bool [2024-10-24 20:47:27,879 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert [2024-10-24 20:47:27,879 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure add_history_type [2024-10-24 20:47:27,879 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 20:47:27,879 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure write_history_bool [2024-10-24 20:47:27,891 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2024-10-24 20:47:27,894 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-24 20:47:27,895 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 20:47:27,895 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 20:47:27,921 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2024-10-24 20:47:27,975 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2024-10-24 20:47:28,033 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 20:47:28,036 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 20:47:28,036 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 20:47:28,037 INFO L158 Benchmark]: Toolchain (without parser) took 14601.88ms. Allocated memory was 165.7MB in the beginning and 337.6MB in the end (delta: 172.0MB). Free memory was 109.2MB in the beginning and 302.4MB in the end (delta: -193.2MB). Peak memory consumption was 179.6MB. Max. memory is 16.1GB. [2024-10-24 20:47:28,037 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 165.7MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 20:47:28,037 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.00ms. Allocated memory is still 165.7MB. Free memory was 109.2MB in the beginning and 91.1MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 20:47:28,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.72ms. Allocated memory is still 165.7MB. Free memory was 91.1MB in the beginning and 87.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 20:47:28,037 INFO L158 Benchmark]: Boogie Preprocessor took 68.99ms. Allocated memory is still 165.7MB. Free memory was 87.5MB in the beginning and 83.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 20:47:28,037 INFO L158 Benchmark]: RCFGBuilder took 758.30ms. Allocated memory is still 165.7MB. Free memory was 83.4MB in the beginning and 127.4MB in the end (delta: -44.0MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2024-10-24 20:47:28,037 INFO L158 Benchmark]: TraceAbstraction took 13212.50ms. Allocated memory was 165.7MB in the beginning and 337.6MB in the end (delta: 172.0MB). Free memory was 126.6MB in the beginning and 118.0MB in the end (delta: 8.6MB). Peak memory consumption was 182.4MB. Max. memory is 16.1GB. [2024-10-24 20:47:28,038 INFO L158 Benchmark]: Witness Printer took 162.85ms. Allocated memory is still 337.6MB. Free memory was 116.9MB in the beginning and 302.4MB in the end (delta: -185.5MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-10-24 20:47:28,041 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.13ms. Allocated memory is still 165.7MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.00ms. Allocated memory is still 165.7MB. Free memory was 109.2MB in the beginning and 91.1MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.72ms. Allocated memory is still 165.7MB. Free memory was 91.1MB in the beginning and 87.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.99ms. Allocated memory is still 165.7MB. Free memory was 87.5MB in the beginning and 83.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 758.30ms. Allocated memory is still 165.7MB. Free memory was 83.4MB in the beginning and 127.4MB in the end (delta: -44.0MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13212.50ms. Allocated memory was 165.7MB in the beginning and 337.6MB in the end (delta: 172.0MB). Free memory was 126.6MB in the beginning and 118.0MB in the end (delta: 8.6MB). Peak memory consumption was 182.4MB. Max. memory is 16.1GB. * Witness Printer took 162.85ms. Allocated memory is still 337.6MB. Free memory was 116.9MB in the beginning and 302.4MB in the end (delta: -185.5MB). Peak memory consumption was 12.7MB. 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, 188 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 23, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 452 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 415 mSDsluCounter, 22168 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15739 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1165 IncrementalHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 6429 mSDtfsCounter, 1165 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2620 GetRequests, 2451 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=18, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 136 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 4156 NumberOfCodeBlocks, 4156 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 4113 ConstructedInterpolants, 0 QuantifiedInterpolants, 6328 SizeOfPredicates, 0 NumberOfNonLiveVariables, 10440 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 43 InterpolantComputations, 23 PerfectInterpolantSequences, 1927/1991 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 104]: Procedure Contract for read_history_int8 Derived contract for procedure read_history_int8. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 124]: Procedure Contract for read_history_bool Derived contract for procedure read_history_bool. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 530]: Procedure Contract for assert Derived contract for procedure assert. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 60]: Procedure Contract for add_history_type Derived contract for procedure add_history_type. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 36]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 179]: Procedure Contract for write_history_bool Derived contract for procedure write_history_bool. Ensures: (((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) RESULT: Ultimate proved your program to be correct! [2024-10-24 20:47:28,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE