./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8ef6a70edb4426b11650a0154f4234f5ac775ab47d29a5a4fff3db3968295222 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:53:37,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:53:37,549 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 01:53:37,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:53:37,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:53:37,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:53:37,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:53:37,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:53:37,581 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:53:37,582 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:53:37,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:53:37,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:53:37,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:53:37,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:53:37,583 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:53:37,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:53:37,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:53:37,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:53:37,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:53:37,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:53:37,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:53:37,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:53:37,584 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:53:37,584 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:53:37,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:53:37,585 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:53:37,585 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:53:37,585 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:53:37,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:53:37,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:53:37,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:53:37,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:53:37,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:53:37,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:53:37,586 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:53:37,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:53:37,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:53:37,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:53:37,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:53:37,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:53:37,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:53:37,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:53:37,586 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ef6a70edb4426b11650a0154f4234f5ac775ab47d29a5a4fff3db3968295222 [2025-03-09 01:53:37,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:53:37,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:53:37,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:53:37,835 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:53:37,836 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:53:37,836 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2025-03-09 01:53:39,019 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2ed4e918/ba7e99cd52b74385996c266bd52f7e53/FLAGb2139d2c6 [2025-03-09 01:53:39,286 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:53:39,286 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2025-03-09 01:53:39,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2ed4e918/ba7e99cd52b74385996c266bd52f7e53/FLAGb2139d2c6 [2025-03-09 01:53:39,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2ed4e918/ba7e99cd52b74385996c266bd52f7e53 [2025-03-09 01:53:39,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:53:39,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:53:39,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:53:39,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:53:39,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:53:39,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:53:39" (1/1) ... [2025-03-09 01:53:39,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aab398c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:39, skipping insertion in model container [2025-03-09 01:53:39,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:53:39" (1/1) ... [2025-03-09 01:53:39,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:53:39,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:53:39,577 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:53:39,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:53:39,625 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:53:39,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:39 WrapperNode [2025-03-09 01:53:39,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:53:39,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:53:39,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:53:39,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:53:39,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:39" (1/1) ... [2025-03-09 01:53:39,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:39" (1/1) ... [2025-03-09 01:53:39,658 INFO L138 Inliner]: procedures = 111, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 128 [2025-03-09 01:53:39,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:53:39,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:53:39,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:53:39,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:53:39,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:39" (1/1) ... [2025-03-09 01:53:39,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:39" (1/1) ... [2025-03-09 01:53:39,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:39" (1/1) ... [2025-03-09 01:53:39,684 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [12, 8, 2]. 55 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 6 writes are split as follows [3, 2, 1]. [2025-03-09 01:53:39,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:39" (1/1) ... [2025-03-09 01:53:39,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:39" (1/1) ... [2025-03-09 01:53:39,687 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:39" (1/1) ... [2025-03-09 01:53:39,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:39" (1/1) ... [2025-03-09 01:53:39,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:39" (1/1) ... [2025-03-09 01:53:39,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:39" (1/1) ... [2025-03-09 01:53:39,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:53:39,694 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:53:39,694 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:53:39,694 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:53:39,695 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:39" (1/1) ... [2025-03-09 01:53:39,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:53:39,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:53:39,723 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:53:39,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:53:39,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:53:39,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:53:39,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:53:39,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:53:39,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:53:39,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:53:39,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:53:39,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:53:39,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:53:39,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:53:39,823 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:53:39,824 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:53:39,977 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L566: havoc test_fun_#t~mem24#1;call ULTIMATE.dealloc(test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset);havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset);havoc test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset);havoc test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset; [2025-03-09 01:53:39,977 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L569: havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;havoc main_#t~ret27#1; [2025-03-09 01:53:39,994 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-09 01:53:39,994 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:53:40,006 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:53:40,006 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:53:40,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:53:40 BoogieIcfgContainer [2025-03-09 01:53:40,006 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:53:40,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:53:40,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:53:40,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:53:40,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:53:39" (1/3) ... [2025-03-09 01:53:40,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ddbec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:53:40, skipping insertion in model container [2025-03-09 01:53:40,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:39" (2/3) ... [2025-03-09 01:53:40,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ddbec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:53:40, skipping insertion in model container [2025-03-09 01:53:40,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:53:40" (3/3) ... [2025-03-09 01:53:40,015 INFO L128 eAbstractionObserver]: Analyzing ICFG b.11-alloca.i [2025-03-09 01:53:40,026 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:53:40,027 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG b.11-alloca.i that has 1 procedures, 42 locations, 1 initial locations, 1 loop locations, and 12 error locations. [2025-03-09 01:53:40,071 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:53:40,082 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;@34dea23d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:53:40,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-09 01:53:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:53:40,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:40,092 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:53:40,092 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:40,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:40,103 INFO L85 PathProgramCache]: Analyzing trace with hash 79174481, now seen corresponding path program 1 times [2025-03-09 01:53:40,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:40,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191946855] [2025-03-09 01:53:40,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:40,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:40,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:53:40,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:53:40,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:40,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:40,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:40,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:40,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191946855] [2025-03-09 01:53:40,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191946855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:40,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:40,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:53:40,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365729705] [2025-03-09 01:53:40,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:40,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:53:40,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:40,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:53:40,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:40,478 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:40,530 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2025-03-09 01:53:40,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:53:40,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-09 01:53:40,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:40,536 INFO L225 Difference]: With dead ends: 47 [2025-03-09 01:53:40,536 INFO L226 Difference]: Without dead ends: 36 [2025-03-09 01:53:40,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:53:40,542 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 40 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:40,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-09 01:53:40,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-09 01:53:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.68) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-03-09 01:53:40,567 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 5 [2025-03-09 01:53:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:40,568 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-03-09 01:53:40,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-03-09 01:53:40,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:53:40,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:40,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:53:40,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:53:40,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:40,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:40,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1840558371, now seen corresponding path program 1 times [2025-03-09 01:53:40,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:40,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306694478] [2025-03-09 01:53:40,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:40,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:40,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:53:40,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:53:40,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:40,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:40,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:40,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306694478] [2025-03-09 01:53:40,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306694478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:40,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:40,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:53:40,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866137173] [2025-03-09 01:53:40,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:40,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:53:40,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:40,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:53:40,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:40,674 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:40,720 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-03-09 01:53:40,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:53:40,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 01:53:40,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:40,720 INFO L225 Difference]: With dead ends: 37 [2025-03-09 01:53:40,720 INFO L226 Difference]: Without dead ends: 36 [2025-03-09 01:53:40,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:53:40,721 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:40,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 95 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:40,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-09 01:53:40,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2025-03-09 01:53:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.64) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-03-09 01:53:40,724 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 6 [2025-03-09 01:53:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:40,725 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-03-09 01:53:40,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-03-09 01:53:40,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:53:40,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:40,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:40,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:53:40,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:40,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:40,729 INFO L85 PathProgramCache]: Analyzing trace with hash 750762972, now seen corresponding path program 1 times [2025-03-09 01:53:40,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:40,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285163125] [2025-03-09 01:53:40,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:40,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:40,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:53:40,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:53:40,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:40,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:40,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:40,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285163125] [2025-03-09 01:53:40,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285163125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:40,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:40,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:53:40,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408838783] [2025-03-09 01:53:40,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:40,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:53:40,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:40,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:53:40,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:40,833 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:40,877 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-03-09 01:53:40,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:53:40,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 01:53:40,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:40,879 INFO L225 Difference]: With dead ends: 35 [2025-03-09 01:53:40,879 INFO L226 Difference]: Without dead ends: 34 [2025-03-09 01:53:40,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:53:40,880 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:40,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 52 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:40,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-09 01:53:40,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-09 01:53:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.6) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2025-03-09 01:53:40,884 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 8 [2025-03-09 01:53:40,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:40,884 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-03-09 01:53:40,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2025-03-09 01:53:40,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:53:40,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:40,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:40,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:53:40,886 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:40,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:40,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1798815657, now seen corresponding path program 1 times [2025-03-09 01:53:40,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:40,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529820290] [2025-03-09 01:53:40,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:40,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:40,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:53:40,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:53:40,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:40,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:40,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:40,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529820290] [2025-03-09 01:53:40,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529820290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:40,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:40,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:53:40,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973743241] [2025-03-09 01:53:40,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:40,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:53:40,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:40,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:53:40,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:40,991 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:41,056 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2025-03-09 01:53:41,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:53:41,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 01:53:41,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:41,058 INFO L225 Difference]: With dead ends: 66 [2025-03-09 01:53:41,059 INFO L226 Difference]: Without dead ends: 65 [2025-03-09 01:53:41,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:53:41,060 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 31 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:41,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 80 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:41,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-09 01:53:41,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2025-03-09 01:53:41,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 52 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2025-03-09 01:53:41,070 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 9 [2025-03-09 01:53:41,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:41,071 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2025-03-09 01:53:41,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,071 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2025-03-09 01:53:41,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:53:41,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:41,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:41,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:53:41,071 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:41,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:41,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1798839490, now seen corresponding path program 1 times [2025-03-09 01:53:41,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:41,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631277044] [2025-03-09 01:53:41,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:41,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:41,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:53:41,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:53:41,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:41,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:41,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:41,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631277044] [2025-03-09 01:53:41,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631277044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:41,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:41,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:53:41,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125999403] [2025-03-09 01:53:41,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:41,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:53:41,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:41,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:53:41,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:41,119 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:41,138 INFO L93 Difference]: Finished difference Result 108 states and 142 transitions. [2025-03-09 01:53:41,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:53:41,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 01:53:41,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:41,140 INFO L225 Difference]: With dead ends: 108 [2025-03-09 01:53:41,140 INFO L226 Difference]: Without dead ends: 57 [2025-03-09 01:53:41,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:41,141 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:41,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:41,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-09 01:53:41,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-09 01:53:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 56 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2025-03-09 01:53:41,148 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 73 transitions. Word has length 9 [2025-03-09 01:53:41,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:41,148 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 73 transitions. [2025-03-09 01:53:41,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2025-03-09 01:53:41,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 01:53:41,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:41,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:41,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:53:41,149 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:41,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:41,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1200544603, now seen corresponding path program 1 times [2025-03-09 01:53:41,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:41,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939917068] [2025-03-09 01:53:41,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:41,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:41,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:53:41,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:53:41,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:41,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:41,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:41,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939917068] [2025-03-09 01:53:41,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939917068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:41,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:41,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:53:41,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294692073] [2025-03-09 01:53:41,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:41,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:53:41,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:41,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:53:41,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:53:41,345 INFO L87 Difference]: Start difference. First operand 57 states and 73 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:41,455 INFO L93 Difference]: Finished difference Result 151 states and 195 transitions. [2025-03-09 01:53:41,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:53:41,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-09 01:53:41,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:41,456 INFO L225 Difference]: With dead ends: 151 [2025-03-09 01:53:41,456 INFO L226 Difference]: Without dead ends: 150 [2025-03-09 01:53:41,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:53:41,457 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 87 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:41,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 130 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-09 01:53:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 113. [2025-03-09 01:53:41,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 104 states have (on average 1.4903846153846154) internal successors, (155), 112 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 155 transitions. [2025-03-09 01:53:41,470 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 155 transitions. Word has length 11 [2025-03-09 01:53:41,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:41,470 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 155 transitions. [2025-03-09 01:53:41,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 155 transitions. [2025-03-09 01:53:41,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 01:53:41,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:41,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:41,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:53:41,471 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:41,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:41,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2085825641, now seen corresponding path program 1 times [2025-03-09 01:53:41,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:41,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464594079] [2025-03-09 01:53:41,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:41,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:41,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:53:41,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:53:41,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:41,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:41,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:41,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:41,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464594079] [2025-03-09 01:53:41,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464594079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:41,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:41,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:53:41,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568021046] [2025-03-09 01:53:41,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:41,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:53:41,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:41,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:53:41,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:53:41,520 INFO L87 Difference]: Start difference. First operand 113 states and 155 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:41,547 INFO L93 Difference]: Finished difference Result 226 states and 310 transitions. [2025-03-09 01:53:41,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:53:41,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-09 01:53:41,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:41,548 INFO L225 Difference]: With dead ends: 226 [2025-03-09 01:53:41,548 INFO L226 Difference]: Without dead ends: 113 [2025-03-09 01:53:41,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:53:41,549 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:41,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:41,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-09 01:53:41,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-09 01:53:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 104 states have (on average 1.375) internal successors, (143), 112 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 143 transitions. [2025-03-09 01:53:41,558 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 143 transitions. Word has length 11 [2025-03-09 01:53:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:41,558 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 143 transitions. [2025-03-09 01:53:41,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,558 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 143 transitions. [2025-03-09 01:53:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 01:53:41,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:41,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:41,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:53:41,559 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:41,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:41,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1437822968, now seen corresponding path program 1 times [2025-03-09 01:53:41,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:41,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220147900] [2025-03-09 01:53:41,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:41,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:41,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:53:41,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:53:41,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:41,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:41,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:41,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220147900] [2025-03-09 01:53:41,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220147900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:41,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:41,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:53:41,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490795046] [2025-03-09 01:53:41,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:41,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:53:41,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:41,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:53:41,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:53:41,777 INFO L87 Difference]: Start difference. First operand 113 states and 143 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:41,855 INFO L93 Difference]: Finished difference Result 161 states and 209 transitions. [2025-03-09 01:53:41,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:53:41,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-09 01:53:41,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:41,856 INFO L225 Difference]: With dead ends: 161 [2025-03-09 01:53:41,856 INFO L226 Difference]: Without dead ends: 160 [2025-03-09 01:53:41,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:53:41,857 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 54 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:41,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 96 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:41,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-09 01:53:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129. [2025-03-09 01:53:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 120 states have (on average 1.3416666666666666) internal successors, (161), 128 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 161 transitions. [2025-03-09 01:53:41,870 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 161 transitions. Word has length 12 [2025-03-09 01:53:41,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:41,870 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 161 transitions. [2025-03-09 01:53:41,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,870 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 161 transitions. [2025-03-09 01:53:41,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:53:41,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:41,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:41,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:53:41,874 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:41,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:41,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2070962170, now seen corresponding path program 1 times [2025-03-09 01:53:41,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:41,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348726160] [2025-03-09 01:53:41,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:41,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:41,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:53:41,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:53:41,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:41,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:42,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:42,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348726160] [2025-03-09 01:53:42,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348726160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:42,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:42,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:53:42,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318771058] [2025-03-09 01:53:42,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:42,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:53:42,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:42,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:53:42,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:53:42,072 INFO L87 Difference]: Start difference. First operand 129 states and 161 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:42,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:42,220 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2025-03-09 01:53:42,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:53:42,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-09 01:53:42,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:42,222 INFO L225 Difference]: With dead ends: 134 [2025-03-09 01:53:42,222 INFO L226 Difference]: Without dead ends: 133 [2025-03-09 01:53:42,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:53:42,223 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:42,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 131 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:42,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-09 01:53:42,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 115. [2025-03-09 01:53:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 114 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:42,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 142 transitions. [2025-03-09 01:53:42,233 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 142 transitions. Word has length 13 [2025-03-09 01:53:42,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:42,234 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 142 transitions. [2025-03-09 01:53:42,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2025-03-09 01:53:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 01:53:42,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:42,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:42,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:53:42,237 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:42,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:42,238 INFO L85 PathProgramCache]: Analyzing trace with hash 224682167, now seen corresponding path program 1 times [2025-03-09 01:53:42,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:42,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385392259] [2025-03-09 01:53:42,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:42,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:42,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:53:42,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:53:42,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:42,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:42,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:42,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385392259] [2025-03-09 01:53:42,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385392259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:42,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:42,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:53:42,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238646757] [2025-03-09 01:53:42,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:42,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:53:42,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:42,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:53:42,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:53:42,450 INFO L87 Difference]: Start difference. First operand 115 states and 142 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:42,558 INFO L93 Difference]: Finished difference Result 179 states and 224 transitions. [2025-03-09 01:53:42,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:53:42,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-09 01:53:42,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:42,560 INFO L225 Difference]: With dead ends: 179 [2025-03-09 01:53:42,560 INFO L226 Difference]: Without dead ends: 178 [2025-03-09 01:53:42,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:53:42,561 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 77 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:42,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 125 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:42,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-09 01:53:42,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 137. [2025-03-09 01:53:42,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 128 states have (on average 1.296875) internal successors, (166), 136 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 166 transitions. [2025-03-09 01:53:42,571 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 166 transitions. Word has length 14 [2025-03-09 01:53:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:42,572 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 166 transitions. [2025-03-09 01:53:42,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 166 transitions. [2025-03-09 01:53:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:53:42,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:42,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:42,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:53:42,572 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:42,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:42,573 INFO L85 PathProgramCache]: Analyzing trace with hash 475192226, now seen corresponding path program 1 times [2025-03-09 01:53:42,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:42,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326737733] [2025-03-09 01:53:42,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:42,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:42,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:53:42,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:53:42,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:42,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:42,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:42,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326737733] [2025-03-09 01:53:42,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326737733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:42,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:42,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:53:42,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233825772] [2025-03-09 01:53:42,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:42,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:53:42,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:42,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:53:42,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:53:42,683 INFO L87 Difference]: Start difference. First operand 137 states and 166 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:42,741 INFO L93 Difference]: Finished difference Result 200 states and 245 transitions. [2025-03-09 01:53:42,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:53:42,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-09 01:53:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:42,742 INFO L225 Difference]: With dead ends: 200 [2025-03-09 01:53:42,742 INFO L226 Difference]: Without dead ends: 199 [2025-03-09 01:53:42,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:53:42,743 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 46 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:42,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 81 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:42,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-09 01:53:42,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2025-03-09 01:53:42,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 178 states have (on average 1.297752808988764) internal successors, (231), 186 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:42,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 231 transitions. [2025-03-09 01:53:42,750 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 231 transitions. Word has length 15 [2025-03-09 01:53:42,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:42,750 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 231 transitions. [2025-03-09 01:53:42,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:42,750 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 231 transitions. [2025-03-09 01:53:42,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:53:42,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:42,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:42,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:53:42,750 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:42,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:42,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1860972876, now seen corresponding path program 1 times [2025-03-09 01:53:42,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:42,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778422020] [2025-03-09 01:53:42,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:42,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:42,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:53:42,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:53:42,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:42,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:42,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:42,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778422020] [2025-03-09 01:53:42,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778422020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:42,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:42,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:53:42,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561128955] [2025-03-09 01:53:42,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:42,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:53:42,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:42,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:53:42,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:53:42,854 INFO L87 Difference]: Start difference. First operand 187 states and 231 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:42,891 INFO L93 Difference]: Finished difference Result 301 states and 375 transitions. [2025-03-09 01:53:42,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:53:42,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-09 01:53:42,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:42,892 INFO L225 Difference]: With dead ends: 301 [2025-03-09 01:53:42,892 INFO L226 Difference]: Without dead ends: 147 [2025-03-09 01:53:42,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:53:42,894 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 45 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:42,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 72 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:42,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-09 01:53:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 110. [2025-03-09 01:53:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 102 states have (on average 1.3235294117647058) internal successors, (135), 109 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2025-03-09 01:53:42,900 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 16 [2025-03-09 01:53:42,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:42,900 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2025-03-09 01:53:42,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2025-03-09 01:53:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:53:42,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:42,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:42,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:53:42,901 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:42,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:42,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1846067890, now seen corresponding path program 1 times [2025-03-09 01:53:42,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:42,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081822085] [2025-03-09 01:53:42,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:42,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:42,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:53:42,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:53:42,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:42,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:43,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:43,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081822085] [2025-03-09 01:53:43,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081822085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:43,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:43,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:53:43,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330254489] [2025-03-09 01:53:43,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:43,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:53:43,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:43,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:53:43,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:53:43,004 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:43,051 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2025-03-09 01:53:43,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:53:43,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-09 01:53:43,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:43,052 INFO L225 Difference]: With dead ends: 121 [2025-03-09 01:53:43,052 INFO L226 Difference]: Without dead ends: 120 [2025-03-09 01:53:43,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:53:43,053 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 27 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:43,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 69 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:43,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-09 01:53:43,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2025-03-09 01:53:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 111 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 137 transitions. [2025-03-09 01:53:43,059 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 137 transitions. Word has length 16 [2025-03-09 01:53:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:43,059 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 137 transitions. [2025-03-09 01:53:43,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 137 transitions. [2025-03-09 01:53:43,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:53:43,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:43,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:43,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:53:43,060 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:43,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:43,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1846068050, now seen corresponding path program 1 times [2025-03-09 01:53:43,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:43,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442873426] [2025-03-09 01:53:43,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:43,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:43,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:53:43,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:53:43,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:43,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:43,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:43,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442873426] [2025-03-09 01:53:43,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442873426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:43,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:43,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:53:43,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555311240] [2025-03-09 01:53:43,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:43,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:53:43,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:43,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:53:43,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:53:43,237 INFO L87 Difference]: Start difference. First operand 112 states and 137 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:43,352 INFO L93 Difference]: Finished difference Result 170 states and 204 transitions. [2025-03-09 01:53:43,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:53:43,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-09 01:53:43,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:43,353 INFO L225 Difference]: With dead ends: 170 [2025-03-09 01:53:43,353 INFO L226 Difference]: Without dead ends: 169 [2025-03-09 01:53:43,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:53:43,354 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 45 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:43,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 174 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:43,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-09 01:53:43,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 111. [2025-03-09 01:53:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 104 states have (on average 1.2884615384615385) internal successors, (134), 110 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 134 transitions. [2025-03-09 01:53:43,357 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 134 transitions. Word has length 16 [2025-03-09 01:53:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:43,357 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 134 transitions. [2025-03-09 01:53:43,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,358 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 134 transitions. [2025-03-09 01:53:43,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:53:43,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:43,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:43,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:53:43,358 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:43,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:43,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1846057095, now seen corresponding path program 1 times [2025-03-09 01:53:43,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:43,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998272350] [2025-03-09 01:53:43,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:43,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:43,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:53:43,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:53:43,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:43,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:43,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:43,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998272350] [2025-03-09 01:53:43,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998272350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:43,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:43,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:53:43,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391087936] [2025-03-09 01:53:43,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:43,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:53:43,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:43,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:53:43,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:43,428 INFO L87 Difference]: Start difference. First operand 111 states and 134 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:43,450 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2025-03-09 01:53:43,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:53:43,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-09 01:53:43,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:43,451 INFO L225 Difference]: With dead ends: 111 [2025-03-09 01:53:43,451 INFO L226 Difference]: Without dead ends: 110 [2025-03-09 01:53:43,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:53:43,452 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:43,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 44 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:43,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-09 01:53:43,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-09 01:53:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 104 states have (on average 1.2692307692307692) internal successors, (132), 109 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 132 transitions. [2025-03-09 01:53:43,457 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 132 transitions. Word has length 16 [2025-03-09 01:53:43,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:43,458 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 132 transitions. [2025-03-09 01:53:43,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,458 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 132 transitions. [2025-03-09 01:53:43,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 01:53:43,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:43,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:43,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:53:43,460 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:43,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:43,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1393529724, now seen corresponding path program 1 times [2025-03-09 01:53:43,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:43,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315156199] [2025-03-09 01:53:43,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:43,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:43,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:53:43,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:53:43,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:43,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:43,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:43,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315156199] [2025-03-09 01:53:43,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315156199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:43,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:43,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:53:43,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157150818] [2025-03-09 01:53:43,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:43,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:53:43,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:43,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:53:43,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:43,511 INFO L87 Difference]: Start difference. First operand 110 states and 132 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:43,538 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2025-03-09 01:53:43,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:53:43,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-09 01:53:43,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:43,540 INFO L225 Difference]: With dead ends: 110 [2025-03-09 01:53:43,540 INFO L226 Difference]: Without dead ends: 109 [2025-03-09 01:53:43,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:53:43,540 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:43,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 42 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:43,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-09 01:53:43,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-09 01:53:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.25) internal successors, (130), 108 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2025-03-09 01:53:43,546 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 17 [2025-03-09 01:53:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:43,546 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2025-03-09 01:53:43,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2025-03-09 01:53:43,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 01:53:43,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:43,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:43,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:53:43,547 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:43,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:43,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1393534689, now seen corresponding path program 1 times [2025-03-09 01:53:43,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:43,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163007912] [2025-03-09 01:53:43,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:43,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:43,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:53:43,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:53:43,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:43,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:43,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:43,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163007912] [2025-03-09 01:53:43,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163007912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:43,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:43,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:53:43,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383794433] [2025-03-09 01:53:43,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:43,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:53:43,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:43,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:53:43,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:43,602 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:43,620 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2025-03-09 01:53:43,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:53:43,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-09 01:53:43,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:43,622 INFO L225 Difference]: With dead ends: 109 [2025-03-09 01:53:43,622 INFO L226 Difference]: Without dead ends: 108 [2025-03-09 01:53:43,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:53:43,622 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:43,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 50 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:43,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-09 01:53:43,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-09 01:53:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 107 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 127 transitions. [2025-03-09 01:53:43,628 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 127 transitions. Word has length 17 [2025-03-09 01:53:43,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:43,628 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 127 transitions. [2025-03-09 01:53:43,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,628 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2025-03-09 01:53:43,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 01:53:43,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:43,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:43,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:53:43,629 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:43,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:43,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1947385475, now seen corresponding path program 1 times [2025-03-09 01:53:43,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:43,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263025337] [2025-03-09 01:53:43,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:43,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:43,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:53:43,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:53:43,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:43,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:43,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:43,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263025337] [2025-03-09 01:53:43,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263025337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:43,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:43,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:53:43,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764482599] [2025-03-09 01:53:43,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:43,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:53:43,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:43,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:53:43,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:53:43,783 INFO L87 Difference]: Start difference. First operand 108 states and 127 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:43,924 INFO L93 Difference]: Finished difference Result 229 states and 266 transitions. [2025-03-09 01:53:43,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:53:43,925 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-09 01:53:43,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:43,926 INFO L225 Difference]: With dead ends: 229 [2025-03-09 01:53:43,926 INFO L226 Difference]: Without dead ends: 155 [2025-03-09 01:53:43,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:53:43,926 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 56 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:43,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 203 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:43,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-09 01:53:43,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 122. [2025-03-09 01:53:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 119 states have (on average 1.1680672268907564) internal successors, (139), 121 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2025-03-09 01:53:43,930 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 17 [2025-03-09 01:53:43,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:43,930 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2025-03-09 01:53:43,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,930 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2025-03-09 01:53:43,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 01:53:43,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:43,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:43,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:53:43,931 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:43,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:43,931 INFO L85 PathProgramCache]: Analyzing trace with hash 239418353, now seen corresponding path program 1 times [2025-03-09 01:53:43,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:43,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352406228] [2025-03-09 01:53:43,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:43,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:43,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:53:43,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:53:43,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:43,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:44,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:44,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:44,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352406228] [2025-03-09 01:53:44,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352406228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:44,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:44,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:53:44,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607534378] [2025-03-09 01:53:44,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:44,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:53:44,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:44,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:53:44,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:53:44,154 INFO L87 Difference]: Start difference. First operand 122 states and 139 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:44,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:44,295 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2025-03-09 01:53:44,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:53:44,295 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-09 01:53:44,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:44,296 INFO L225 Difference]: With dead ends: 124 [2025-03-09 01:53:44,296 INFO L226 Difference]: Without dead ends: 123 [2025-03-09 01:53:44,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:53:44,297 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:44,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 137 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:44,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-09 01:53:44,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2025-03-09 01:53:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 117 states have (on average 1.1538461538461537) internal successors, (135), 118 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:44,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2025-03-09 01:53:44,301 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 18 [2025-03-09 01:53:44,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:44,301 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2025-03-09 01:53:44,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:44,301 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2025-03-09 01:53:44,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 01:53:44,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:44,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:44,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:53:44,302 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:44,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:44,302 INFO L85 PathProgramCache]: Analyzing trace with hash -159376701, now seen corresponding path program 1 times [2025-03-09 01:53:44,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:44,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537469620] [2025-03-09 01:53:44,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:44,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:44,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:53:44,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:53:44,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:44,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:44,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:44,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537469620] [2025-03-09 01:53:44,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537469620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:44,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:44,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:53:44,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108222863] [2025-03-09 01:53:44,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:44,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:53:44,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:44,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:53:44,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:53:44,468 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:44,617 INFO L93 Difference]: Finished difference Result 200 states and 228 transitions. [2025-03-09 01:53:44,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:53:44,618 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-09 01:53:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:44,618 INFO L225 Difference]: With dead ends: 200 [2025-03-09 01:53:44,618 INFO L226 Difference]: Without dead ends: 199 [2025-03-09 01:53:44,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:53:44,619 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:44,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 151 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:44,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-09 01:53:44,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 121. [2025-03-09 01:53:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 119 states have (on average 1.1596638655462186) internal successors, (138), 120 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 138 transitions. [2025-03-09 01:53:44,628 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 138 transitions. Word has length 23 [2025-03-09 01:53:44,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:44,628 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 138 transitions. [2025-03-09 01:53:44,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:44,629 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 138 transitions. [2025-03-09 01:53:44,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 01:53:44,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:44,629 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:44,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:53:44,630 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:44,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:44,630 INFO L85 PathProgramCache]: Analyzing trace with hash -821308882, now seen corresponding path program 1 times [2025-03-09 01:53:44,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:44,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260614200] [2025-03-09 01:53:44,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:44,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:44,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:53:44,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:53:44,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:44,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:44,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:44,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:44,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260614200] [2025-03-09 01:53:44,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260614200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:44,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:44,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:53:44,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539916094] [2025-03-09 01:53:44,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:44,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:53:44,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:44,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:53:44,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:53:44,810 INFO L87 Difference]: Start difference. First operand 121 states and 138 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:45,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:45,004 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2025-03-09 01:53:45,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:53:45,005 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-09 01:53:45,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:45,006 INFO L225 Difference]: With dead ends: 167 [2025-03-09 01:53:45,006 INFO L226 Difference]: Without dead ends: 166 [2025-03-09 01:53:45,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:53:45,006 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 29 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:45,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 162 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:45,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-09 01:53:45,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 86. [2025-03-09 01:53:45,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 85 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:45,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2025-03-09 01:53:45,013 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 24 [2025-03-09 01:53:45,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:45,013 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2025-03-09 01:53:45,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2025-03-09 01:53:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 01:53:45,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:45,013 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:45,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 01:53:45,013 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:45,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:45,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1273600037, now seen corresponding path program 1 times [2025-03-09 01:53:45,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:45,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318391468] [2025-03-09 01:53:45,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:45,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:45,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:53:45,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:53:45,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:45,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:45,211 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:45,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:45,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318391468] [2025-03-09 01:53:45,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318391468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:53:45,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762850748] [2025-03-09 01:53:45,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:45,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:53:45,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:53:45,215 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:53:45,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:53:45,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:53:45,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:53:45,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:45,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:45,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:53:45,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:53:45,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2025-03-09 01:53:45,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-09 01:53:45,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 01:53:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:45,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:53:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:45,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762850748] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:53:45,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:53:45,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2025-03-09 01:53:45,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254905510] [2025-03-09 01:53:45,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:53:45,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:53:45,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:45,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:53:45,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:53:45,572 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:45,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:45,715 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2025-03-09 01:53:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:53:45,716 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-09 01:53:45,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:45,716 INFO L225 Difference]: With dead ends: 107 [2025-03-09 01:53:45,716 INFO L226 Difference]: Without dead ends: 106 [2025-03-09 01:53:45,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2025-03-09 01:53:45,718 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 31 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:45,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 177 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-09 01:53:45,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2025-03-09 01:53:45,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 92 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2025-03-09 01:53:45,722 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 26 [2025-03-09 01:53:45,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:45,722 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2025-03-09 01:53:45,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:45,722 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2025-03-09 01:53:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 01:53:45,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:45,722 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:45,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:53:45,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 01:53:45,927 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:53:45,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:45,928 INFO L85 PathProgramCache]: Analyzing trace with hash 855078079, now seen corresponding path program 1 times [2025-03-09 01:53:45,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:45,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693341823] [2025-03-09 01:53:45,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:45,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:45,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 01:53:45,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:53:45,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:45,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:46,221 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:46,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:46,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693341823] [2025-03-09 01:53:46,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693341823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:53:46,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044515966] [2025-03-09 01:53:46,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:46,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:53:46,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:53:46,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:53:46,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:53:46,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 01:53:46,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:53:46,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:46,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:46,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:53:46,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:53:46,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-09 01:53:46,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 01:53:46,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 01:53:46,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 01:53:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:46,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:53:46,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2025-03-09 01:53:46,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-09 01:53:47,101 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:47,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044515966] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:53:47,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:53:47,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 36 [2025-03-09 01:53:47,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287473043] [2025-03-09 01:53:47,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:53:47,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-09 01:53:47,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:47,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-09 01:53:47,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1197, Unknown=0, NotChecked=0, Total=1332 [2025-03-09 01:53:47,103 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 37 states, 36 states have (on average 3.1666666666666665) internal successors, (114), 37 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:49,117 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2025-03-09 01:53:49,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-03-09 01:53:49,117 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.1666666666666665) internal successors, (114), 37 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-09 01:53:49,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:49,117 INFO L225 Difference]: With dead ends: 141 [2025-03-09 01:53:49,118 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:53:49,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2156 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1910, Invalid=8190, Unknown=0, NotChecked=0, Total=10100 [2025-03-09 01:53:49,122 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 332 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:49,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 370 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 01:53:49,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:53:49,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:53:49,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:49,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:53:49,123 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2025-03-09 01:53:49,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:49,123 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:53:49,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.1666666666666665) internal successors, (114), 37 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:49,124 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:53:49,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:53:49,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-09 01:53:49,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-09 01:53:49,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-09 01:53:49,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-09 01:53:49,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-09 01:53:49,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-09 01:53:49,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-09 01:53:49,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-09 01:53:49,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-09 01:53:49,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-09 01:53:49,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-09 01:53:49,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-09 01:53:49,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:53:49,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-09 01:53:49,333 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:49,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:53:49,384 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:53:49,392 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 01:53:49,392 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 01:53:49,392 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2025-03-09 01:53:49,394 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 01:53:49,394 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 01:53:49,394 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2025-03-09 01:53:49,394 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 01:53:49,394 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 01:53:49,394 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2025-03-09 01:53:49,394 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 01:53:49,394 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 01:53:49,394 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2025-03-09 01:53:49,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:53:49 BoogieIcfgContainer [2025-03-09 01:53:49,395 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:53:49,395 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:53:49,395 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:53:49,395 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:53:49,396 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:53:40" (3/4) ... [2025-03-09 01:53:49,398 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:53:49,407 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-09 01:53:49,407 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:53:49,407 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-09 01:53:49,408 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:53:49,465 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:53:49,465 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:53:49,465 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:53:49,466 INFO L158 Benchmark]: Toolchain (without parser) took 10141.69ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 113.0MB in the beginning and 283.7MB in the end (delta: -170.7MB). Peak memory consumption was 106.3MB. Max. memory is 16.1GB. [2025-03-09 01:53:49,466 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:53:49,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.22ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 96.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:53:49,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.35ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 94.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:53:49,467 INFO L158 Benchmark]: Boogie Preprocessor took 33.90ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 93.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:53:49,467 INFO L158 Benchmark]: IcfgBuilder took 312.17ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 77.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:53:49,468 INFO L158 Benchmark]: TraceAbstraction took 9386.79ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 76.6MB in the beginning and 291.9MB in the end (delta: -215.3MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. [2025-03-09 01:53:49,469 INFO L158 Benchmark]: Witness Printer took 70.44ms. Allocated memory is still 419.4MB. Free memory was 291.9MB in the beginning and 283.7MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:53:49,469 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.19ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.22ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 96.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.35ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 94.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.90ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 93.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 312.17ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 77.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9386.79ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 76.6MB in the beginning and 291.9MB in the end (delta: -215.3MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. * Witness Printer took 70.44ms. Allocated memory is still 419.4MB. Free memory was 291.9MB in the beginning and 283.7MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] * 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: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 560]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 560]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 49 edges, 12 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1056 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1056 mSDsluCounter, 2748 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2058 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3123 IncrementalHoareTripleChecker+Invalid, 3193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 690 mSDtfsCounter, 3123 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2323 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=11, InterpolantAutomatonStates: 216, 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, 23 MinimizatonAttempts, 463 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 425 NumberOfCodeBlocks, 425 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 464 ConstructedInterpolants, 0 QuantifiedInterpolants, 3833 SizeOfPredicates, 23 NumberOfNonLiveVariables, 304 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 66/125 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 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 01:53:49,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE