./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_09_good.i --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/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_09_good.i -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 eca0a68ea7ca552fd05d393ac68a52cb42c0731f037187d214ec602b1fe0f2a3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:33:21,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:33:21,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 22:33:21,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:33:21,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:33:21,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:33:21,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:33:21,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:33:21,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:33:21,472 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:33:21,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:33:21,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:33:21,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:33:21,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:33:21,473 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:33:21,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:33:21,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:33:21,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 22:33:21,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:33:21,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:33:21,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:33:21,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:33:21,478 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:33:21,478 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:33:21,478 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:33:21,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:33:21,478 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:33:21,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:33:21,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:33:21,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:33:21,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:33:21,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:33:21,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:33:21,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:33:21,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:33:21,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 22:33:21,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 22:33:21,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:33:21,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:33:21,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:33:21,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:33:21,482 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 -> eca0a68ea7ca552fd05d393ac68a52cb42c0731f037187d214ec602b1fe0f2a3 [2024-10-11 22:33:21,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:33:21,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:33:21,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:33:21,753 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:33:21,754 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:33:21,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_09_good.i [2024-10-11 22:33:23,048 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:33:23,330 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:33:23,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_09_good.i [2024-10-11 22:33:23,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/50c36d7f3/9dbd46fc70a94a6f9ce46750e1f8b928/FLAGdb9a381e0 [2024-10-11 22:33:23,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/50c36d7f3/9dbd46fc70a94a6f9ce46750e1f8b928 [2024-10-11 22:33:23,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:33:23,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:33:23,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:33:23,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:33:23,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:33:23,387 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:33:23" (1/1) ... [2024-10-11 22:33:23,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@787b35df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:23, skipping insertion in model container [2024-10-11 22:33:23,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:33:23" (1/1) ... [2024-10-11 22:33:23,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:33:24,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:33:24,101 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:33:24,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:33:24,255 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:33:24,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:24 WrapperNode [2024-10-11 22:33:24,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:33:24,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:33:24,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:33:24,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:33:24,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:24" (1/1) ... [2024-10-11 22:33:24,287 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:24" (1/1) ... [2024-10-11 22:33:24,312 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 217 [2024-10-11 22:33:24,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:33:24,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:33:24,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:33:24,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:33:24,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:24" (1/1) ... [2024-10-11 22:33:24,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:24" (1/1) ... [2024-10-11 22:33:24,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:24" (1/1) ... [2024-10-11 22:33:24,339 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:33:24,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:24" (1/1) ... [2024-10-11 22:33:24,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:24" (1/1) ... [2024-10-11 22:33:24,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:24" (1/1) ... [2024-10-11 22:33:24,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:24" (1/1) ... [2024-10-11 22:33:24,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:24" (1/1) ... [2024-10-11 22:33:24,356 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:24" (1/1) ... [2024-10-11 22:33:24,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:33:24,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:33:24,361 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:33:24,361 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:33:24,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:24" (1/1) ... [2024-10-11 22:33:24,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:33:24,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:33:24,396 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 22:33:24,399 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 22:33:24,459 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 22:33:24,460 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 22:33:24,460 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:33:24,460 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:33:24,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:33:24,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:33:24,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:33:24,586 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:33:24,587 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:33:24,889 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-10-11 22:33:24,890 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:33:24,912 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:33:24,912 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:33:24,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:33:24 BoogieIcfgContainer [2024-10-11 22:33:24,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:33:24,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:33:24,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:33:24,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:33:24,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:33:23" (1/3) ... [2024-10-11 22:33:24,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edb2a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:33:24, skipping insertion in model container [2024-10-11 22:33:24,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:24" (2/3) ... [2024-10-11 22:33:24,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edb2a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:33:24, skipping insertion in model container [2024-10-11 22:33:24,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:33:24" (3/3) ... [2024-10-11 22:33:24,923 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_09_good.i [2024-10-11 22:33:24,934 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:33:24,934 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 22:33:24,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:33:24,992 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;@113c4d66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:33:24,992 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 22:33:24,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 89 states have internal predecessors, (126), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 22:33:25,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 22:33:25,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:25,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:33:25,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:33:25,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:25,005 INFO L85 PathProgramCache]: Analyzing trace with hash -611380514, now seen corresponding path program 1 times [2024-10-11 22:33:25,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:25,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332002743] [2024-10-11 22:33:25,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:25,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:25,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:25,246 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 22:33:25,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:25,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332002743] [2024-10-11 22:33:25,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332002743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:25,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:25,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:33:25,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244305542] [2024-10-11 22:33:25,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:25,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:33:25,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:25,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:33:25,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:33:25,275 INFO L87 Difference]: Start difference. First operand has 102 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 89 states have internal predecessors, (126), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:33:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:25,334 INFO L93 Difference]: Finished difference Result 178 states and 251 transitions. [2024-10-11 22:33:25,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:33:25,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 22:33:25,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:25,345 INFO L225 Difference]: With dead ends: 178 [2024-10-11 22:33:25,345 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 22:33:25,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 22:33:25,353 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 137 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:25,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 130 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:25,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 22:33:25,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-11 22:33:25,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 85 states have internal predecessors, (116), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 22:33:25,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 132 transitions. [2024-10-11 22:33:25,392 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 132 transitions. Word has length 11 [2024-10-11 22:33:25,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:25,393 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 132 transitions. [2024-10-11 22:33:25,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:33:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 132 transitions. [2024-10-11 22:33:25,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 22:33:25,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:25,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:33:25,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 22:33:25,395 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:33:25,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:25,396 INFO L85 PathProgramCache]: Analyzing trace with hash 750401249, now seen corresponding path program 1 times [2024-10-11 22:33:25,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:25,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869439071] [2024-10-11 22:33:25,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:25,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:25,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:25,554 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 22:33:25,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:25,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869439071] [2024-10-11 22:33:25,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869439071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:25,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:25,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:33:25,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866287347] [2024-10-11 22:33:25,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:25,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:33:25,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:25,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:33:25,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:33:25,557 INFO L87 Difference]: Start difference. First operand 96 states and 132 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:33:25,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:25,603 INFO L93 Difference]: Finished difference Result 97 states and 133 transitions. [2024-10-11 22:33:25,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:33:25,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-11 22:33:25,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:25,607 INFO L225 Difference]: With dead ends: 97 [2024-10-11 22:33:25,607 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 22:33:25,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:33:25,610 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 38 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:25,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 329 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:25,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 22:33:25,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-11 22:33:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 84 states have internal predecessors, (115), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 22:33:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 131 transitions. [2024-10-11 22:33:25,630 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 131 transitions. Word has length 17 [2024-10-11 22:33:25,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:25,630 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 131 transitions. [2024-10-11 22:33:25,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:33:25,631 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 131 transitions. [2024-10-11 22:33:25,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 22:33:25,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:25,632 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:33:25,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 22:33:25,632 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:33:25,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:25,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1787602382, now seen corresponding path program 1 times [2024-10-11 22:33:25,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:25,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969051043] [2024-10-11 22:33:25,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:25,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:25,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:25,762 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 22:33:25,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:25,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969051043] [2024-10-11 22:33:25,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969051043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:25,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:25,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:33:25,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381148159] [2024-10-11 22:33:25,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:25,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:33:25,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:25,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:33:25,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:33:25,766 INFO L87 Difference]: Start difference. First operand 95 states and 131 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:33:25,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:25,787 INFO L93 Difference]: Finished difference Result 95 states and 131 transitions. [2024-10-11 22:33:25,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:33:25,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-11 22:33:25,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:25,791 INFO L225 Difference]: With dead ends: 95 [2024-10-11 22:33:25,791 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 22:33:25,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 22:33:25,793 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:25,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:25,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 22:33:25,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 22:33:25,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 78 states have (on average 1.4615384615384615) internal successors, (114), 83 states have internal predecessors, (114), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 22:33:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions. [2024-10-11 22:33:25,804 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 130 transitions. Word has length 18 [2024-10-11 22:33:25,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:25,804 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 130 transitions. [2024-10-11 22:33:25,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:33:25,804 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2024-10-11 22:33:25,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 22:33:25,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:25,805 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] [2024-10-11 22:33:25,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 22:33:25,806 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:33:25,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:25,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1687734794, now seen corresponding path program 1 times [2024-10-11 22:33:25,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:25,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378400673] [2024-10-11 22:33:25,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:25,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:25,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:25,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 22:33:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 22:33:25,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:25,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378400673] [2024-10-11 22:33:25,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378400673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:25,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:25,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:33:25,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425889264] [2024-10-11 22:33:25,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:25,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:33:25,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:25,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:33:25,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:33:25,887 INFO L87 Difference]: Start difference. First operand 94 states and 130 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 22:33:25,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:25,909 INFO L93 Difference]: Finished difference Result 150 states and 202 transitions. [2024-10-11 22:33:25,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:33:25,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-10-11 22:33:25,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:25,913 INFO L225 Difference]: With dead ends: 150 [2024-10-11 22:33:25,913 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 22:33:25,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 22:33:25,917 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 112 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:25,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:25,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 22:33:25,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 22:33:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 81 states have internal predecessors, (110), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 22:33:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 122 transitions. [2024-10-11 22:33:25,930 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 122 transitions. Word has length 32 [2024-10-11 22:33:25,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:25,931 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 122 transitions. [2024-10-11 22:33:25,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 22:33:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 122 transitions. [2024-10-11 22:33:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 22:33:25,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:25,932 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] [2024-10-11 22:33:25,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 22:33:25,932 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:33:25,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:25,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1281517514, now seen corresponding path program 1 times [2024-10-11 22:33:25,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:25,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449497015] [2024-10-11 22:33:25,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:25,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:26,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:26,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 22:33:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:26,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 22:33:26,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:26,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449497015] [2024-10-11 22:33:26,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449497015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:26,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:26,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:33:26,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135056473] [2024-10-11 22:33:26,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:26,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:33:26,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:26,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:33:26,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:33:26,072 INFO L87 Difference]: Start difference. First operand 90 states and 122 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:33:26,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:26,103 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2024-10-11 22:33:26,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:33:26,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-10-11 22:33:26,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:26,107 INFO L225 Difference]: With dead ends: 90 [2024-10-11 22:33:26,107 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 22:33:26,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:33:26,108 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 36 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:26,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 301 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:26,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 22:33:26,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 22:33:26,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 80 states have internal predecessors, (109), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 22:33:26,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2024-10-11 22:33:26,120 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 33 [2024-10-11 22:33:26,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:26,121 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2024-10-11 22:33:26,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:33:26,121 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2024-10-11 22:33:26,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 22:33:26,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:26,122 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 22:33:26,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 22:33:26,122 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:33:26,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:26,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1072337516, now seen corresponding path program 1 times [2024-10-11 22:33:26,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:26,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112258703] [2024-10-11 22:33:26,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:26,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:26,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:26,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 22:33:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:26,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 22:33:26,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:26,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112258703] [2024-10-11 22:33:26,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112258703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:26,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:26,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:33:26,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539976308] [2024-10-11 22:33:26,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:26,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:33:26,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:26,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:33:26,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:33:26,216 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:33:26,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:26,234 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2024-10-11 22:33:26,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:33:26,234 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-10-11 22:33:26,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:26,235 INFO L225 Difference]: With dead ends: 89 [2024-10-11 22:33:26,235 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 22:33:26,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 22:33:26,236 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:26,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:26,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 22:33:26,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-11 22:33:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 79 states have internal predecessors, (108), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 22:33:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2024-10-11 22:33:26,249 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 34 [2024-10-11 22:33:26,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:26,250 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2024-10-11 22:33:26,250 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:33:26,250 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2024-10-11 22:33:26,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 22:33:26,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:26,251 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:33:26,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 22:33:26,253 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:33:26,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:26,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1700673409, now seen corresponding path program 1 times [2024-10-11 22:33:26,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:26,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011148370] [2024-10-11 22:33:26,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:26,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:26,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:26,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 22:33:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:26,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 22:33:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 22:33:26,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:26,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011148370] [2024-10-11 22:33:26,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011148370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:26,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:26,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:33:26,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143589732] [2024-10-11 22:33:26,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:26,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:33:26,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:26,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:33:26,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:33:26,340 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:33:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:26,366 INFO L93 Difference]: Finished difference Result 88 states and 120 transitions. [2024-10-11 22:33:26,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:33:26,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-10-11 22:33:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:26,367 INFO L225 Difference]: With dead ends: 88 [2024-10-11 22:33:26,367 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 22:33:26,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:33:26,368 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 334 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 22:33:26,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 334 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:26,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 22:33:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 22:33:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 22:33:26,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2024-10-11 22:33:26,378 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 42 [2024-10-11 22:33:26,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:26,379 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2024-10-11 22:33:26,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:33:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2024-10-11 22:33:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 22:33:26,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:26,382 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:33:26,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 22:33:26,383 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:33:26,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:26,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1349846130, now seen corresponding path program 1 times [2024-10-11 22:33:26,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:26,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185825024] [2024-10-11 22:33:26,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:26,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:26,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:26,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 22:33:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:26,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 22:33:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:26,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 22:33:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 22:33:26,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:26,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185825024] [2024-10-11 22:33:26,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185825024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:26,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:26,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:33:26,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55360044] [2024-10-11 22:33:26,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:26,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:33:26,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:26,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:33:26,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:33:26,476 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 22:33:26,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:26,492 INFO L93 Difference]: Finished difference Result 86 states and 118 transitions. [2024-10-11 22:33:26,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:33:26,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2024-10-11 22:33:26,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:26,493 INFO L225 Difference]: With dead ends: 86 [2024-10-11 22:33:26,493 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 22:33:26,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:33:26,495 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:26,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 333 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:26,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 22:33:26,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 22:33:26,496 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 22:33:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 22:33:26,496 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2024-10-11 22:33:26,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:26,496 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 22:33:26,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 22:33:26,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 22:33:26,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 22:33:26,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 22:33:26,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 22:33:26,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 22:33:26,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 22:33:26,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 22:33:26,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 22:33:26,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 22:33:26,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 22:33:26,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 22:33:26,507 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:33:26,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 22:33:26,597 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:33:26,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:33:26 BoogieIcfgContainer [2024-10-11 22:33:26,616 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:33:26,617 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:33:26,617 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:33:26,617 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:33:26,618 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:33:24" (3/4) ... [2024-10-11 22:33:26,619 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 22:33:26,622 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 22:33:26,623 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 22:33:26,630 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-11 22:33:26,631 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-11 22:33:26,631 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 22:33:26,631 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 22:33:26,734 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 22:33:26,734 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 22:33:26,735 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 22:33:26,735 INFO L158 Benchmark]: Toolchain (without parser) took 3359.54ms. Allocated memory was 155.2MB in the beginning and 190.8MB in the end (delta: 35.7MB). Free memory was 73.6MB in the beginning and 94.5MB in the end (delta: -20.9MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-10-11 22:33:26,735 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:33:26,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 878.68ms. Allocated memory is still 155.2MB. Free memory was 73.4MB in the beginning and 67.5MB in the end (delta: 5.9MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-10-11 22:33:26,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.14ms. Allocated memory is still 155.2MB. Free memory was 67.5MB in the beginning and 64.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:33:26,736 INFO L158 Benchmark]: Boogie Preprocessor took 45.56ms. Allocated memory is still 155.2MB. Free memory was 64.5MB in the beginning and 61.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 22:33:26,736 INFO L158 Benchmark]: RCFGBuilder took 552.22ms. Allocated memory is still 155.2MB. Free memory was 61.4MB in the beginning and 99.1MB in the end (delta: -37.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 22:33:26,737 INFO L158 Benchmark]: TraceAbstraction took 1702.55ms. Allocated memory was 155.2MB in the beginning and 190.8MB in the end (delta: 35.7MB). Free memory was 99.1MB in the beginning and 101.8MB in the end (delta: -2.8MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2024-10-11 22:33:26,737 INFO L158 Benchmark]: Witness Printer took 117.85ms. Allocated memory is still 190.8MB. Free memory was 101.8MB in the beginning and 94.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 22:33:26,738 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 878.68ms. Allocated memory is still 155.2MB. Free memory was 73.4MB in the beginning and 67.5MB in the end (delta: 5.9MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.14ms. Allocated memory is still 155.2MB. Free memory was 67.5MB in the beginning and 64.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.56ms. Allocated memory is still 155.2MB. Free memory was 64.5MB in the beginning and 61.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 552.22ms. Allocated memory is still 155.2MB. Free memory was 61.4MB in the beginning and 99.1MB in the end (delta: -37.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1702.55ms. Allocated memory was 155.2MB in the beginning and 190.8MB in the end (delta: 35.7MB). Free memory was 99.1MB in the beginning and 101.8MB in the end (delta: -2.8MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * Witness Printer took 117.85ms. Allocated memory is still 190.8MB. Free memory was 101.8MB in the beginning and 94.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 102 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 326 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 325 mSDsluCounter, 2023 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1069 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 954 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 296 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 22/22 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - ProcedureContractResult [Line: 1412]: Procedure Contract for printLine Derived contract for procedure printLine. Requires: (GLOBAL_CONST_TRUE == 1) Ensures: (GLOBAL_CONST_TRUE == 1) - ProcedureContractResult [Line: 1426]: Procedure Contract for printIntLine Derived contract for procedure printIntLine. Requires: (GLOBAL_CONST_TRUE == 1) Ensures: (GLOBAL_CONST_TRUE == 1) RESULT: Ultimate proved your program to be correct! [2024-10-11 22:33:26,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE