./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash fb567b374acd8bb9754dd21f812a202296c7800faf8be127cd0c1294b076cd75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:42:56,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:42:56,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 01:42:56,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:42:56,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:42:56,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:42:56,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:42:56,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:42:56,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:42:56,145 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:42:56,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:42:56,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:42:56,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:42:56,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:42:56,146 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:42:56,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:42:56,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:42:56,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:42:56,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:42:56,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:42:56,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:42:56,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:42:56,147 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:42:56,148 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:42:56,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:42:56,148 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:42:56,148 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:42:56,148 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:42:56,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:42:56,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:42:56,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:42:56,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:42:56,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:42:56,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:42:56,149 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:42:56,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:42:56,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:42:56,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:42:56,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:42:56,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:42:56,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:42:56,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:42:56,149 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb567b374acd8bb9754dd21f812a202296c7800faf8be127cd0c1294b076cd75 [2025-03-09 01:42:56,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:42:56,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:42:56,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:42:56,402 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:42:56,402 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:42:56,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2025-03-09 01:42:57,595 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c81d4c9e/3fb65f9e3fc2429cb1a8132c32b2560a/FLAGbd1212cbb [2025-03-09 01:42:57,786 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:42:57,787 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2025-03-09 01:42:57,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c81d4c9e/3fb65f9e3fc2429cb1a8132c32b2560a/FLAGbd1212cbb [2025-03-09 01:42:57,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c81d4c9e/3fb65f9e3fc2429cb1a8132c32b2560a [2025-03-09 01:42:57,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:42:57,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:42:57,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:42:57,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:42:57,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:42:57,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:42:57" (1/1) ... [2025-03-09 01:42:57,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23fbbd16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:42:57, skipping insertion in model container [2025-03-09 01:42:57,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:42:57" (1/1) ... [2025-03-09 01:42:57,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:42:57,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:42:57,914 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:42:57,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:42:57,933 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:42:57,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:42:57 WrapperNode [2025-03-09 01:42:57,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:42:57,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:42:57,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:42:57,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:42:57,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:42:57" (1/1) ... [2025-03-09 01:42:57,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:42:57" (1/1) ... [2025-03-09 01:42:57,954 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2025-03-09 01:42:57,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:42:57,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:42:57,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:42:57,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:42:57,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:42:57" (1/1) ... [2025-03-09 01:42:57,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:42:57" (1/1) ... [2025-03-09 01:42:57,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:42:57" (1/1) ... [2025-03-09 01:42:57,968 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 01:42:57,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:42:57" (1/1) ... [2025-03-09 01:42:57,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:42:57" (1/1) ... [2025-03-09 01:42:57,971 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:42:57" (1/1) ... [2025-03-09 01:42:57,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:42:57" (1/1) ... [2025-03-09 01:42:57,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:42:57" (1/1) ... [2025-03-09 01:42:57,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:42:57" (1/1) ... [2025-03-09 01:42:57,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:42:57,976 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:42:57,976 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:42:57,976 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:42:57,977 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:42:57" (1/1) ... [2025-03-09 01:42:57,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:42:57,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:42:58,005 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) [2025-03-09 01:42:58,007 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 [2025-03-09 01:42:58,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:42:58,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:42:58,070 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:42:58,071 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:42:58,144 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-09 01:42:58,144 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:42:58,150 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:42:58,150 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:42:58,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:42:58 BoogieIcfgContainer [2025-03-09 01:42:58,151 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:42:58,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:42:58,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:42:58,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:42:58,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:42:57" (1/3) ... [2025-03-09 01:42:58,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@554a7d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:42:58, skipping insertion in model container [2025-03-09 01:42:58,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:42:57" (2/3) ... [2025-03-09 01:42:58,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@554a7d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:42:58, skipping insertion in model container [2025-03-09 01:42:58,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:42:58" (3/3) ... [2025-03-09 01:42:58,158 INFO L128 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2025-03-09 01:42:58,169 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:42:58,170 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c that has 1 procedures, 27 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-03-09 01:42:58,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:42:58,217 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;@5c611c6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:42:58,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 01:42:58,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 26 states have internal predecessors, (31), 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) [2025-03-09 01:42:58,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:42:58,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:42:58,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:42:58,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:42:58,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:42:58,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1773989437, now seen corresponding path program 1 times [2025-03-09 01:42:58,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:42:58,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480010061] [2025-03-09 01:42:58,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:42:58,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:42:58,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:42:58,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:42:58,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:42:58,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:42:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:42:58,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:42:58,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480010061] [2025-03-09 01:42:58,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480010061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:42:58,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:42:58,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:42:58,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329790204] [2025-03-09 01:42:58,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:42:58,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:42:58,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:42:58,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:42:58,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:42:58,379 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 26 states have internal predecessors, (31), 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2025-03-09 01:42:58,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:42:58,396 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2025-03-09 01:42:58,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:42:58,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2025-03-09 01:42:58,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:42:58,402 INFO L225 Difference]: With dead ends: 50 [2025-03-09 01:42:58,402 INFO L226 Difference]: Without dead ends: 22 [2025-03-09 01:42:58,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:42:58,405 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:42:58,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:42:58,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-09 01:42:58,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-09 01:42:58,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.6) internal successors, (24), 21 states have internal predecessors, (24), 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) [2025-03-09 01:42:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-03-09 01:42:58,424 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 6 [2025-03-09 01:42:58,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:42:58,424 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-03-09 01:42:58,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2025-03-09 01:42:58,425 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-03-09 01:42:58,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:42:58,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:42:58,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:42:58,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:42:58,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:42:58,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:42:58,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1773989452, now seen corresponding path program 1 times [2025-03-09 01:42:58,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:42:58,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342491744] [2025-03-09 01:42:58,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:42:58,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:42:58,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:42:58,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:42:58,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:42:58,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:42:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:42:58,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:42:58,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342491744] [2025-03-09 01:42:58,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342491744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:42:58,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:42:58,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:42:58,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596115098] [2025-03-09 01:42:58,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:42:58,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:42:58,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:42:58,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:42:58,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:42:58,469 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2025-03-09 01:42:58,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:42:58,486 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-03-09 01:42:58,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:42:58,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2025-03-09 01:42:58,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:42:58,487 INFO L225 Difference]: With dead ends: 30 [2025-03-09 01:42:58,487 INFO L226 Difference]: Without dead ends: 29 [2025-03-09 01:42:58,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:42:58,488 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:42:58,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 35 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:42:58,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-09 01:42:58,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2025-03-09 01:42:58,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 25 states have internal predecessors, (30), 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) [2025-03-09 01:42:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-03-09 01:42:58,491 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 6 [2025-03-09 01:42:58,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:42:58,492 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-03-09 01:42:58,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2025-03-09 01:42:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-03-09 01:42:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 01:42:58,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:42:58,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:42:58,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:42:58,492 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:42:58,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:42:58,493 INFO L85 PathProgramCache]: Analyzing trace with hash -840902312, now seen corresponding path program 1 times [2025-03-09 01:42:58,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:42:58,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499650999] [2025-03-09 01:42:58,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:42:58,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:42:58,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:42:58,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:42:58,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:42:58,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:42:58,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:42:58,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:42:58,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499650999] [2025-03-09 01:42:58,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499650999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:42:58,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:42:58,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:42:58,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192759426] [2025-03-09 01:42:58,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:42:58,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:42:58,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:42:58,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:42:58,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:42:58,526 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2025-03-09 01:42:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:42:58,539 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-03-09 01:42:58,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:42:58,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2025-03-09 01:42:58,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:42:58,540 INFO L225 Difference]: With dead ends: 30 [2025-03-09 01:42:58,540 INFO L226 Difference]: Without dead ends: 29 [2025-03-09 01:42:58,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:42:58,541 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:42:58,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:42:58,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-09 01:42:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-09 01:42:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 28 states have internal predecessors, (34), 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) [2025-03-09 01:42:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-03-09 01:42:58,546 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 7 [2025-03-09 01:42:58,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:42:58,546 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-03-09 01:42:58,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2025-03-09 01:42:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-03-09 01:42:58,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 01:42:58,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:42:58,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:42:58,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:42:58,547 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:42:58,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:42:58,547 INFO L85 PathProgramCache]: Analyzing trace with hash -840901863, now seen corresponding path program 1 times [2025-03-09 01:42:58,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:42:58,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154726142] [2025-03-09 01:42:58,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:42:58,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:42:58,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:42:58,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:42:58,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:42:58,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:42:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:42:58,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:42:58,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154726142] [2025-03-09 01:42:58,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154726142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:42:58,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:42:58,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:42:58,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119890121] [2025-03-09 01:42:58,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:42:58,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:42:58,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:42:58,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:42:58,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:42:58,590 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2025-03-09 01:42:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:42:58,606 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2025-03-09 01:42:58,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:42:58,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2025-03-09 01:42:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:42:58,608 INFO L225 Difference]: With dead ends: 36 [2025-03-09 01:42:58,608 INFO L226 Difference]: Without dead ends: 35 [2025-03-09 01:42:58,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:42:58,609 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:42:58,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:42:58,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-09 01:42:58,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-03-09 01:42:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.5) internal successors, (39), 32 states have internal predecessors, (39), 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) [2025-03-09 01:42:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-03-09 01:42:58,614 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2025-03-09 01:42:58,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:42:58,614 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-03-09 01:42:58,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2025-03-09 01:42:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-03-09 01:42:58,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:42:58,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:42:58,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:42:58,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:42:58,615 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:42:58,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:42:58,615 INFO L85 PathProgramCache]: Analyzing trace with hash -298167910, now seen corresponding path program 1 times [2025-03-09 01:42:58,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:42:58,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917861824] [2025-03-09 01:42:58,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:42:58,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:42:58,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:42:58,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:42:58,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:42:58,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:42:58,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:42:58,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:42:58,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917861824] [2025-03-09 01:42:58,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917861824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:42:58,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:42:58,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:42:58,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865209744] [2025-03-09 01:42:58,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:42:58,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:42:58,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:42:58,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:42:58,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:42:58,650 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2025-03-09 01:42:58,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:42:58,667 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-03-09 01:42:58,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:42:58,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2025-03-09 01:42:58,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:42:58,669 INFO L225 Difference]: With dead ends: 33 [2025-03-09 01:42:58,669 INFO L226 Difference]: Without dead ends: 32 [2025-03-09 01:42:58,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:42:58,670 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:42:58,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 19 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:42:58,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-09 01:42:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-09 01:42:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 31 states have internal predecessors, (38), 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) [2025-03-09 01:42:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-03-09 01:42:58,678 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 8 [2025-03-09 01:42:58,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:42:58,678 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-03-09 01:42:58,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2025-03-09 01:42:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-03-09 01:42:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:42:58,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:42:58,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:42:58,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:42:58,678 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:42:58,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:42:58,679 INFO L85 PathProgramCache]: Analyzing trace with hash -653270634, now seen corresponding path program 1 times [2025-03-09 01:42:58,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:42:58,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556301467] [2025-03-09 01:42:58,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:42:58,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:42:58,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:42:58,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:42:58,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:42:58,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:42:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:42:58,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:42:58,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556301467] [2025-03-09 01:42:58,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556301467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:42:58,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:42:58,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:42:58,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569966033] [2025-03-09 01:42:58,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:42:58,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:42:58,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:42:58,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:42:58,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:42:58,717 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-03-09 01:42:58,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:42:58,731 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-03-09 01:42:58,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:42:58,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2025-03-09 01:42:58,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:42:58,731 INFO L225 Difference]: With dead ends: 32 [2025-03-09 01:42:58,731 INFO L226 Difference]: Without dead ends: 31 [2025-03-09 01:42:58,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:42:58,732 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:42:58,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:42:58,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-09 01:42:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-09 01:42:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 30 states have internal predecessors, (37), 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) [2025-03-09 01:42:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-03-09 01:42:58,740 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 9 [2025-03-09 01:42:58,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:42:58,740 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-09 01:42:58,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-03-09 01:42:58,740 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-03-09 01:42:58,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 01:42:58,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:42:58,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:42:58,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:42:58,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:42:58,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:42:58,741 INFO L85 PathProgramCache]: Analyzing trace with hash -727854636, now seen corresponding path program 1 times [2025-03-09 01:42:58,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:42:58,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121315243] [2025-03-09 01:42:58,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:42:58,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:42:58,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:42:58,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:42:58,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:42:58,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:42:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:42:58,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:42:58,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121315243] [2025-03-09 01:42:58,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121315243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:42:58,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:42:58,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:42:58,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651746895] [2025-03-09 01:42:58,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:42:58,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:42:58,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:42:58,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:42:58,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:42:58,795 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-03-09 01:42:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:42:58,821 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2025-03-09 01:42:58,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:42:58,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) Word has length 11 [2025-03-09 01:42:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:42:58,823 INFO L225 Difference]: With dead ends: 31 [2025-03-09 01:42:58,823 INFO L226 Difference]: Without dead ends: 29 [2025-03-09 01:42:58,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:42:58,825 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:42:58,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 20 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:42:58,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-09 01:42:58,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2025-03-09 01:42:58,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 24 states have internal predecessors, (29), 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) [2025-03-09 01:42:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-09 01:42:58,830 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 11 [2025-03-09 01:42:58,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:42:58,830 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-09 01:42:58,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-03-09 01:42:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-09 01:42:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 01:42:58,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:42:58,831 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:42:58,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:42:58,832 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)] === [2025-03-09 01:42:58,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:42:58,832 INFO L85 PathProgramCache]: Analyzing trace with hash -312916202, now seen corresponding path program 1 times [2025-03-09 01:42:58,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:42:58,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417554881] [2025-03-09 01:42:58,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:42:58,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:42:58,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:42:58,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:42:58,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:42:58,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:42:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:42:58,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:42:58,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417554881] [2025-03-09 01:42:58,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417554881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:42:58,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754262445] [2025-03-09 01:42:58,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:42:58,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:42:58,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:42:58,863 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) [2025-03-09 01:42:58,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:42:58,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:42:58,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:42:58,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:42:58,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:42:58,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:42:58,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:42:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:42:58,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:42:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:42:58,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754262445] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:42:58,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:42:58,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:42:58,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399835213] [2025-03-09 01:42:58,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:42:58,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:42:58,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:42:58,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:42:58,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:42:58,949 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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) [2025-03-09 01:42:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:42:58,983 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2025-03-09 01:42:58,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:42:58,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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) Word has length 11 [2025-03-09 01:42:58,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:42:58,984 INFO L225 Difference]: With dead ends: 46 [2025-03-09 01:42:58,984 INFO L226 Difference]: Without dead ends: 45 [2025-03-09 01:42:58,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:42:58,985 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:42:58,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 51 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:42:58,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-09 01:42:58,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2025-03-09 01:42:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 36 states have internal predecessors, (44), 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) [2025-03-09 01:42:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2025-03-09 01:42:58,993 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 11 [2025-03-09 01:42:58,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:42:58,993 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-03-09 01:42:58,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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) [2025-03-09 01:42:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2025-03-09 01:42:58,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 01:42:58,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:42:58,994 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:42:59,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:42:59,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:42:59,195 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:42:59,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:42:59,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1088657258, now seen corresponding path program 1 times [2025-03-09 01:42:59,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:42:59,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704180389] [2025-03-09 01:42:59,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:42:59,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:42:59,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:42:59,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:42:59,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:42:59,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:42:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:42:59,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:42:59,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704180389] [2025-03-09 01:42:59,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704180389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:42:59,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:42:59,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:42:59,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234142852] [2025-03-09 01:42:59,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:42:59,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:42:59,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:42:59,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:42:59,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:42:59,232 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2025-03-09 01:42:59,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:42:59,261 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2025-03-09 01:42:59,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:42:59,261 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), 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) Word has length 12 [2025-03-09 01:42:59,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:42:59,262 INFO L225 Difference]: With dead ends: 53 [2025-03-09 01:42:59,262 INFO L226 Difference]: Without dead ends: 51 [2025-03-09 01:42:59,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:42:59,262 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:42:59,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 30 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:42:59,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-09 01:42:59,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2025-03-09 01:42:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.288888888888889) internal successors, (58), 47 states have internal predecessors, (58), 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) [2025-03-09 01:42:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2025-03-09 01:42:59,281 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 12 [2025-03-09 01:42:59,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:42:59,281 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2025-03-09 01:42:59,281 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), 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) [2025-03-09 01:42:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2025-03-09 01:42:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 01:42:59,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:42:59,282 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:42:59,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:42:59,282 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:42:59,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:42:59,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1773243559, now seen corresponding path program 1 times [2025-03-09 01:42:59,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:42:59,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914991245] [2025-03-09 01:42:59,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:42:59,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:42:59,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:42:59,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:42:59,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:42:59,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:42:59,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:42:59,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:42:59,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914991245] [2025-03-09 01:42:59,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914991245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:42:59,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065175888] [2025-03-09 01:42:59,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:42:59,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:42:59,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:42:59,340 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) [2025-03-09 01:42:59,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:42:59,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:42:59,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:42:59,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:42:59,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:42:59,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:42:59,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:42:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:42:59,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:42:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:42:59,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065175888] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:42:59,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:42:59,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:42:59,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902949997] [2025-03-09 01:42:59,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:42:59,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:42:59,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:42:59,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:42:59,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:42:59,454 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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) [2025-03-09 01:42:59,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:42:59,485 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2025-03-09 01:42:59,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:42:59,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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) Word has length 14 [2025-03-09 01:42:59,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:42:59,486 INFO L225 Difference]: With dead ends: 106 [2025-03-09 01:42:59,486 INFO L226 Difference]: Without dead ends: 105 [2025-03-09 01:42:59,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:42:59,488 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 60 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 [2025-03-09 01:42:59,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 60 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:42:59,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-09 01:42:59,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2025-03-09 01:42:59,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 99 states have (on average 1.2828282828282829) internal successors, (127), 101 states have internal predecessors, (127), 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) [2025-03-09 01:42:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2025-03-09 01:42:59,503 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 127 transitions. Word has length 14 [2025-03-09 01:42:59,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:42:59,503 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 127 transitions. [2025-03-09 01:42:59,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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) [2025-03-09 01:42:59,503 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2025-03-09 01:42:59,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:42:59,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:42:59,504 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:42:59,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:42:59,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-09 01:42:59,704 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:42:59,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:42:59,705 INFO L85 PathProgramCache]: Analyzing trace with hash -790039879, now seen corresponding path program 1 times [2025-03-09 01:42:59,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:42:59,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010731881] [2025-03-09 01:42:59,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:42:59,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:42:59,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:42:59,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:42:59,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:42:59,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:42:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:42:59,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:42:59,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010731881] [2025-03-09 01:42:59,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010731881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:42:59,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:42:59,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:42:59,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702783892] [2025-03-09 01:42:59,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:42:59,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:42:59,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:42:59,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:42:59,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:42:59,730 INFO L87 Difference]: Start difference. First operand 102 states and 127 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2025-03-09 01:42:59,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:42:59,752 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2025-03-09 01:42:59,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:42:59,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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) Word has length 16 [2025-03-09 01:42:59,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:42:59,753 INFO L225 Difference]: With dead ends: 102 [2025-03-09 01:42:59,753 INFO L226 Difference]: Without dead ends: 101 [2025-03-09 01:42:59,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:42:59,754 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:42:59,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 23 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:42:59,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-09 01:42:59,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2025-03-09 01:42:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 92 states have internal predecessors, (115), 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) [2025-03-09 01:42:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2025-03-09 01:42:59,763 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 16 [2025-03-09 01:42:59,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:42:59,763 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2025-03-09 01:42:59,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2025-03-09 01:42:59,763 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2025-03-09 01:42:59,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 01:42:59,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:42:59,765 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:42:59,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:42:59,765 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:42:59,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:42:59,765 INFO L85 PathProgramCache]: Analyzing trace with hash -935195, now seen corresponding path program 1 times [2025-03-09 01:42:59,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:42:59,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498904278] [2025-03-09 01:42:59,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:42:59,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:42:59,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:42:59,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:42:59,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:42:59,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:42:59,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:42:59,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:42:59,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498904278] [2025-03-09 01:42:59,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498904278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:42:59,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490534877] [2025-03-09 01:42:59,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:42:59,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:42:59,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:42:59,798 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) [2025-03-09 01:42:59,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:42:59,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:42:59,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:42:59,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:42:59,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:42:59,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:42:59,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:42:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:42:59,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:42:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:42:59,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490534877] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:42:59,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:42:59,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2025-03-09 01:42:59,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307113400] [2025-03-09 01:42:59,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:42:59,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:42:59,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:42:59,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:42:59,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:42:59,889 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 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) [2025-03-09 01:42:59,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:42:59,977 INFO L93 Difference]: Finished difference Result 157 states and 190 transitions. [2025-03-09 01:42:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:42:59,978 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 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) Word has length 18 [2025-03-09 01:42:59,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:42:59,978 INFO L225 Difference]: With dead ends: 157 [2025-03-09 01:42:59,978 INFO L226 Difference]: Without dead ends: 156 [2025-03-09 01:42:59,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:42:59,979 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:42:59,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 56 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:42:59,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-09 01:42:59,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 127. [2025-03-09 01:42:59,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 125 states have (on average 1.256) internal successors, (157), 126 states have internal predecessors, (157), 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) [2025-03-09 01:42:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 157 transitions. [2025-03-09 01:42:59,987 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 157 transitions. Word has length 18 [2025-03-09 01:42:59,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:42:59,987 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 157 transitions. [2025-03-09 01:42:59,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 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) [2025-03-09 01:42:59,987 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 157 transitions. [2025-03-09 01:42:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 01:42:59,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:42:59,988 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:42:59,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:43:00,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:43:00,189 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:43:00,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:43:00,189 INFO L85 PathProgramCache]: Analyzing trace with hash -950184473, now seen corresponding path program 1 times [2025-03-09 01:43:00,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:43:00,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924293179] [2025-03-09 01:43:00,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:43:00,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:43:00,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:43:00,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:43:00,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:43:00,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:43:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:43:00,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:43:00,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924293179] [2025-03-09 01:43:00,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924293179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:43:00,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522928016] [2025-03-09 01:43:00,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:43:00,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:43:00,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:43:00,234 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) [2025-03-09 01:43:00,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:43:00,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:43:00,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:43:00,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:43:00,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:43:00,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:43:00,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:43:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:43:00,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:43:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:43:00,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522928016] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:43:00,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:43:00,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-09 01:43:00,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897446911] [2025-03-09 01:43:00,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:43:00,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:43:00,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:43:00,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:43:00,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:43:00,291 INFO L87 Difference]: Start difference. First operand 127 states and 157 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2025-03-09 01:43:00,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:43:00,322 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2025-03-09 01:43:00,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:43:00,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) Word has length 23 [2025-03-09 01:43:00,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:43:00,323 INFO L225 Difference]: With dead ends: 211 [2025-03-09 01:43:00,323 INFO L226 Difference]: Without dead ends: 123 [2025-03-09 01:43:00,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:43:00,324 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:43:00,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 64 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:43:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-09 01:43:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-03-09 01:43:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 121 states have (on average 1.2314049586776858) internal successors, (149), 122 states have internal predecessors, (149), 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) [2025-03-09 01:43:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2025-03-09 01:43:00,334 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 23 [2025-03-09 01:43:00,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:43:00,335 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2025-03-09 01:43:00,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2025-03-09 01:43:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2025-03-09 01:43:00,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 01:43:00,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:43:00,338 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:43:00,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:43:00,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:43:00,539 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:43:00,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:43:00,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2050449496, now seen corresponding path program 1 times [2025-03-09 01:43:00,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:43:00,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219615753] [2025-03-09 01:43:00,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:43:00,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:43:00,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:43:00,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:43:00,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:43:00,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:43:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:43:00,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:43:00,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219615753] [2025-03-09 01:43:00,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219615753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:43:00,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025773154] [2025-03-09 01:43:00,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:43:00,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:43:00,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:43:00,614 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) [2025-03-09 01:43:00,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:43:00,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:43:00,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:43:00,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:43:00,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:43:00,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:43:00,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:43:00,663 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:43:00,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:43:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:43:00,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025773154] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:43:00,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:43:00,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-09 01:43:00,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598205822] [2025-03-09 01:43:00,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:43:00,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:43:00,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:43:00,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:43:00,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:43:00,716 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 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) [2025-03-09 01:43:00,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:43:00,785 INFO L93 Difference]: Finished difference Result 298 states and 357 transitions. [2025-03-09 01:43:00,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:43:00,785 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 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) Word has length 24 [2025-03-09 01:43:00,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:43:00,786 INFO L225 Difference]: With dead ends: 298 [2025-03-09 01:43:00,786 INFO L226 Difference]: Without dead ends: 297 [2025-03-09 01:43:00,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:43:00,787 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:43:00,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 70 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:43:00,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-09 01:43:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 247. [2025-03-09 01:43:00,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 245 states have (on average 1.220408163265306) internal successors, (299), 246 states have internal predecessors, (299), 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) [2025-03-09 01:43:00,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 299 transitions. [2025-03-09 01:43:00,799 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 299 transitions. Word has length 24 [2025-03-09 01:43:00,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:43:00,799 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 299 transitions. [2025-03-09 01:43:00,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 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) [2025-03-09 01:43:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 299 transitions. [2025-03-09 01:43:00,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 01:43:00,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:43:00,800 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-09 01:43:00,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:43:01,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-09 01:43:01,004 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:43:01,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:43:01,004 INFO L85 PathProgramCache]: Analyzing trace with hash 629232536, now seen corresponding path program 2 times [2025-03-09 01:43:01,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:43:01,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248166719] [2025-03-09 01:43:01,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:43:01,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:43:01,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-09 01:43:01,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 35 statements. [2025-03-09 01:43:01,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:43:01,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:43:01,024 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-09 01:43:01,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:43:01,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248166719] [2025-03-09 01:43:01,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248166719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:43:01,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097920569] [2025-03-09 01:43:01,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:43:01,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:43:01,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:43:01,026 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) [2025-03-09 01:43:01,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:43:01,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-09 01:43:01,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 35 statements. [2025-03-09 01:43:01,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:43:01,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:43:01,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:43:01,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:43:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-09 01:43:01,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:43:01,126 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-09 01:43:01,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097920569] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:43:01,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:43:01,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-09 01:43:01,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933525947] [2025-03-09 01:43:01,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:43:01,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:43:01,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:43:01,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:43:01,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:43:01,127 INFO L87 Difference]: Start difference. First operand 247 states and 299 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2025-03-09 01:43:01,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:43:01,148 INFO L93 Difference]: Finished difference Result 247 states and 299 transitions. [2025-03-09 01:43:01,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:43:01,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) Word has length 35 [2025-03-09 01:43:01,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:43:01,150 INFO L225 Difference]: With dead ends: 247 [2025-03-09 01:43:01,150 INFO L226 Difference]: Without dead ends: 246 [2025-03-09 01:43:01,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:43:01,151 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:43:01,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 26 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:43:01,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-09 01:43:01,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 77. [2025-03-09 01:43:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 76 states have internal predecessors, (89), 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) [2025-03-09 01:43:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2025-03-09 01:43:01,159 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 35 [2025-03-09 01:43:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:43:01,159 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2025-03-09 01:43:01,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2025-03-09 01:43:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2025-03-09 01:43:01,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 01:43:01,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:43:01,160 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:43:01,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:43:01,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 01:43:01,364 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:43:01,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:43:01,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1823665624, now seen corresponding path program 2 times [2025-03-09 01:43:01,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:43:01,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188449519] [2025-03-09 01:43:01,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:43:01,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:43:01,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-09 01:43:01,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:43:01,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:43:01,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:43:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:43:01,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:43:01,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188449519] [2025-03-09 01:43:01,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188449519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:43:01,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602633506] [2025-03-09 01:43:01,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:43:01,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:43:01,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:43:01,479 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) [2025-03-09 01:43:01,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:43:01,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-09 01:43:01,509 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:43:01,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:43:01,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:43:01,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:43:01,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:43:01,555 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:43:01,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:43:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:43:01,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602633506] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:43:01,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:43:01,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-03-09 01:43:01,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660200092] [2025-03-09 01:43:01,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:43:01,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:43:01,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:43:01,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:43:01,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:43:01,691 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 20 states have internal predecessors, (86), 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) [2025-03-09 01:43:01,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:43:01,797 INFO L93 Difference]: Finished difference Result 214 states and 252 transitions. [2025-03-09 01:43:01,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 01:43:01,797 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 20 states have internal predecessors, (86), 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) Word has length 44 [2025-03-09 01:43:01,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:43:01,798 INFO L225 Difference]: With dead ends: 214 [2025-03-09 01:43:01,798 INFO L226 Difference]: Without dead ends: 213 [2025-03-09 01:43:01,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:43:01,799 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:43:01,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 95 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:43:01,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-09 01:43:01,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 117. [2025-03-09 01:43:01,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 116 states have internal predecessors, (137), 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) [2025-03-09 01:43:01,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2025-03-09 01:43:01,806 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 44 [2025-03-09 01:43:01,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:43:01,806 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2025-03-09 01:43:01,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 20 states have internal predecessors, (86), 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) [2025-03-09 01:43:01,807 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2025-03-09 01:43:01,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 01:43:01,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:43:01,807 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 01:43:01,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:43:02,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:43:02,008 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:43:02,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:43:02,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1849255756, now seen corresponding path program 2 times [2025-03-09 01:43:02,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:43:02,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842062224] [2025-03-09 01:43:02,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:43:02,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:43:02,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-09 01:43:02,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 01:43:02,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:43:02,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:43:02,053 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:43:02,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:43:02,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842062224] [2025-03-09 01:43:02,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842062224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:43:02,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:43:02,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:43:02,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398960836] [2025-03-09 01:43:02,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:43:02,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:43:02,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:43:02,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:43:02,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:43:02,055 INFO L87 Difference]: Start difference. First operand 117 states and 137 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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) [2025-03-09 01:43:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:43:02,096 INFO L93 Difference]: Finished difference Result 271 states and 323 transitions. [2025-03-09 01:43:02,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:43:02,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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) Word has length 46 [2025-03-09 01:43:02,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:43:02,097 INFO L225 Difference]: With dead ends: 271 [2025-03-09 01:43:02,097 INFO L226 Difference]: Without dead ends: 170 [2025-03-09 01:43:02,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:43:02,098 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:43:02,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 37 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:43:02,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-09 01:43:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 134. [2025-03-09 01:43:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.1578947368421053) internal successors, (154), 133 states have internal predecessors, (154), 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) [2025-03-09 01:43:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2025-03-09 01:43:02,107 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 46 [2025-03-09 01:43:02,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:43:02,107 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2025-03-09 01:43:02,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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) [2025-03-09 01:43:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2025-03-09 01:43:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-09 01:43:02,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:43:02,108 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:43:02,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:43:02,108 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:43:02,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:43:02,109 INFO L85 PathProgramCache]: Analyzing trace with hash -331885862, now seen corresponding path program 3 times [2025-03-09 01:43:02,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:43:02,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146091563] [2025-03-09 01:43:02,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:43:02,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:43:02,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-03-09 01:43:02,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 52 statements. [2025-03-09 01:43:02,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:43:02,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:43:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:43:02,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:43:02,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146091563] [2025-03-09 01:43:02,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146091563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:43:02,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498937968] [2025-03-09 01:43:02,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:43:02,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:43:02,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:43:02,140 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) [2025-03-09 01:43:02,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:43:02,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-03-09 01:43:02,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 52 statements. [2025-03-09 01:43:02,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:43:02,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:43:02,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:43:02,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:43:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:43:02,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:43:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:43:02,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498937968] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:43:02,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:43:02,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-03-09 01:43:02,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81580764] [2025-03-09 01:43:02,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:43:02,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:43:02,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:43:02,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:43:02,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:43:02,267 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2025-03-09 01:43:02,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:43:02,306 INFO L93 Difference]: Finished difference Result 171 states and 195 transitions. [2025-03-09 01:43:02,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:43:02,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) Word has length 52 [2025-03-09 01:43:02,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:43:02,307 INFO L225 Difference]: With dead ends: 171 [2025-03-09 01:43:02,307 INFO L226 Difference]: Without dead ends: 90 [2025-03-09 01:43:02,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:43:02,307 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:43:02,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 24 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:43:02,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-09 01:43:02,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-09 01:43:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.0224719101123596) internal successors, (91), 89 states have internal predecessors, (91), 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) [2025-03-09 01:43:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2025-03-09 01:43:02,312 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 52 [2025-03-09 01:43:02,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:43:02,312 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2025-03-09 01:43:02,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2025-03-09 01:43:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2025-03-09 01:43:02,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-09 01:43:02,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:43:02,313 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:43:02,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:43:02,513 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,SelfDestructingSolverStorable17 [2025-03-09 01:43:02,514 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 01:43:02,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:43:02,514 INFO L85 PathProgramCache]: Analyzing trace with hash -44091608, now seen corresponding path program 3 times [2025-03-09 01:43:02,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:43:02,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645008228] [2025-03-09 01:43:02,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:43:02,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:43:02,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 84 statements into 16 equivalence classes. [2025-03-09 01:43:02,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 84 statements. [2025-03-09 01:43:02,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:43:02,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:43:02,568 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2025-03-09 01:43:02,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:43:02,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645008228] [2025-03-09 01:43:02,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645008228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:43:02,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085046922] [2025-03-09 01:43:02,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:43:02,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:43:02,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:43:02,570 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) [2025-03-09 01:43:02,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:43:02,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 84 statements into 16 equivalence classes. [2025-03-09 01:43:02,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 84 statements. [2025-03-09 01:43:02,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:43:02,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:43:02,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:43:02,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:43:02,670 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2025-03-09 01:43:02,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:43:02,754 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2025-03-09 01:43:02,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085046922] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:43:02,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:43:02,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-09 01:43:02,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964226159] [2025-03-09 01:43:02,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:43:02,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:43:02,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:43:02,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:43:02,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:43:02,756 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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) [2025-03-09 01:43:02,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:43:02,786 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2025-03-09 01:43:02,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:43:02,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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) Word has length 84 [2025-03-09 01:43:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:43:02,786 INFO L225 Difference]: With dead ends: 90 [2025-03-09 01:43:02,787 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:43:02,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 164 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:43:02,788 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:43:02,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 13 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:43:02,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:43:02,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:43:02,788 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) [2025-03-09 01:43:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:43:02,789 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2025-03-09 01:43:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:43:02,789 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:43:02,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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) [2025-03-09 01:43:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:43:02,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:43:02,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-09 01:43:02,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-09 01:43:02,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-09 01:43:02,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-09 01:43:02,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-09 01:43:02,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-09 01:43:02,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-09 01:43:02,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-09 01:43:02,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 01:43:02,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:43:02,995 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:43:02,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:43:04,386 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:43:04,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:43:04 BoogieIcfgContainer [2025-03-09 01:43:04,400 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:43:04,401 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:43:04,401 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:43:04,401 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:43:04,401 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:42:58" (3/4) ... [2025-03-09 01:43:04,403 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:43:04,408 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-09 01:43:04,408 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:43:04,408 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-09 01:43:04,465 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:43:04,465 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:43:04,465 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:43:04,465 INFO L158 Benchmark]: Toolchain (without parser) took 6661.31ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 123.9MB in the beginning and 174.2MB in the end (delta: -50.3MB). Peak memory consumption was 192.4MB. Max. memory is 16.1GB. [2025-03-09 01:43:04,466 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:43:04,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 128.89ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 114.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:43:04,466 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.69ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 112.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:43:04,466 INFO L158 Benchmark]: Boogie Preprocessor took 19.37ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 111.8MB in the end (delta: 811.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:43:04,466 INFO L158 Benchmark]: IcfgBuilder took 174.90ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 99.9MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:43:04,466 INFO L158 Benchmark]: TraceAbstraction took 6248.00ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 99.9MB in the beginning and 182.2MB in the end (delta: -82.2MB). Peak memory consumption was 201.2MB. Max. memory is 16.1GB. [2025-03-09 01:43:04,466 INFO L158 Benchmark]: Witness Printer took 64.30ms. Allocated memory is still 411.0MB. Free memory was 182.2MB in the beginning and 174.2MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:43:04,467 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.26ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 128.89ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 114.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.69ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 112.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.37ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 111.8MB in the end (delta: 811.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 174.90ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 99.9MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6248.00ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 99.9MB in the beginning and 182.2MB in the end (delta: -82.2MB). Peak memory consumption was 201.2MB. Max. memory is 16.1GB. * Witness Printer took 64.30ms. Allocated memory is still 411.0MB. Free memory was 182.2MB in the beginning and 174.2MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. 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: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: 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 1 procedures, 27 locations, 31 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 19, TraceHistogramMax: 15, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 204 mSDsluCounter, 750 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 479 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 596 IncrementalHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 271 mSDtfsCounter, 596 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 676 GetRequests, 581 SyntacticMatches, 9 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=14, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 411 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 738 NumberOfCodeBlocks, 484 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1006 ConstructedInterpolants, 0 QuantifiedInterpolants, 2742 SizeOfPredicates, 9 NumberOfNonLiveVariables, 420 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 37 InterpolantComputations, 10 PerfectInterpolantSequences, 1685/2389 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 25]: Location Invariant Derived location invariant: (((((((((n <= 2147483647) && (N <= ((long) i + 1))) && (i <= 2147483646)) && (0 <= j)) && (0 <= i)) && (0 <= N)) && (m <= 2147483647)) || (((((((n <= 2147483647) && (i <= 2147483645)) && (0 <= i)) && (m <= 0)) && (0 <= N)) && (j == 0)) && (N <= 2147483647))) || ((((((n <= 2147483647) && (i == 0)) && (0 <= N)) && (j == 0)) && (N <= 2147483647)) && (m <= 2147483647))) - InvariantResult [Line: 28]: Location Invariant Derived location invariant: (((((((0 <= k) && (n <= 2147483647)) && (0 <= j)) && (k <= 2147483646)) && (0 <= N)) && (N <= 2147483647)) && (m <= 2147483647)) - InvariantResult [Line: 23]: Location Invariant Derived location invariant: (((((((n <= 2147483647) && (i == 0)) && (0 <= N)) && (N <= 2147483647)) && (m <= 2147483647)) || (((((n <= 2147483647) && (N <= i)) && (0 <= N)) && (N <= 2147483647)) && (m <= 2147483647))) || (((((n <= 2147483647) && (0 <= i)) && (m <= 0)) && (0 <= N)) && (N <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2025-03-09 01:43:04,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE