./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_04.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_04.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 26441cee42562e2fd703b97b1a86d2baa847af9810285d31267fccda11d2ea67 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:19:15,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:19:15,313 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 20:19:15,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:19:15,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:19:15,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:19:15,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:19:15,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:19:15,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:19:15,348 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:19:15,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:19:15,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:19:15,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:19:15,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:19:15,351 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:19:15,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:19:15,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:19:15,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:19:15,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:19:15,352 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:19:15,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:19:15,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:19:15,356 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:19:15,356 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:19:15,356 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:19:15,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:19:15,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:19:15,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:19:15,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:19:15,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:19:15,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:19:15,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:19:15,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:19:15,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:19:15,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:19:15,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:19:15,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:19:15,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:19:15,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:19:15,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:19:15,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:19:15,359 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/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 -> 26441cee42562e2fd703b97b1a86d2baa847af9810285d31267fccda11d2ea67 [2024-10-11 20:19:15,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:19:15,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:19:15,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:19:15,616 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:19:15,616 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:19:15,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_04.c [2024-10-11 20:19:16,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:19:17,051 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:19:17,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_04.c [2024-10-11 20:19:17,057 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/411c7aac5/41009777faaa4762929966714032cff1/FLAG777755dab [2024-10-11 20:19:17,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/411c7aac5/41009777faaa4762929966714032cff1 [2024-10-11 20:19:17,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:19:17,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:19:17,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:19:17,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:19:17,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:19:17,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:19:17" (1/1) ... [2024-10-11 20:19:17,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79aa7d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:17, skipping insertion in model container [2024-10-11 20:19:17,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:19:17" (1/1) ... [2024-10-11 20:19:17,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:19:17,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:19:17,246 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:19:17,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:19:17,268 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:19:17,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:17 WrapperNode [2024-10-11 20:19:17,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:19:17,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:19:17,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:19:17,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:19:17,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:17" (1/1) ... [2024-10-11 20:19:17,278 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:17" (1/1) ... [2024-10-11 20:19:17,291 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 73 [2024-10-11 20:19:17,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:19:17,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:19:17,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:19:17,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:19:17,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:17" (1/1) ... [2024-10-11 20:19:17,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:17" (1/1) ... [2024-10-11 20:19:17,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:17" (1/1) ... [2024-10-11 20:19:17,309 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 20:19:17,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:17" (1/1) ... [2024-10-11 20:19:17,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:17" (1/1) ... [2024-10-11 20:19:17,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:17" (1/1) ... [2024-10-11 20:19:17,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:17" (1/1) ... [2024-10-11 20:19:17,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:17" (1/1) ... [2024-10-11 20:19:17,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:17" (1/1) ... [2024-10-11 20:19:17,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:19:17,322 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:19:17,322 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:19:17,322 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:19:17,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:17" (1/1) ... [2024-10-11 20:19:17,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:19:17,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:19:17,351 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:19:17,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:19:17,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:19:17,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:19:17,441 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:19:17,443 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:19:17,590 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2024-10-11 20:19:17,592 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:19:17,625 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:19:17,626 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 20:19:17,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:19:17 BoogieIcfgContainer [2024-10-11 20:19:17,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:19:17,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:19:17,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:19:17,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:19:17,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:19:17" (1/3) ... [2024-10-11 20:19:17,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68bcc75d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:19:17, skipping insertion in model container [2024-10-11 20:19:17,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:17" (2/3) ... [2024-10-11 20:19:17,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68bcc75d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:19:17, skipping insertion in model container [2024-10-11 20:19:17,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:19:17" (3/3) ... [2024-10-11 20:19:17,635 INFO L112 eAbstractionObserver]: Analyzing ICFG NO_04.c [2024-10-11 20:19:17,648 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:19:17,648 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-10-11 20:19:17,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:19:17,706 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;@67f6a229, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:19:17,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2024-10-11 20:19:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 37 states have (on average 2.081081081081081) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:17,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 20:19:17,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:17,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 20:19:17,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:17,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:17,719 INFO L85 PathProgramCache]: Analyzing trace with hash 154113, now seen corresponding path program 1 times [2024-10-11 20:19:17,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:17,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809272724] [2024-10-11 20:19:17,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:17,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:17,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:17,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809272724] [2024-10-11 20:19:17,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809272724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:17,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:17,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:19:17,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173621275] [2024-10-11 20:19:17,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:17,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:17,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:17,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:17,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:17,907 INFO L87 Difference]: Start difference. First operand has 68 states, 37 states have (on average 2.081081081081081) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:18,021 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2024-10-11 20:19:18,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:18,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-10-11 20:19:18,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:18,036 INFO L225 Difference]: With dead ends: 133 [2024-10-11 20:19:18,039 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 20:19:18,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:18,043 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:18,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 24 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:18,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 20:19:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 20:19:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 63 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-10-11 20:19:18,071 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 3 [2024-10-11 20:19:18,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:18,073 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-10-11 20:19:18,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-10-11 20:19:18,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 20:19:18,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:18,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 20:19:18,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:19:18,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:18,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:18,077 INFO L85 PathProgramCache]: Analyzing trace with hash 4777548, now seen corresponding path program 1 times [2024-10-11 20:19:18,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:18,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345264705] [2024-10-11 20:19:18,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:18,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:18,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:18,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:18,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345264705] [2024-10-11 20:19:18,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345264705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:18,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:18,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:19:18,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816516037] [2024-10-11 20:19:18,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:18,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:18,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:18,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:18,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:18,108 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:18,209 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2024-10-11 20:19:18,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:18,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2024-10-11 20:19:18,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:18,210 INFO L225 Difference]: With dead ends: 109 [2024-10-11 20:19:18,210 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 20:19:18,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:18,212 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:18,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 50 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 20:19:18,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 99. [2024-10-11 20:19:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.8732394366197183) internal successors, (133), 98 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 133 transitions. [2024-10-11 20:19:18,228 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 133 transitions. Word has length 4 [2024-10-11 20:19:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:18,228 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 133 transitions. [2024-10-11 20:19:18,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. [2024-10-11 20:19:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:19:18,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:18,229 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:19:18,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:19:18,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:18,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:18,230 INFO L85 PathProgramCache]: Analyzing trace with hash 296258062, now seen corresponding path program 1 times [2024-10-11 20:19:18,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:18,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917317530] [2024-10-11 20:19:18,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:18,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:18,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:18,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:18,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917317530] [2024-10-11 20:19:18,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917317530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:18,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:18,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:19:18,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534882241] [2024-10-11 20:19:18,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:18,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:19:18,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:18,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:19:18,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:19:18,282 INFO L87 Difference]: Start difference. First operand 99 states and 133 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:18,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:18,440 INFO L93 Difference]: Finished difference Result 99 states and 133 transitions. [2024-10-11 20:19:18,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:19:18,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 20:19:18,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:18,442 INFO L225 Difference]: With dead ends: 99 [2024-10-11 20:19:18,442 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 20:19:18,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:19:18,443 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:18,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 18 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:18,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 20:19:18,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-11 20:19:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 94 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2024-10-11 20:19:18,461 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 6 [2024-10-11 20:19:18,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:18,462 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2024-10-11 20:19:18,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2024-10-11 20:19:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:19:18,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:18,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:18,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:19:18,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:18,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:18,465 INFO L85 PathProgramCache]: Analyzing trace with hash 594065388, now seen corresponding path program 1 times [2024-10-11 20:19:18,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:18,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914189398] [2024-10-11 20:19:18,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:18,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:18,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:18,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914189398] [2024-10-11 20:19:18,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914189398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:18,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:18,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:19:18,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986283359] [2024-10-11 20:19:18,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:18,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:19:18,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:18,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:19:18,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:19:18,526 INFO L87 Difference]: Start difference. First operand 95 states and 125 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:18,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:18,651 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2024-10-11 20:19:18,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:19:18,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 20:19:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:18,653 INFO L225 Difference]: With dead ends: 143 [2024-10-11 20:19:18,653 INFO L226 Difference]: Without dead ends: 139 [2024-10-11 20:19:18,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:19:18,654 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 122 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:18,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 84 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:18,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-11 20:19:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 123. [2024-10-11 20:19:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.7474747474747474) internal successors, (173), 122 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 173 transitions. [2024-10-11 20:19:18,663 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 173 transitions. Word has length 7 [2024-10-11 20:19:18,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:18,663 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 173 transitions. [2024-10-11 20:19:18,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 173 transitions. [2024-10-11 20:19:18,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 20:19:18,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:18,664 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:18,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:19:18,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:18,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:18,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1728719039, now seen corresponding path program 1 times [2024-10-11 20:19:18,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:18,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959582986] [2024-10-11 20:19:18,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:18,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:19:18,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:18,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959582986] [2024-10-11 20:19:18,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959582986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:18,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:18,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:19:18,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395265535] [2024-10-11 20:19:18,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:18,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:18,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:18,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:18,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:18,688 INFO L87 Difference]: Start difference. First operand 123 states and 173 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:18,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:18,729 INFO L93 Difference]: Finished difference Result 123 states and 173 transitions. [2024-10-11 20:19:18,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:18,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-10-11 20:19:18,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:18,731 INFO L225 Difference]: With dead ends: 123 [2024-10-11 20:19:18,731 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 20:19:18,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:18,732 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:18,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 24 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:18,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 20:19:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 89. [2024-10-11 20:19:18,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.6865671641791045) internal successors, (113), 88 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:18,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2024-10-11 20:19:18,743 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 10 [2024-10-11 20:19:18,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:18,743 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2024-10-11 20:19:18,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:18,743 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2024-10-11 20:19:18,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:19:18,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:18,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:18,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:19:18,744 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:18,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:18,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1330584021, now seen corresponding path program 1 times [2024-10-11 20:19:18,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:18,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514719861] [2024-10-11 20:19:18,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:18,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:18,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:18,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514719861] [2024-10-11 20:19:18,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514719861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:18,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:18,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:19:18,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676380869] [2024-10-11 20:19:18,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:18,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:18,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:18,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:18,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:18,793 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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) [2024-10-11 20:19:18,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:18,855 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions. [2024-10-11 20:19:18,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:18,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 [2024-10-11 20:19:18,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:18,856 INFO L225 Difference]: With dead ends: 89 [2024-10-11 20:19:18,856 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 20:19:18,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:18,857 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 32 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:18,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 27 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:18,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 20:19:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-11 20:19:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.671641791044776) internal successors, (112), 87 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2024-10-11 20:19:18,863 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 11 [2024-10-11 20:19:18,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:18,863 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2024-10-11 20:19:18,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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) [2024-10-11 20:19:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2024-10-11 20:19:18,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 20:19:18,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:18,864 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:18,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:19:18,864 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:18,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:18,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1701568167, now seen corresponding path program 1 times [2024-10-11 20:19:18,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:18,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728258258] [2024-10-11 20:19:18,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:18,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:18,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:18,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728258258] [2024-10-11 20:19:18,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728258258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:18,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:18,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:19:18,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382083150] [2024-10-11 20:19:18,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:18,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:18,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:18,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:18,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:18,886 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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) [2024-10-11 20:19:18,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:18,948 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2024-10-11 20:19:18,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:18,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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 [2024-10-11 20:19:18,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:18,949 INFO L225 Difference]: With dead ends: 125 [2024-10-11 20:19:18,949 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 20:19:18,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:18,950 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:18,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 46 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:18,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 20:19:18,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2024-10-11 20:19:18,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.711340206185567) internal successors, (166), 117 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) [2024-10-11 20:19:18,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2024-10-11 20:19:18,962 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 12 [2024-10-11 20:19:18,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:18,962 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2024-10-11 20:19:18,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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) [2024-10-11 20:19:18,963 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2024-10-11 20:19:18,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:19:18,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:18,963 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:18,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:19:18,964 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:18,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:18,964 INFO L85 PathProgramCache]: Analyzing trace with hash 684009175, now seen corresponding path program 1 times [2024-10-11 20:19:18,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:18,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787810594] [2024-10-11 20:19:18,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:18,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:19:19,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:19,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787810594] [2024-10-11 20:19:19,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787810594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:19,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:19,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:19:19,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668539863] [2024-10-11 20:19:19,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:19,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:19:19,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:19,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:19:19,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:19:19,013 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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) [2024-10-11 20:19:19,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:19,092 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2024-10-11 20:19:19,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:19:19,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 [2024-10-11 20:19:19,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:19,093 INFO L225 Difference]: With dead ends: 128 [2024-10-11 20:19:19,093 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 20:19:19,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:19:19,094 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 119 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:19,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 37 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 20:19:19,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 87. [2024-10-11 20:19:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.6818181818181819) internal successors, (111), 86 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2024-10-11 20:19:19,110 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 13 [2024-10-11 20:19:19,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:19,110 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 111 transitions. [2024-10-11 20:19:19,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2024-10-11 20:19:19,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:19:19,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:19,111 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:19,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:19:19,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:19,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:19,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1209012430, now seen corresponding path program 1 times [2024-10-11 20:19:19,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:19,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755428576] [2024-10-11 20:19:19,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:19,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:19,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:19,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:19,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755428576] [2024-10-11 20:19:19,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755428576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:19,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:19,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:19:19,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215207251] [2024-10-11 20:19:19,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:19,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:19:19,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:19,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:19:19,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:19:19,186 INFO L87 Difference]: Start difference. First operand 87 states and 111 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2024-10-11 20:19:19,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:19,269 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2024-10-11 20:19:19,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:19:19,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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 [2024-10-11 20:19:19,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:19,270 INFO L225 Difference]: With dead ends: 89 [2024-10-11 20:19:19,270 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 20:19:19,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:19:19,271 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 105 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:19,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 12 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:19,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 20:19:19,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2024-10-11 20:19:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 83 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2024-10-11 20:19:19,277 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 13 [2024-10-11 20:19:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:19,277 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2024-10-11 20:19:19,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2024-10-11 20:19:19,278 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2024-10-11 20:19:19,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:19:19,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:19,278 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:19,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:19:19,279 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:19,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:19,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1175320413, now seen corresponding path program 1 times [2024-10-11 20:19:19,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:19,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137696822] [2024-10-11 20:19:19,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:19,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:19,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:19,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137696822] [2024-10-11 20:19:19,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137696822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:19,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:19,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:19:19,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423347316] [2024-10-11 20:19:19,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:19,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:19:19,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:19,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:19:19,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:19:19,317 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:19,459 INFO L93 Difference]: Finished difference Result 165 states and 209 transitions. [2024-10-11 20:19:19,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:19:19,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 20:19:19,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:19,461 INFO L225 Difference]: With dead ends: 165 [2024-10-11 20:19:19,461 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 20:19:19,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:19:19,462 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 141 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:19,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 99 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 20:19:19,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 115. [2024-10-11 20:19:19,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 97 states have (on average 1.5463917525773196) internal successors, (150), 114 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:19,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 150 transitions. [2024-10-11 20:19:19,474 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 150 transitions. Word has length 14 [2024-10-11 20:19:19,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:19,474 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 150 transitions. [2024-10-11 20:19:19,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2024-10-11 20:19:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 20:19:19,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:19,475 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:19,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:19:19,475 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:19,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:19,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2081785279, now seen corresponding path program 1 times [2024-10-11 20:19:19,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:19,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816734824] [2024-10-11 20:19:19,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:19,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:19,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:19,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816734824] [2024-10-11 20:19:19,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816734824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:19,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:19,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:19:19,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173657390] [2024-10-11 20:19:19,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:19,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:19:19,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:19,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:19:19,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:19:19,533 INFO L87 Difference]: Start difference. First operand 115 states and 150 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:19,703 INFO L93 Difference]: Finished difference Result 273 states and 370 transitions. [2024-10-11 20:19:19,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:19:19,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 20:19:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:19,704 INFO L225 Difference]: With dead ends: 273 [2024-10-11 20:19:19,704 INFO L226 Difference]: Without dead ends: 190 [2024-10-11 20:19:19,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:19:19,705 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 167 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:19,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 26 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:19,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-11 20:19:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 181. [2024-10-11 20:19:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 163 states have (on average 1.5582822085889572) internal successors, (254), 180 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 254 transitions. [2024-10-11 20:19:19,717 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 254 transitions. Word has length 15 [2024-10-11 20:19:19,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:19,717 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 254 transitions. [2024-10-11 20:19:19,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 254 transitions. [2024-10-11 20:19:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 20:19:19,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:19,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:19,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 20:19:19,718 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:19,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:19,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1704744995, now seen corresponding path program 1 times [2024-10-11 20:19:19,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:19,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677631542] [2024-10-11 20:19:19,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:19,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:19,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:19,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677631542] [2024-10-11 20:19:19,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677631542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:19,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:19,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:19:19,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892167752] [2024-10-11 20:19:19,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:19,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:19:19,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:19,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:19:19,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:19:19,770 INFO L87 Difference]: Start difference. First operand 181 states and 254 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:20,002 INFO L93 Difference]: Finished difference Result 250 states and 347 transitions. [2024-10-11 20:19:20,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:19:20,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-10-11 20:19:20,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:20,005 INFO L225 Difference]: With dead ends: 250 [2024-10-11 20:19:20,006 INFO L226 Difference]: Without dead ends: 249 [2024-10-11 20:19:20,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:19:20,007 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 134 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:20,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 106 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:19:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-11 20:19:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 181. [2024-10-11 20:19:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 163 states have (on average 1.5521472392638036) internal successors, (253), 180 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 253 transitions. [2024-10-11 20:19:20,022 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 253 transitions. Word has length 19 [2024-10-11 20:19:20,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:20,022 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 253 transitions. [2024-10-11 20:19:20,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:20,022 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 253 transitions. [2024-10-11 20:19:20,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 20:19:20,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:20,024 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:20,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 20:19:20,024 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:20,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:20,025 INFO L85 PathProgramCache]: Analyzing trace with hash -567412206, now seen corresponding path program 1 times [2024-10-11 20:19:20,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:20,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198231442] [2024-10-11 20:19:20,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:20,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:19:20,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:20,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198231442] [2024-10-11 20:19:20,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198231442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:20,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:20,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:19:20,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231084126] [2024-10-11 20:19:20,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:20,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:19:20,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:20,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:19:20,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:19:20,085 INFO L87 Difference]: Start difference. First operand 181 states and 253 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:20,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:20,251 INFO L93 Difference]: Finished difference Result 190 states and 253 transitions. [2024-10-11 20:19:20,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:19:20,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2024-10-11 20:19:20,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:20,252 INFO L225 Difference]: With dead ends: 190 [2024-10-11 20:19:20,252 INFO L226 Difference]: Without dead ends: 187 [2024-10-11 20:19:20,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:19:20,252 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 141 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:20,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 43 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:20,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-11 20:19:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 181. [2024-10-11 20:19:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 163 states have (on average 1.5153374233128833) internal successors, (247), 180 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 247 transitions. [2024-10-11 20:19:20,264 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 247 transitions. Word has length 20 [2024-10-11 20:19:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:20,265 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 247 transitions. [2024-10-11 20:19:20,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 247 transitions. [2024-10-11 20:19:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 20:19:20,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:20,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:20,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 20:19:20,265 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:20,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:20,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1950305669, now seen corresponding path program 1 times [2024-10-11 20:19:20,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:20,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655330919] [2024-10-11 20:19:20,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:20,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:20,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:20,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:20,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655330919] [2024-10-11 20:19:20,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655330919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:20,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:20,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:19:20,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224556245] [2024-10-11 20:19:20,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:20,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:19:20,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:20,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:19:20,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:19:20,322 INFO L87 Difference]: Start difference. First operand 181 states and 247 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:20,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:20,416 INFO L93 Difference]: Finished difference Result 181 states and 247 transitions. [2024-10-11 20:19:20,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:19:20,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-11 20:19:20,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:20,417 INFO L225 Difference]: With dead ends: 181 [2024-10-11 20:19:20,417 INFO L226 Difference]: Without dead ends: 179 [2024-10-11 20:19:20,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:19:20,418 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:20,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 7 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-11 20:19:20,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-10-11 20:19:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 163 states have (on average 1.4417177914110428) internal successors, (235), 178 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 235 transitions. [2024-10-11 20:19:20,425 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 235 transitions. Word has length 22 [2024-10-11 20:19:20,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:20,425 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 235 transitions. [2024-10-11 20:19:20,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 235 transitions. [2024-10-11 20:19:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 20:19:20,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:20,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:20,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 20:19:20,426 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:20,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:20,426 INFO L85 PathProgramCache]: Analyzing trace with hash 329933699, now seen corresponding path program 1 times [2024-10-11 20:19:20,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:20,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347871191] [2024-10-11 20:19:20,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:20,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:20,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:20,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347871191] [2024-10-11 20:19:20,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347871191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:20,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:20,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:19:20,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761014413] [2024-10-11 20:19:20,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:20,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:19:20,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:20,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:19:20,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:19:20,464 INFO L87 Difference]: Start difference. First operand 179 states and 235 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 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) [2024-10-11 20:19:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:20,634 INFO L93 Difference]: Finished difference Result 279 states and 368 transitions. [2024-10-11 20:19:20,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:19:20,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 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 [2024-10-11 20:19:20,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:20,635 INFO L225 Difference]: With dead ends: 279 [2024-10-11 20:19:20,635 INFO L226 Difference]: Without dead ends: 277 [2024-10-11 20:19:20,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:19:20,636 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 207 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:20,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 106 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:20,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-11 20:19:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 197. [2024-10-11 20:19:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 181 states have (on average 1.408839779005525) internal successors, (255), 196 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 255 transitions. [2024-10-11 20:19:20,644 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 255 transitions. Word has length 23 [2024-10-11 20:19:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:20,644 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 255 transitions. [2024-10-11 20:19:20,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 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) [2024-10-11 20:19:20,644 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 255 transitions. [2024-10-11 20:19:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 20:19:20,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:20,645 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:20,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 20:19:20,645 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:20,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:20,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1261302200, now seen corresponding path program 1 times [2024-10-11 20:19:20,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:20,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236398462] [2024-10-11 20:19:20,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:20,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:19:20,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:20,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236398462] [2024-10-11 20:19:20,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236398462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:20,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:20,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:19:20,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691712729] [2024-10-11 20:19:20,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:20,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:19:20,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:20,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:19:20,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:19:20,672 INFO L87 Difference]: Start difference. First operand 197 states and 255 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:20,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:20,756 INFO L93 Difference]: Finished difference Result 203 states and 255 transitions. [2024-10-11 20:19:20,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:19:20,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-11 20:19:20,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:20,757 INFO L225 Difference]: With dead ends: 203 [2024-10-11 20:19:20,757 INFO L226 Difference]: Without dead ends: 202 [2024-10-11 20:19:20,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:19:20,758 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 134 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:20,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 45 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:20,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-11 20:19:20,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2024-10-11 20:19:20,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 181 states have (on average 1.4033149171270718) internal successors, (254), 196 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 254 transitions. [2024-10-11 20:19:20,767 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 254 transitions. Word has length 25 [2024-10-11 20:19:20,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:20,767 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 254 transitions. [2024-10-11 20:19:20,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 254 transitions. [2024-10-11 20:19:20,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 20:19:20,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:20,767 INFO L215 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, 1] [2024-10-11 20:19:20,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 20:19:20,767 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:20,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:20,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1564486126, now seen corresponding path program 1 times [2024-10-11 20:19:20,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:20,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853841392] [2024-10-11 20:19:20,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:20,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:20,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:19:20,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:20,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853841392] [2024-10-11 20:19:20,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853841392] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:19:20,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526069706] [2024-10-11 20:19:20,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:20,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:20,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:19:20,812 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:19:20,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:19:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:20,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:19:20,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:19:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:20,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:19:20,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526069706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:20,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:19:20,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 8 [2024-10-11 20:19:20,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656896307] [2024-10-11 20:19:20,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:20,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:19:20,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:20,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:19:20,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:19:20,995 INFO L87 Difference]: Start difference. First operand 197 states and 254 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:21,112 INFO L93 Difference]: Finished difference Result 399 states and 519 transitions. [2024-10-11 20:19:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:19:21,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-11 20:19:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:21,114 INFO L225 Difference]: With dead ends: 399 [2024-10-11 20:19:21,114 INFO L226 Difference]: Without dead ends: 241 [2024-10-11 20:19:21,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:19:21,116 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 136 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:21,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 30 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:21,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-11 20:19:21,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 230. [2024-10-11 20:19:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 214 states have (on average 1.4205607476635513) internal successors, (304), 229 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 304 transitions. [2024-10-11 20:19:21,129 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 304 transitions. Word has length 25 [2024-10-11 20:19:21,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:21,130 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 304 transitions. [2024-10-11 20:19:21,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 304 transitions. [2024-10-11 20:19:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 20:19:21,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:21,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:21,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 20:19:21,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 20:19:21,336 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:21,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:21,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1456947920, now seen corresponding path program 1 times [2024-10-11 20:19:21,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:21,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934401367] [2024-10-11 20:19:21,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:21,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:21,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:21,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:21,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934401367] [2024-10-11 20:19:21,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934401367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:21,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:21,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:19:21,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177206731] [2024-10-11 20:19:21,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:21,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:21,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:21,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:21,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:21,360 INFO L87 Difference]: Start difference. First operand 230 states and 304 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:21,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:21,381 INFO L93 Difference]: Finished difference Result 230 states and 304 transitions. [2024-10-11 20:19:21,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:21,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2024-10-11 20:19:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:21,382 INFO L225 Difference]: With dead ends: 230 [2024-10-11 20:19:21,382 INFO L226 Difference]: Without dead ends: 229 [2024-10-11 20:19:21,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:21,383 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:21,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:21,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-11 20:19:21,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-10-11 20:19:21,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 214 states have (on average 1.3785046728971964) internal successors, (295), 228 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 295 transitions. [2024-10-11 20:19:21,394 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 295 transitions. Word has length 27 [2024-10-11 20:19:21,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:21,394 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 295 transitions. [2024-10-11 20:19:21,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:21,395 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 295 transitions. [2024-10-11 20:19:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 20:19:21,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:21,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:21,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 20:19:21,395 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:21,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:21,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1456947865, now seen corresponding path program 1 times [2024-10-11 20:19:21,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:21,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482343755] [2024-10-11 20:19:21,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:21,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:21,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:21,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482343755] [2024-10-11 20:19:21,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482343755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:21,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:21,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:19:21,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203586116] [2024-10-11 20:19:21,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:21,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:21,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:21,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:21,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:21,418 INFO L87 Difference]: Start difference. First operand 229 states and 295 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:21,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:21,436 INFO L93 Difference]: Finished difference Result 438 states and 576 transitions. [2024-10-11 20:19:21,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:21,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2024-10-11 20:19:21,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:21,437 INFO L225 Difference]: With dead ends: 438 [2024-10-11 20:19:21,437 INFO L226 Difference]: Without dead ends: 237 [2024-10-11 20:19:21,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:21,440 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:21,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:21,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-11 20:19:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 213. [2024-10-11 20:19:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 199 states have (on average 1.321608040201005) internal successors, (263), 212 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 263 transitions. [2024-10-11 20:19:21,449 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 263 transitions. Word has length 27 [2024-10-11 20:19:21,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:21,450 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 263 transitions. [2024-10-11 20:19:21,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:21,450 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 263 transitions. [2024-10-11 20:19:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 20:19:21,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:21,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:21,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 20:19:21,451 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:21,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:21,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2079256562, now seen corresponding path program 1 times [2024-10-11 20:19:21,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:21,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135345272] [2024-10-11 20:19:21,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:21,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:21,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:21,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135345272] [2024-10-11 20:19:21,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135345272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:21,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:21,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:19:21,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391911355] [2024-10-11 20:19:21,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:21,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:19:21,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:21,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:19:21,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:19:21,506 INFO L87 Difference]: Start difference. First operand 213 states and 263 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:21,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:21,735 INFO L93 Difference]: Finished difference Result 298 states and 376 transitions. [2024-10-11 20:19:21,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:19:21,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-11 20:19:21,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:21,737 INFO L225 Difference]: With dead ends: 298 [2024-10-11 20:19:21,737 INFO L226 Difference]: Without dead ends: 294 [2024-10-11 20:19:21,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:19:21,737 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 180 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:21,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 96 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:19:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-11 20:19:21,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 214. [2024-10-11 20:19:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 200 states have (on average 1.315) internal successors, (263), 213 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 263 transitions. [2024-10-11 20:19:21,748 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 263 transitions. Word has length 28 [2024-10-11 20:19:21,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:21,748 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 263 transitions. [2024-10-11 20:19:21,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 263 transitions. [2024-10-11 20:19:21,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 20:19:21,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:21,749 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:21,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 20:19:21,749 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:21,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:21,750 INFO L85 PathProgramCache]: Analyzing trace with hash -363226002, now seen corresponding path program 1 times [2024-10-11 20:19:21,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:21,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747161596] [2024-10-11 20:19:21,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:21,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:21,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:19:21,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:21,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747161596] [2024-10-11 20:19:21,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747161596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:21,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:21,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:19:21,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556478882] [2024-10-11 20:19:21,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:21,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:19:21,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:21,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:19:21,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:19:21,795 INFO L87 Difference]: Start difference. First operand 214 states and 263 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:21,933 INFO L93 Difference]: Finished difference Result 240 states and 291 transitions. [2024-10-11 20:19:21,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:19:21,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-11 20:19:21,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:21,934 INFO L225 Difference]: With dead ends: 240 [2024-10-11 20:19:21,934 INFO L226 Difference]: Without dead ends: 238 [2024-10-11 20:19:21,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:19:21,935 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 186 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:21,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 40 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:21,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-11 20:19:21,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 223. [2024-10-11 20:19:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 222 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 271 transitions. [2024-10-11 20:19:21,945 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 271 transitions. Word has length 29 [2024-10-11 20:19:21,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:21,945 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 271 transitions. [2024-10-11 20:19:21,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 271 transitions. [2024-10-11 20:19:21,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 20:19:21,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:21,946 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:21,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 20:19:21,947 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:21,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:21,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1694133785, now seen corresponding path program 1 times [2024-10-11 20:19:21,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:21,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145422292] [2024-10-11 20:19:21,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:21,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:19:22,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:22,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145422292] [2024-10-11 20:19:22,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145422292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:22,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:22,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:19:22,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140466227] [2024-10-11 20:19:22,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:22,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:19:22,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:22,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:19:22,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:19:22,020 INFO L87 Difference]: Start difference. First operand 223 states and 271 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:22,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:22,189 INFO L93 Difference]: Finished difference Result 238 states and 287 transitions. [2024-10-11 20:19:22,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:19:22,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 20:19:22,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:22,190 INFO L225 Difference]: With dead ends: 238 [2024-10-11 20:19:22,190 INFO L226 Difference]: Without dead ends: 234 [2024-10-11 20:19:22,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:19:22,191 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 180 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:22,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 40 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-11 20:19:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 153. [2024-10-11 20:19:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 152 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 186 transitions. [2024-10-11 20:19:22,198 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 186 transitions. Word has length 34 [2024-10-11 20:19:22,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:22,198 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 186 transitions. [2024-10-11 20:19:22,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 186 transitions. [2024-10-11 20:19:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 20:19:22,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:22,199 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:22,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 20:19:22,199 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-11 20:19:22,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:22,200 INFO L85 PathProgramCache]: Analyzing trace with hash -316492974, now seen corresponding path program 1 times [2024-10-11 20:19:22,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:22,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931752282] [2024-10-11 20:19:22,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:22,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:22,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:22,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:22,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931752282] [2024-10-11 20:19:22,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931752282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:22,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:22,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:19:22,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13007544] [2024-10-11 20:19:22,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:22,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:19:22,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:22,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:19:22,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:19:22,246 INFO L87 Difference]: Start difference. First operand 153 states and 186 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:22,324 INFO L93 Difference]: Finished difference Result 180 states and 214 transitions. [2024-10-11 20:19:22,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:19:22,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-11 20:19:22,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:22,324 INFO L225 Difference]: With dead ends: 180 [2024-10-11 20:19:22,324 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:19:22,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:19:22,325 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:22,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:22,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:19:22,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:19:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:19:22,326 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2024-10-11 20:19:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:22,326 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:19:22,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:22,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:19:22,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:19:22,328 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2024-10-11 20:19:22,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2024-10-11 20:19:22,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2024-10-11 20:19:22,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2024-10-11 20:19:22,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2024-10-11 20:19:22,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2024-10-11 20:19:22,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2024-10-11 20:19:22,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2024-10-11 20:19:22,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2024-10-11 20:19:22,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2024-10-11 20:19:22,330 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2024-10-11 20:19:22,330 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2024-10-11 20:19:22,330 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2024-10-11 20:19:22,330 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2024-10-11 20:19:22,330 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2024-10-11 20:19:22,330 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2024-10-11 20:19:22,330 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2024-10-11 20:19:22,330 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2024-10-11 20:19:22,330 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2024-10-11 20:19:22,330 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2024-10-11 20:19:22,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2024-10-11 20:19:22,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2024-10-11 20:19:22,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2024-10-11 20:19:22,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2024-10-11 20:19:22,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2024-10-11 20:19:22,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2024-10-11 20:19:22,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2024-10-11 20:19:22,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2024-10-11 20:19:22,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2024-10-11 20:19:22,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2024-10-11 20:19:22,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 20:19:22,333 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:22,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:19:23,633 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:19:23,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:19:23 BoogieIcfgContainer [2024-10-11 20:19:23,655 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:19:23,655 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:19:23,655 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:19:23,655 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:19:23,656 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:19:17" (3/4) ... [2024-10-11 20:19:23,657 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:19:23,673 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 20:19:23,673 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 20:19:23,674 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 20:19:23,769 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:19:23,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:19:23,774 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:19:23,774 INFO L158 Benchmark]: Toolchain (without parser) took 6702.88ms. Allocated memory was 146.8MB in the beginning and 249.6MB in the end (delta: 102.8MB). Free memory was 80.1MB in the beginning and 191.3MB in the end (delta: -111.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:19:23,774 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 105.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:19:23,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.10ms. Allocated memory is still 146.8MB. Free memory was 79.9MB in the beginning and 117.0MB in the end (delta: -37.1MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-10-11 20:19:23,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.52ms. Allocated memory is still 146.8MB. Free memory was 117.0MB in the beginning and 115.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:19:23,775 INFO L158 Benchmark]: Boogie Preprocessor took 28.85ms. Allocated memory is still 146.8MB. Free memory was 115.2MB in the beginning and 113.8MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:19:23,775 INFO L158 Benchmark]: RCFGBuilder took 304.97ms. Allocated memory is still 146.8MB. Free memory was 113.8MB in the beginning and 99.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 20:19:23,775 INFO L158 Benchmark]: TraceAbstraction took 6026.62ms. Allocated memory was 146.8MB in the beginning and 249.6MB in the end (delta: 102.8MB). Free memory was 98.6MB in the beginning and 196.6MB in the end (delta: -98.0MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. [2024-10-11 20:19:23,775 INFO L158 Benchmark]: Witness Printer took 118.36ms. Allocated memory is still 249.6MB. Free memory was 196.6MB in the beginning and 191.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:19:23,776 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.14ms. Allocated memory is still 146.8MB. Free memory is still 105.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.10ms. Allocated memory is still 146.8MB. Free memory was 79.9MB in the beginning and 117.0MB in the end (delta: -37.1MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.52ms. Allocated memory is still 146.8MB. Free memory was 117.0MB in the beginning and 115.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.85ms. Allocated memory is still 146.8MB. Free memory was 115.2MB in the beginning and 113.8MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 304.97ms. Allocated memory is still 146.8MB. Free memory was 113.8MB in the beginning and 99.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6026.62ms. Allocated memory was 146.8MB in the beginning and 249.6MB in the end (delta: 102.8MB). Free memory was 98.6MB in the beginning and 196.6MB in the end (delta: -98.0MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. * Witness Printer took 118.36ms. Allocated memory is still 249.6MB. Free memory was 196.6MB in the beginning and 191.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: 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, 68 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2400 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2400 mSDsluCounter, 1130 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 718 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3029 IncrementalHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 412 mSDtfsCounter, 3029 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=17, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 527 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 447 NumberOfCodeBlocks, 447 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 423 ConstructedInterpolants, 0 QuantifiedInterpolants, 1674 SizeOfPredicates, 3 NumberOfNonLiveVariables, 42 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 24 InterpolantComputations, 23 PerfectInterpolantSequences, 38/41 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((((((((long) i + j) <= 99) && (0 <= (((long) i + j) + k))) && (0 <= m)) && (0 <= j)) && (((((long) i + j) + k) + l) <= 201)) && (0 <= i)) && (m <= 1201)) && (0 <= l)) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((l == 0) && (k <= 102)) && (0 <= i)) && (7 <= b)) && (j == 0)) && (((long) 3 + i) <= k)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((i <= 99) && (0 <= i)) && (j == 0)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((k <= 102) && (0 <= i)) && (j == 0)) && (((long) 3 + i) <= k)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (0 <= i) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:19:23,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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