./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_15_good.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 131043465e58b0b890db86b864c461ed2bbbfe197b7b02d72230e35ccaa6fcdf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 04:42:34,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 04:42:34,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 04:42:34,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 04:42:34,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 04:42:34,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 04:42:34,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 04:42:34,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 04:42:34,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 04:42:34,767 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 04:42:34,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 04:42:34,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 04:42:34,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 04:42:34,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 04:42:34,768 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 04:42:34,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 04:42:34,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 04:42:34,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 04:42:34,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 04:42:34,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 04:42:34,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 04:42:34,768 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 04:42:34,768 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 04:42:34,768 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 04:42:34,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 04:42:34,768 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 04:42:34,768 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 04:42:34,768 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 04:42:34,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 04:42:34,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 04:42:34,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 04:42:34,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:42:34,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 04:42:34,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 04:42:34,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 04:42:34,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 04:42:34,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:42:34,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 04:42:34,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 04:42:34,769 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 04:42:34,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 04:42:34,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 04:42:34,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 04:42:34,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 04:42:34,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 04:42:34,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 04:42:34,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 04:42:34,769 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-jdk21/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 -> 131043465e58b0b890db86b864c461ed2bbbfe197b7b02d72230e35ccaa6fcdf [2025-01-10 04:42:34,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 04:42:35,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 04:42:35,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 04:42:35,004 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 04:42:35,004 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 04:42:35,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_15_good.i [2025-01-10 04:42:36,164 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a991b0fbb/048d68ca2c91429d8d04081b7ccf1374/FLAG752e87128 [2025-01-10 04:42:36,558 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 04:42:36,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_15_good.i [2025-01-10 04:42:36,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a991b0fbb/048d68ca2c91429d8d04081b7ccf1374/FLAG752e87128 [2025-01-10 04:42:36,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a991b0fbb/048d68ca2c91429d8d04081b7ccf1374 [2025-01-10 04:42:36,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 04:42:36,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 04:42:36,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 04:42:36,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 04:42:36,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 04:42:36,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:42:36" (1/1) ... [2025-01-10 04:42:36,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1397687a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:36, skipping insertion in model container [2025-01-10 04:42:36,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:42:36" (1/1) ... [2025-01-10 04:42:36,784 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 04:42:37,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 04:42:37,272 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 04:42:37,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 04:42:37,426 INFO L204 MainTranslator]: Completed translation [2025-01-10 04:42:37,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:37 WrapperNode [2025-01-10 04:42:37,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 04:42:37,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 04:42:37,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 04:42:37,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 04:42:37,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:37" (1/1) ... [2025-01-10 04:42:37,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:37" (1/1) ... [2025-01-10 04:42:37,471 INFO L138 Inliner]: procedures = 501, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 297 [2025-01-10 04:42:37,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 04:42:37,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 04:42:37,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 04:42:37,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 04:42:37,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:37" (1/1) ... [2025-01-10 04:42:37,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:37" (1/1) ... [2025-01-10 04:42:37,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:37" (1/1) ... [2025-01-10 04:42:37,497 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 04:42:37,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:37" (1/1) ... [2025-01-10 04:42:37,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:37" (1/1) ... [2025-01-10 04:42:37,503 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:37" (1/1) ... [2025-01-10 04:42:37,504 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:37" (1/1) ... [2025-01-10 04:42:37,507 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:37" (1/1) ... [2025-01-10 04:42:37,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:37" (1/1) ... [2025-01-10 04:42:37,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:37" (1/1) ... [2025-01-10 04:42:37,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 04:42:37,512 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 04:42:37,512 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 04:42:37,512 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 04:42:37,513 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:37" (1/1) ... [2025-01-10 04:42:37,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:42:37,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 04:42:37,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 04:42:37,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 04:42:37,565 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-01-10 04:42:37,565 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-01-10 04:42:37,565 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 04:42:37,565 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 04:42:37,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 04:42:37,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 04:42:37,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 04:42:37,663 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 04:42:37,664 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 04:42:37,978 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2025-01-10 04:42:37,982 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 04:42:37,989 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 04:42:37,990 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 04:42:37,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:42:37 BoogieIcfgContainer [2025-01-10 04:42:37,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 04:42:37,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 04:42:37,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 04:42:37,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 04:42:37,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 04:42:36" (1/3) ... [2025-01-10 04:42:37,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ae312b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:42:37, skipping insertion in model container [2025-01-10 04:42:37,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:42:37" (2/3) ... [2025-01-10 04:42:37,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ae312b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:42:37, skipping insertion in model container [2025-01-10 04:42:37,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:42:37" (3/3) ... [2025-01-10 04:42:37,997 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_15_good.i [2025-01-10 04:42:38,007 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 04:42:38,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_rand_multiply_15_good.i that has 3 procedures, 129 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-01-10 04:42:38,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 04:42:38,056 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;@4baa6729, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 04:42:38,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 04:42:38,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 102 states have (on average 1.5588235294117647) internal successors, (159), 120 states have internal predecessors, (159), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 04:42:38,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 04:42:38,065 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:42:38,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:42:38,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:42:38,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:42:38,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1354801184, now seen corresponding path program 1 times [2025-01-10 04:42:38,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:42:38,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563877371] [2025-01-10 04:42:38,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:42:38,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:42:38,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 04:42:38,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 04:42:38,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:42:38,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:42:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:42:38,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:42:38,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563877371] [2025-01-10 04:42:38,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563877371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:42:38,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:42:38,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:42:38,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655581942] [2025-01-10 04:42:38,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:42:38,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:42:38,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:42:38,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:42:38,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:42:38,297 INFO L87 Difference]: Start difference. First operand has 129 states, 102 states have (on average 1.5588235294117647) internal successors, (159), 120 states have internal predecessors, (159), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:38,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:42:38,337 INFO L93 Difference]: Finished difference Result 229 states and 336 transitions. [2025-01-10 04:42:38,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:42:38,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 04:42:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:42:38,345 INFO L225 Difference]: With dead ends: 229 [2025-01-10 04:42:38,346 INFO L226 Difference]: Without dead ends: 115 [2025-01-10 04:42:38,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 04:42:38,352 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:42:38,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 367 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:42:38,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-10 04:42:38,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-01-10 04:42:38,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.5483870967741935) internal successors, (144), 108 states have internal predecessors, (144), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 04:42:38,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2025-01-10 04:42:38,395 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 16 [2025-01-10 04:42:38,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:42:38,396 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2025-01-10 04:42:38,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2025-01-10 04:42:38,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 04:42:38,397 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:42:38,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:42:38,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 04:42:38,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:42:38,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:42:38,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1978115129, now seen corresponding path program 1 times [2025-01-10 04:42:38,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:42:38,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721292029] [2025-01-10 04:42:38,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:42:38,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:42:38,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 04:42:38,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 04:42:38,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:42:38,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:42:38,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:42:38,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:42:38,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721292029] [2025-01-10 04:42:38,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721292029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:42:38,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:42:38,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:42:38,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165319172] [2025-01-10 04:42:38,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:42:38,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:42:38,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:42:38,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:42:38,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:42:38,509 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:42:38,536 INFO L93 Difference]: Finished difference Result 115 states and 168 transitions. [2025-01-10 04:42:38,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:42:38,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-01-10 04:42:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:42:38,538 INFO L225 Difference]: With dead ends: 115 [2025-01-10 04:42:38,538 INFO L226 Difference]: Without dead ends: 114 [2025-01-10 04:42:38,538 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-01-10 04:42:38,539 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 1 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:42:38,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 319 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:42:38,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-10 04:42:38,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-01-10 04:42:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.5376344086021505) internal successors, (143), 107 states have internal predecessors, (143), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 04:42:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 167 transitions. [2025-01-10 04:42:38,548 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 167 transitions. Word has length 21 [2025-01-10 04:42:38,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:42:38,549 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 167 transitions. [2025-01-10 04:42:38,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 167 transitions. [2025-01-10 04:42:38,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 04:42:38,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:42:38,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:42:38,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 04:42:38,549 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:42:38,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:42:38,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1192027010, now seen corresponding path program 1 times [2025-01-10 04:42:38,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:42:38,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371419870] [2025-01-10 04:42:38,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:42:38,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:42:38,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 04:42:38,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 04:42:38,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:42:38,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:42:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:42:38,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:42:38,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371419870] [2025-01-10 04:42:38,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371419870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:42:38,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:42:38,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:42:38,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953339100] [2025-01-10 04:42:38,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:42:38,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:42:38,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:42:38,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:42:38,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:42:38,621 INFO L87 Difference]: Start difference. First operand 114 states and 167 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:38,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:42:38,650 INFO L93 Difference]: Finished difference Result 114 states and 167 transitions. [2025-01-10 04:42:38,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:42:38,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-10 04:42:38,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:42:38,651 INFO L225 Difference]: With dead ends: 114 [2025-01-10 04:42:38,651 INFO L226 Difference]: Without dead ends: 113 [2025-01-10 04:42:38,652 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-01-10 04:42:38,652 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 35 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 286 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-01-10 04:42:38,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 286 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:42:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-10 04:42:38,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-01-10 04:42:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 106 states have internal predecessors, (142), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 04:42:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 166 transitions. [2025-01-10 04:42:38,658 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 166 transitions. Word has length 22 [2025-01-10 04:42:38,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:42:38,658 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 166 transitions. [2025-01-10 04:42:38,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 166 transitions. [2025-01-10 04:42:38,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 04:42:38,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:42:38,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:42:38,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 04:42:38,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:42:38,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:42:38,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1885279249, now seen corresponding path program 1 times [2025-01-10 04:42:38,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:42:38,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001962638] [2025-01-10 04:42:38,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:42:38,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:42:38,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 04:42:38,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 04:42:38,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:42:38,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:42:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:42:38,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:42:38,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001962638] [2025-01-10 04:42:38,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001962638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:42:38,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:42:38,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:42:38,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600880458] [2025-01-10 04:42:38,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:42:38,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:42:38,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:42:38,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:42:38,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:42:38,719 INFO L87 Difference]: Start difference. First operand 113 states and 166 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:42:38,735 INFO L93 Difference]: Finished difference Result 188 states and 273 transitions. [2025-01-10 04:42:38,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:42:38,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-01-10 04:42:38,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:42:38,738 INFO L225 Difference]: With dead ends: 188 [2025-01-10 04:42:38,738 INFO L226 Difference]: Without dead ends: 113 [2025-01-10 04:42:38,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 04:42:38,739 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 322 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-01-10 04:42:38,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 322 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:42:38,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-10 04:42:38,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-01-10 04:42:38,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 93 states have (on average 1.5161290322580645) internal successors, (141), 106 states have internal predecessors, (141), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 04:42:38,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2025-01-10 04:42:38,745 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 27 [2025-01-10 04:42:38,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:42:38,745 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2025-01-10 04:42:38,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:38,745 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2025-01-10 04:42:38,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 04:42:38,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:42:38,746 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:42:38,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 04:42:38,746 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:42:38,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:42:38,747 INFO L85 PathProgramCache]: Analyzing trace with hash 535508125, now seen corresponding path program 1 times [2025-01-10 04:42:38,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:42:38,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946359849] [2025-01-10 04:42:38,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:42:38,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:42:38,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 04:42:38,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 04:42:38,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:42:38,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:42:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:42:38,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:42:38,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946359849] [2025-01-10 04:42:38,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946359849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:42:38,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:42:38,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:42:38,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431668653] [2025-01-10 04:42:38,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:42:38,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:42:38,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:42:38,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:42:38,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:42:38,800 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:38,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:42:38,812 INFO L93 Difference]: Finished difference Result 161 states and 229 transitions. [2025-01-10 04:42:38,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:42:38,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-01-10 04:42:38,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:42:38,813 INFO L225 Difference]: With dead ends: 161 [2025-01-10 04:42:38,813 INFO L226 Difference]: Without dead ends: 111 [2025-01-10 04:42:38,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 04:42:38,814 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:42:38,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:42:38,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-10 04:42:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-01-10 04:42:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 92 states have (on average 1.5) internal successors, (138), 104 states have internal predecessors, (138), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 04:42:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2025-01-10 04:42:38,819 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 28 [2025-01-10 04:42:38,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:42:38,819 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2025-01-10 04:42:38,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:38,820 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2025-01-10 04:42:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-10 04:42:38,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:42:38,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:42:38,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 04:42:38,821 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:42:38,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:42:38,821 INFO L85 PathProgramCache]: Analyzing trace with hash 811821624, now seen corresponding path program 1 times [2025-01-10 04:42:38,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:42:38,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506852976] [2025-01-10 04:42:38,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:42:38,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:42:38,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 04:42:38,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 04:42:38,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:42:38,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:42:38,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:42:38,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:42:38,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506852976] [2025-01-10 04:42:38,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506852976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:42:38,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:42:38,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:42:38,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589361414] [2025-01-10 04:42:38,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:42:38,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:42:38,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:42:38,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:42:38,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:42:38,900 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:42:38,918 INFO L93 Difference]: Finished difference Result 111 states and 160 transitions. [2025-01-10 04:42:38,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:42:38,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-01-10 04:42:38,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:42:38,920 INFO L225 Difference]: With dead ends: 111 [2025-01-10 04:42:38,920 INFO L226 Difference]: Without dead ends: 110 [2025-01-10 04:42:38,920 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-01-10 04:42:38,921 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:42:38,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 303 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:42:38,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-10 04:42:38,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-10 04:42:38,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 103 states have internal predecessors, (137), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 04:42:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2025-01-10 04:42:38,930 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 33 [2025-01-10 04:42:38,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:42:38,930 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2025-01-10 04:42:38,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:38,930 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2025-01-10 04:42:38,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 04:42:38,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:42:38,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:42:38,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 04:42:38,931 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-01-10 04:42:38,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:42:38,932 INFO L85 PathProgramCache]: Analyzing trace with hash -603333157, now seen corresponding path program 1 times [2025-01-10 04:42:38,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:42:38,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547526705] [2025-01-10 04:42:38,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:42:38,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:42:38,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 04:42:38,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 04:42:38,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:42:38,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:42:38,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:42:38,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:42:38,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547526705] [2025-01-10 04:42:38,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547526705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:42:38,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:42:38,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:42:38,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899353115] [2025-01-10 04:42:38,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:42:38,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:42:38,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:42:38,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:42:38,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:42:38,970 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:42:38,983 INFO L93 Difference]: Finished difference Result 110 states and 159 transitions. [2025-01-10 04:42:38,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:42:38,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2025-01-10 04:42:38,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:42:38,985 INFO L225 Difference]: With dead ends: 110 [2025-01-10 04:42:38,985 INFO L226 Difference]: Without dead ends: 109 [2025-01-10 04:42:38,985 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-01-10 04:42:38,985 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 35 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 270 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-01-10 04:42:38,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 270 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:42:38,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-10 04:42:38,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-01-10 04:42:38,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.4782608695652173) internal successors, (136), 102 states have internal predecessors, (136), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 04:42:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 158 transitions. [2025-01-10 04:42:38,994 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 158 transitions. Word has length 34 [2025-01-10 04:42:38,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:42:38,994 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 158 transitions. [2025-01-10 04:42:38,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 158 transitions. [2025-01-10 04:42:38,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-10 04:42:38,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:42:38,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:42:38,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 04:42:38,995 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:42:38,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:42:38,995 INFO L85 PathProgramCache]: Analyzing trace with hash 471246915, now seen corresponding path program 1 times [2025-01-10 04:42:38,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:42:38,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751666354] [2025-01-10 04:42:38,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:42:38,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:42:39,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 04:42:39,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 04:42:39,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:42:39,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:42:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:42:39,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:42:39,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751666354] [2025-01-10 04:42:39,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751666354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:42:39,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:42:39,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:42:39,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091056640] [2025-01-10 04:42:39,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:42:39,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:42:39,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:42:39,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:42:39,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:42:39,053 INFO L87 Difference]: Start difference. First operand 109 states and 158 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:39,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:42:39,064 INFO L93 Difference]: Finished difference Result 144 states and 202 transitions. [2025-01-10 04:42:39,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:42:39,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2025-01-10 04:42:39,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:42:39,066 INFO L225 Difference]: With dead ends: 144 [2025-01-10 04:42:39,066 INFO L226 Difference]: Without dead ends: 107 [2025-01-10 04:42:39,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 04:42:39,068 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 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-01-10 04:42:39,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:42:39,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-10 04:42:39,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-01-10 04:42:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 91 states have (on average 1.4615384615384615) internal successors, (133), 100 states have internal predecessors, (133), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 04:42:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2025-01-10 04:42:39,077 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 39 [2025-01-10 04:42:39,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:42:39,079 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2025-01-10 04:42:39,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2025-01-10 04:42:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-10 04:42:39,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:42:39,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:42:39,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 04:42:39,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:42:39,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:42:39,080 INFO L85 PathProgramCache]: Analyzing trace with hash -609715793, now seen corresponding path program 1 times [2025-01-10 04:42:39,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:42:39,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316813662] [2025-01-10 04:42:39,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:42:39,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:42:39,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 04:42:39,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 04:42:39,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:42:39,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:42:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:42:39,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:42:39,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316813662] [2025-01-10 04:42:39,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316813662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:42:39,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:42:39,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:42:39,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970496600] [2025-01-10 04:42:39,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:42:39,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:42:39,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:42:39,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:42:39,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:42:39,137 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:42:39,157 INFO L93 Difference]: Finished difference Result 134 states and 186 transitions. [2025-01-10 04:42:39,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:42:39,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2025-01-10 04:42:39,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:42:39,160 INFO L225 Difference]: With dead ends: 134 [2025-01-10 04:42:39,160 INFO L226 Difference]: Without dead ends: 116 [2025-01-10 04:42:39,160 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-01-10 04:42:39,162 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 5 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:42:39,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 295 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:42:39,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-10 04:42:39,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2025-01-10 04:42:39,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 105 states have internal predecessors, (139), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 04:42:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 159 transitions. [2025-01-10 04:42:39,171 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 159 transitions. Word has length 39 [2025-01-10 04:42:39,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:42:39,173 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 159 transitions. [2025-01-10 04:42:39,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 159 transitions. [2025-01-10 04:42:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-10 04:42:39,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:42:39,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:42:39,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 04:42:39,174 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:42:39,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:42:39,174 INFO L85 PathProgramCache]: Analyzing trace with hash -607868751, now seen corresponding path program 1 times [2025-01-10 04:42:39,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:42:39,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697769337] [2025-01-10 04:42:39,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:42:39,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:42:39,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 04:42:39,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 04:42:39,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:42:39,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:42:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:42:39,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:42:39,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697769337] [2025-01-10 04:42:39,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697769337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:42:39,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:42:39,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:42:39,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940759523] [2025-01-10 04:42:39,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:42:39,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:42:39,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:42:39,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:42:39,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:42:39,201 INFO L87 Difference]: Start difference. First operand 112 states and 159 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:39,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:42:39,211 INFO L93 Difference]: Finished difference Result 142 states and 195 transitions. [2025-01-10 04:42:39,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:42:39,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2025-01-10 04:42:39,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:42:39,212 INFO L225 Difference]: With dead ends: 142 [2025-01-10 04:42:39,214 INFO L226 Difference]: Without dead ends: 112 [2025-01-10 04:42:39,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 04:42:39,214 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:42:39,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 297 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:42:39,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-10 04:42:39,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-01-10 04:42:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 96 states have (on average 1.4375) internal successors, (138), 104 states have internal predecessors, (138), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 04:42:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2025-01-10 04:42:39,221 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 39 [2025-01-10 04:42:39,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:42:39,221 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2025-01-10 04:42:39,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2025-01-10 04:42:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-10 04:42:39,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:42:39,222 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:42:39,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 04:42:39,222 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:42:39,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:42:39,222 INFO L85 PathProgramCache]: Analyzing trace with hash 420422980, now seen corresponding path program 1 times [2025-01-10 04:42:39,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:42:39,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374395305] [2025-01-10 04:42:39,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:42:39,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:42:39,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 04:42:39,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 04:42:39,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:42:39,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:42:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 04:42:39,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:42:39,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374395305] [2025-01-10 04:42:39,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374395305] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:42:39,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:42:39,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:42:39,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568870487] [2025-01-10 04:42:39,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:42:39,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:42:39,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:42:39,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:42:39,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:42:39,257 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 04:42:39,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:42:39,266 INFO L93 Difference]: Finished difference Result 135 states and 185 transitions. [2025-01-10 04:42:39,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:42:39,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-01-10 04:42:39,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:42:39,268 INFO L225 Difference]: With dead ends: 135 [2025-01-10 04:42:39,268 INFO L226 Difference]: Without dead ends: 104 [2025-01-10 04:42:39,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 04:42:39,269 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 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-01-10 04:42:39,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:42:39,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-10 04:42:39,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-01-10 04:42:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 97 states have internal predecessors, (128), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 04:42:39,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2025-01-10 04:42:39,272 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 43 [2025-01-10 04:42:39,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:42:39,272 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2025-01-10 04:42:39,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 04:42:39,273 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2025-01-10 04:42:39,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-10 04:42:39,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:42:39,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:42:39,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 04:42:39,273 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:42:39,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:42:39,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1320264293, now seen corresponding path program 1 times [2025-01-10 04:42:39,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:42:39,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332164797] [2025-01-10 04:42:39,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:42:39,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:42:39,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 04:42:39,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 04:42:39,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:42:39,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:42:39,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:42:39,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:42:39,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332164797] [2025-01-10 04:42:39,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332164797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:42:39,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:42:39,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:42:39,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218314762] [2025-01-10 04:42:39,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:42:39,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:42:39,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:42:39,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:42:39,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:42:39,304 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:39,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:42:39,312 INFO L93 Difference]: Finished difference Result 120 states and 164 transitions. [2025-01-10 04:42:39,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:42:39,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-01-10 04:42:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:42:39,315 INFO L225 Difference]: With dead ends: 120 [2025-01-10 04:42:39,315 INFO L226 Difference]: Without dead ends: 102 [2025-01-10 04:42:39,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 04:42:39,316 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 276 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-01-10 04:42:39,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:42:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-10 04:42:39,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-01-10 04:42:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 95 states have internal predecessors, (125), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 04:42:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2025-01-10 04:42:39,321 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 45 [2025-01-10 04:42:39,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:42:39,321 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2025-01-10 04:42:39,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:42:39,321 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2025-01-10 04:42:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-10 04:42:39,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:42:39,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:42:39,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 04:42:39,322 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:42:39,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:42:39,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1638493829, now seen corresponding path program 1 times [2025-01-10 04:42:39,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:42:39,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947852692] [2025-01-10 04:42:39,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:42:39,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:42:39,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 04:42:39,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 04:42:39,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:42:39,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:42:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:42:39,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:42:39,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947852692] [2025-01-10 04:42:39,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947852692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:42:39,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:42:39,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:42:39,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823666332] [2025-01-10 04:42:39,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:42:39,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:42:39,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:42:39,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:42:39,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:42:39,394 INFO L87 Difference]: Start difference. First operand 102 states and 141 transitions. Second operand has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 04:42:39,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:42:39,405 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2025-01-10 04:42:39,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:42:39,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2025-01-10 04:42:39,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:42:39,407 INFO L225 Difference]: With dead ends: 109 [2025-01-10 04:42:39,407 INFO L226 Difference]: Without dead ends: 102 [2025-01-10 04:42:39,407 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-01-10 04:42:39,408 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:42:39,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 274 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:42:39,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-10 04:42:39,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-01-10 04:42:39,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 95 states have internal predecessors, (124), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 04:42:39,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 140 transitions. [2025-01-10 04:42:39,411 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 140 transitions. Word has length 52 [2025-01-10 04:42:39,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:42:39,411 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 140 transitions. [2025-01-10 04:42:39,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 04:42:39,411 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 140 transitions. [2025-01-10 04:42:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 04:42:39,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:42:39,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:42:39,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 04:42:39,412 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:42:39,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:42:39,413 INFO L85 PathProgramCache]: Analyzing trace with hash -690979554, now seen corresponding path program 1 times [2025-01-10 04:42:39,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:42:39,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223883144] [2025-01-10 04:42:39,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:42:39,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:42:39,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 04:42:39,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 04:42:39,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:42:39,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:42:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:42:39,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:42:39,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223883144] [2025-01-10 04:42:39,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223883144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:42:39,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:42:39,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:42:39,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728513511] [2025-01-10 04:42:39,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:42:39,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:42:39,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:42:39,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:42:39,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:42:39,455 INFO L87 Difference]: Start difference. First operand 102 states and 140 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 04:42:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:42:39,457 INFO L93 Difference]: Finished difference Result 106 states and 144 transitions. [2025-01-10 04:42:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:42:39,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2025-01-10 04:42:39,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:42:39,457 INFO L225 Difference]: With dead ends: 106 [2025-01-10 04:42:39,457 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 04:42:39,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 04:42:39,458 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:42:39,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:42:39,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 04:42:39,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 04:42:39,458 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-01-10 04:42:39,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 04:42:39,458 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2025-01-10 04:42:39,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:42:39,459 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 04:42:39,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 04:42:39,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 04:42:39,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 04:42:39,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-01-10 04:42:39,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-01-10 04:42:39,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 04:42:39,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 04:42:39,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 04:42:39,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 04:42:39,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 04:42:39,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 04:42:39,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 04:42:39,467 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:42:39,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 04:42:39,497 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 04:42:39,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 04:42:39 BoogieIcfgContainer [2025-01-10 04:42:39,504 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 04:42:39,505 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 04:42:39,505 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 04:42:39,505 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 04:42:39,505 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:42:37" (3/4) ... [2025-01-10 04:42:39,507 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 04:42:39,511 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2025-01-10 04:42:39,511 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-01-10 04:42:39,517 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-01-10 04:42:39,519 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-01-10 04:42:39,519 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 04:42:39,520 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 04:42:39,520 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 04:42:39,587 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 04:42:39,587 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 04:42:39,587 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 04:42:39,588 INFO L158 Benchmark]: Toolchain (without parser) took 2853.54ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 96.9MB in the end (delta: 24.9MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2025-01-10 04:42:39,588 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 04:42:39,588 INFO L158 Benchmark]: CACSL2BoogieTranslator took 691.81ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 61.4MB in the end (delta: 60.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-10 04:42:39,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.00ms. Allocated memory is still 167.8MB. Free memory was 61.4MB in the beginning and 57.9MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 04:42:39,588 INFO L158 Benchmark]: Boogie Preprocessor took 36.99ms. Allocated memory is still 167.8MB. Free memory was 57.9MB in the beginning and 56.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 04:42:39,588 INFO L158 Benchmark]: RCFGBuilder took 478.22ms. Allocated memory is still 167.8MB. Free memory was 56.0MB in the beginning and 116.6MB in the end (delta: -60.6MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2025-01-10 04:42:39,589 INFO L158 Benchmark]: TraceAbstraction took 1512.38ms. Allocated memory is still 167.8MB. Free memory was 115.6MB in the beginning and 104.8MB in the end (delta: 10.8MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2025-01-10 04:42:39,589 INFO L158 Benchmark]: Witness Printer took 82.82ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 96.9MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 04:42:39,590 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.17ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 691.81ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 61.4MB in the end (delta: 60.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.00ms. Allocated memory is still 167.8MB. Free memory was 61.4MB in the beginning and 57.9MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.99ms. Allocated memory is still 167.8MB. Free memory was 57.9MB in the beginning and 56.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 478.22ms. Allocated memory is still 167.8MB. Free memory was 56.0MB in the beginning and 116.6MB in the end (delta: -60.6MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1512.38ms. Allocated memory is still 167.8MB. Free memory was 115.6MB in the beginning and 104.8MB in the end (delta: 10.8MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Witness Printer took 82.82ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 96.9MB in the end (delta: 7.9MB). 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: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: 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 3 procedures, 129 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 4167 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2016 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 2151 mSDtfsCounter, 94 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=0, InterpolantAutomatonStates: 42, 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, 14 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 491 NumberOfCodeBlocks, 491 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 477 ConstructedInterpolants, 0 QuantifiedInterpolants, 510 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 4/4 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 RESULT: Ultimate proved your program to be correct! [2025-01-10 04:42:39,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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