./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_fscanf_postinc_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_15_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash aa9f39e01a170e3a12e1ce2d761b331c4bdb8c400cf580500138f9c10d8cb063 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 14:56:09,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 14:56:09,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 14:56:09,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 14:56:09,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 14:56:09,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 14:56:09,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 14:56:09,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 14:56:09,141 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 14:56:09,142 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 14:56:09,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 14:56:09,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 14:56:09,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 14:56:09,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 14:56:09,144 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 14:56:09,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 14:56:09,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 14:56:09,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 14:56:09,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 14:56:09,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 14:56:09,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 14:56:09,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 14:56:09,150 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 14:56:09,150 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 14:56:09,151 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 14:56:09,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 14:56:09,151 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 14:56:09,154 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 14:56:09,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 14:56:09,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 14:56:09,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 14:56:09,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 14:56:09,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 14:56:09,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 14:56:09,156 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 14:56:09,156 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 14:56:09,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 14:56:09,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 14:56:09,157 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 14:56:09,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 14:56:09,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 14:56:09,159 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/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/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 -> aa9f39e01a170e3a12e1ce2d761b331c4bdb8c400cf580500138f9c10d8cb063 [2024-10-13 14:56:09,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 14:56:09,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 14:56:09,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 14:56:09,443 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 14:56:09,444 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 14:56:09,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_15_good.i [2024-10-13 14:56:10,977 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 14:56:11,316 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 14:56:11,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_15_good.i [2024-10-13 14:56:11,352 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3f8f64de/a07969ce72ab4be99dd9a99da4cfa770/FLAG63e3c2d0b [2024-10-13 14:56:11,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3f8f64de/a07969ce72ab4be99dd9a99da4cfa770 [2024-10-13 14:56:11,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 14:56:11,371 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 14:56:11,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 14:56:11,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 14:56:11,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 14:56:11,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:56:11" (1/1) ... [2024-10-13 14:56:11,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@676f36ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:11, skipping insertion in model container [2024-10-13 14:56:11,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:56:11" (1/1) ... [2024-10-13 14:56:11,443 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 14:56:12,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 14:56:12,128 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 14:56:12,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 14:56:12,415 INFO L204 MainTranslator]: Completed translation [2024-10-13 14:56:12,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:12 WrapperNode [2024-10-13 14:56:12,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 14:56:12,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 14:56:12,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 14:56:12,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 14:56:12,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:12" (1/1) ... [2024-10-13 14:56:12,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:12" (1/1) ... [2024-10-13 14:56:12,489 INFO L138 Inliner]: procedures = 501, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 209 [2024-10-13 14:56:12,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 14:56:12,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 14:56:12,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 14:56:12,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 14:56:12,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:12" (1/1) ... [2024-10-13 14:56:12,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:12" (1/1) ... [2024-10-13 14:56:12,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:12" (1/1) ... [2024-10-13 14:56:12,520 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 14:56:12,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:12" (1/1) ... [2024-10-13 14:56:12,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:12" (1/1) ... [2024-10-13 14:56:12,529 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:12" (1/1) ... [2024-10-13 14:56:12,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:12" (1/1) ... [2024-10-13 14:56:12,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:12" (1/1) ... [2024-10-13 14:56:12,534 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:12" (1/1) ... [2024-10-13 14:56:12,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 14:56:12,541 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 14:56:12,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 14:56:12,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 14:56:12,542 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:12" (1/1) ... [2024-10-13 14:56:12,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 14:56:12,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 14:56:12,574 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 14:56:12,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 14:56:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-13 14:56:12,618 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-13 14:56:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 14:56:12,619 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 14:56:12,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 14:56:12,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 14:56:12,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 14:56:12,753 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 14:56:12,755 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 14:56:12,997 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-10-13 14:56:12,997 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 14:56:13,051 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 14:56:13,052 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 14:56:13,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:56:13 BoogieIcfgContainer [2024-10-13 14:56:13,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 14:56:13,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 14:56:13,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 14:56:13,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 14:56:13,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:56:11" (1/3) ... [2024-10-13 14:56:13,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210e250d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:56:13, skipping insertion in model container [2024-10-13 14:56:13,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:12" (2/3) ... [2024-10-13 14:56:13,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210e250d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:56:13, skipping insertion in model container [2024-10-13 14:56:13,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:56:13" (3/3) ... [2024-10-13 14:56:13,063 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_postinc_15_good.i [2024-10-13 14:56:13,076 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 14:56:13,076 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-13 14:56:13,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 14:56:13,136 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;@2da73fb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 14:56:13,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 14:56:13,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 47 states have (on average 1.574468085106383) internal successors, (74), 63 states have internal predecessors, (74), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 14:56:13,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 14:56:13,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:13,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:13,150 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-13 14:56:13,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:13,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2140190377, now seen corresponding path program 1 times [2024-10-13 14:56:13,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:13,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719779283] [2024-10-13 14:56:13,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:13,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:13,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:13,520 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-13 14:56:13,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:13,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719779283] [2024-10-13 14:56:13,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719779283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:13,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:13,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:56:13,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369921813] [2024-10-13 14:56:13,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:13,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 14:56:13,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:13,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 14:56:13,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 14:56:13,552 INFO L87 Difference]: Start difference. First operand has 74 states, 47 states have (on average 1.574468085106383) internal successors, (74), 63 states have internal predecessors, (74), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-13 14:56:13,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:13,633 INFO L93 Difference]: Finished difference Result 75 states and 107 transitions. [2024-10-13 14:56:13,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 14:56:13,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 13 [2024-10-13 14:56:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:13,643 INFO L225 Difference]: With dead ends: 75 [2024-10-13 14:56:13,643 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 14:56:13,646 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-13 14:56:13,649 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 6 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:13,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 266 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:13,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 14:56:13,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-10-13 14:56:13,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 56 states have internal predecessors, (66), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 14:56:13,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 92 transitions. [2024-10-13 14:56:13,695 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 92 transitions. Word has length 13 [2024-10-13 14:56:13,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:13,697 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 92 transitions. [2024-10-13 14:56:13,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-13 14:56:13,697 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 92 transitions. [2024-10-13 14:56:13,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 14:56:13,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:13,699 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:13,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 14:56:13,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:56:13,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:13,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1921392174, now seen corresponding path program 1 times [2024-10-13 14:56:13,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:13,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288588750] [2024-10-13 14:56:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:13,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:13,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:13,778 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-13 14:56:13,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:13,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288588750] [2024-10-13 14:56:13,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288588750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:13,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:13,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 14:56:13,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826172691] [2024-10-13 14:56:13,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:13,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:56:13,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:13,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:56:13,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:56:13,782 INFO L87 Difference]: Start difference. First operand 65 states and 92 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-13 14:56:13,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:13,806 INFO L93 Difference]: Finished difference Result 65 states and 92 transitions. [2024-10-13 14:56:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:56:13,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-10-13 14:56:13,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:13,808 INFO L225 Difference]: With dead ends: 65 [2024-10-13 14:56:13,809 INFO L226 Difference]: Without dead ends: 64 [2024-10-13 14:56:13,809 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-13 14:56:13,810 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:13,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:13,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-13 14:56:13,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-13 14:56:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 55 states have internal predecessors, (65), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 14:56:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2024-10-13 14:56:13,820 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 14 [2024-10-13 14:56:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:13,821 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2024-10-13 14:56:13,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-13 14:56:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2024-10-13 14:56:13,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 14:56:13,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:13,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:13,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 14:56:13,823 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:56:13,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:13,823 INFO L85 PathProgramCache]: Analyzing trace with hash 768172019, now seen corresponding path program 1 times [2024-10-13 14:56:13,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:13,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527077338] [2024-10-13 14:56:13,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:13,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:13,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:13,899 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-13 14:56:13,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:13,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527077338] [2024-10-13 14:56:13,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527077338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:13,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:13,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:56:13,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028416264] [2024-10-13 14:56:13,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:13,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:56:13,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:13,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:56:13,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:56:13,906 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-13 14:56:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:13,940 INFO L93 Difference]: Finished difference Result 111 states and 155 transitions. [2024-10-13 14:56:13,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:56:13,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-13 14:56:13,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:13,942 INFO L225 Difference]: With dead ends: 111 [2024-10-13 14:56:13,942 INFO L226 Difference]: Without dead ends: 64 [2024-10-13 14:56:13,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 14:56:13,944 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:13,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:13,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-13 14:56:13,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-13 14:56:13,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 55 states have internal predecessors, (64), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 14:56:13,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2024-10-13 14:56:13,956 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 17 [2024-10-13 14:56:13,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:13,956 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2024-10-13 14:56:13,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-13 14:56:13,957 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2024-10-13 14:56:13,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 14:56:13,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:13,958 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:13,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 14:56:13,958 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-13 14:56:13,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:13,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1595462301, now seen corresponding path program 1 times [2024-10-13 14:56:13,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:13,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977861817] [2024-10-13 14:56:13,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:13,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 14:56:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,085 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-13 14:56:14,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:14,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977861817] [2024-10-13 14:56:14,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977861817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:14,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:14,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:56:14,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496257942] [2024-10-13 14:56:14,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:14,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:56:14,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:14,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:56:14,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:56:14,095 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-13 14:56:14,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:14,137 INFO L93 Difference]: Finished difference Result 111 states and 154 transitions. [2024-10-13 14:56:14,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:56:14,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 21 [2024-10-13 14:56:14,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:14,139 INFO L225 Difference]: With dead ends: 111 [2024-10-13 14:56:14,139 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 14:56:14,140 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-13 14:56:14,142 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:14,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:14,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 14:56:14,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 14:56:14,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 54 states have internal predecessors, (63), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 14:56:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2024-10-13 14:56:14,156 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 21 [2024-10-13 14:56:14,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:14,157 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2024-10-13 14:56:14,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-13 14:56:14,157 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2024-10-13 14:56:14,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 14:56:14,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:14,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:14,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 14:56:14,159 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-13 14:56:14,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:14,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1091598030, now seen corresponding path program 1 times [2024-10-13 14:56:14,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:14,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245335325] [2024-10-13 14:56:14,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:14,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 14:56:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,253 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-13 14:56:14,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:14,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245335325] [2024-10-13 14:56:14,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245335325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:14,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:14,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:56:14,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708430027] [2024-10-13 14:56:14,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:14,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 14:56:14,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:14,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 14:56:14,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 14:56:14,257 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-13 14:56:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:14,301 INFO L93 Difference]: Finished difference Result 64 states and 88 transitions. [2024-10-13 14:56:14,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 14:56:14,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 24 [2024-10-13 14:56:14,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:14,303 INFO L225 Difference]: With dead ends: 64 [2024-10-13 14:56:14,305 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 14:56:14,305 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-13 14:56:14,306 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 7 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:14,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 217 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 14:56:14,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2024-10-13 14:56:14,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.441860465116279) internal successors, (62), 53 states have internal predecessors, (62), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 14:56:14,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2024-10-13 14:56:14,317 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 24 [2024-10-13 14:56:14,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:14,317 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2024-10-13 14:56:14,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-13 14:56:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2024-10-13 14:56:14,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 14:56:14,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:14,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:14,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 14:56:14,319 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-13 14:56:14,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:14,322 INFO L85 PathProgramCache]: Analyzing trace with hash 520199547, now seen corresponding path program 1 times [2024-10-13 14:56:14,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:14,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486788577] [2024-10-13 14:56:14,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:14,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 14:56:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,386 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-13 14:56:14,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:14,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486788577] [2024-10-13 14:56:14,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486788577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:14,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:14,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 14:56:14,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103970666] [2024-10-13 14:56:14,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:14,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:56:14,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:14,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:56:14,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:56:14,394 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-13 14:56:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:14,418 INFO L93 Difference]: Finished difference Result 62 states and 86 transitions. [2024-10-13 14:56:14,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:56:14,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 25 [2024-10-13 14:56:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:14,420 INFO L225 Difference]: With dead ends: 62 [2024-10-13 14:56:14,420 INFO L226 Difference]: Without dead ends: 61 [2024-10-13 14:56:14,421 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-13 14:56:14,422 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:14,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:14,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-13 14:56:14,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-13 14:56:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 52 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 14:56:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 85 transitions. [2024-10-13 14:56:14,436 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 85 transitions. Word has length 25 [2024-10-13 14:56:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:14,436 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 85 transitions. [2024-10-13 14:56:14,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-13 14:56:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 85 transitions. [2024-10-13 14:56:14,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 14:56:14,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:14,439 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:14,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 14:56:14,440 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-13 14:56:14,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:14,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1404022213, now seen corresponding path program 1 times [2024-10-13 14:56:14,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:14,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376671156] [2024-10-13 14:56:14,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:14,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 14:56:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,488 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-13 14:56:14,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:14,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376671156] [2024-10-13 14:56:14,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376671156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:14,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:14,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:56:14,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323259651] [2024-10-13 14:56:14,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:14,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:56:14,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:14,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:56:14,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:56:14,491 INFO L87 Difference]: Start difference. First operand 61 states and 85 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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-13 14:56:14,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:14,512 INFO L93 Difference]: Finished difference Result 91 states and 123 transitions. [2024-10-13 14:56:14,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:56:14,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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 29 [2024-10-13 14:56:14,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:14,516 INFO L225 Difference]: With dead ends: 91 [2024-10-13 14:56:14,516 INFO L226 Difference]: Without dead ends: 59 [2024-10-13 14:56:14,516 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-13 14:56:14,517 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:14,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:14,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-13 14:56:14,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-13 14:56:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.380952380952381) internal successors, (58), 50 states have internal predecessors, (58), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 14:56:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 80 transitions. [2024-10-13 14:56:14,525 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 80 transitions. Word has length 29 [2024-10-13 14:56:14,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:14,526 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 80 transitions. [2024-10-13 14:56:14,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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-13 14:56:14,526 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2024-10-13 14:56:14,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 14:56:14,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:14,527 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] [2024-10-13 14:56:14,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 14:56:14,527 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:56:14,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:14,528 INFO L85 PathProgramCache]: Analyzing trace with hash -582622624, now seen corresponding path program 1 times [2024-10-13 14:56:14,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:14,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647438027] [2024-10-13 14:56:14,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:14,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 14:56:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 14:56:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,617 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-13 14:56:14,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:14,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647438027] [2024-10-13 14:56:14,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647438027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:14,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:14,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:56:14,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303505590] [2024-10-13 14:56:14,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:14,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 14:56:14,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:14,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 14:56:14,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 14:56:14,620 INFO L87 Difference]: Start difference. First operand 59 states and 80 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, (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-13 14:56:14,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:14,652 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2024-10-13 14:56:14,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 14:56:14,652 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, (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 35 [2024-10-13 14:56:14,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:14,653 INFO L225 Difference]: With dead ends: 68 [2024-10-13 14:56:14,654 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 14:56:14,655 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-13 14:56:14,655 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 4 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:14,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 215 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:14,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 14:56:14,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2024-10-13 14:56:14,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 54 states have internal predecessors, (63), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 14:56:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2024-10-13 14:56:14,666 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 35 [2024-10-13 14:56:14,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:14,667 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2024-10-13 14:56:14,667 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, (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-13 14:56:14,668 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2024-10-13 14:56:14,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 14:56:14,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:14,669 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] [2024-10-13 14:56:14,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 14:56:14,669 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:56:14,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:14,670 INFO L85 PathProgramCache]: Analyzing trace with hash -582563042, now seen corresponding path program 1 times [2024-10-13 14:56:14,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:14,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912450191] [2024-10-13 14:56:14,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:14,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 14:56:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 14:56:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,716 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-13 14:56:14,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:14,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912450191] [2024-10-13 14:56:14,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912450191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:14,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:14,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:56:14,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703707699] [2024-10-13 14:56:14,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:14,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:56:14,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:14,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:56:14,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:56:14,720 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (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-13 14:56:14,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:14,737 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2024-10-13 14:56:14,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:56:14,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (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 35 [2024-10-13 14:56:14,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:14,738 INFO L225 Difference]: With dead ends: 89 [2024-10-13 14:56:14,738 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 14:56:14,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-13 14:56:14,739 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:14,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:14,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 14:56:14,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 14:56:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 53 states have internal predecessors, (62), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 14:56:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2024-10-13 14:56:14,746 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 84 transitions. Word has length 35 [2024-10-13 14:56:14,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:14,746 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 84 transitions. [2024-10-13 14:56:14,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (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-13 14:56:14,747 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2024-10-13 14:56:14,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 14:56:14,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:14,749 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-13 14:56:14,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 14:56:14,749 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:56:14,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:14,750 INFO L85 PathProgramCache]: Analyzing trace with hash 921578859, now seen corresponding path program 1 times [2024-10-13 14:56:14,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:14,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783954555] [2024-10-13 14:56:14,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:14,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 14:56:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 14:56:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 14:56:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 14:56:14,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:14,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783954555] [2024-10-13 14:56:14,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783954555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:14,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:14,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:56:14,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876653593] [2024-10-13 14:56:14,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:14,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:56:14,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:14,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:56:14,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:56:14,799 INFO L87 Difference]: Start difference. First operand 63 states and 84 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 14:56:14,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:14,819 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2024-10-13 14:56:14,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:56:14,820 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2024-10-13 14:56:14,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:14,820 INFO L225 Difference]: With dead ends: 83 [2024-10-13 14:56:14,820 INFO L226 Difference]: Without dead ends: 56 [2024-10-13 14:56:14,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-13 14:56:14,821 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:14,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-13 14:56:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-13 14:56:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 47 states have internal predecessors, (54), 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-13 14:56:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2024-10-13 14:56:14,828 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 39 [2024-10-13 14:56:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:14,828 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2024-10-13 14:56:14,829 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 14:56:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2024-10-13 14:56:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 14:56:14,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:14,833 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] [2024-10-13 14:56:14,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 14:56:14,833 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:56:14,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:14,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1169118596, now seen corresponding path program 1 times [2024-10-13 14:56:14,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:14,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918895646] [2024-10-13 14:56:14,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:14,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 14:56:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 14:56:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,887 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-13 14:56:14,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:14,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918895646] [2024-10-13 14:56:14,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918895646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:14,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:14,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:56:14,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514966988] [2024-10-13 14:56:14,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:14,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:56:14,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:14,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:56:14,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:56:14,891 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-13 14:56:14,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:14,908 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2024-10-13 14:56:14,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:56:14,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 40 [2024-10-13 14:56:14,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:14,909 INFO L225 Difference]: With dead ends: 70 [2024-10-13 14:56:14,910 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 14:56:14,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-13 14:56:14,910 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:14,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:14,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 14:56:14,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-13 14:56:14,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 45 states have internal predecessors, (51), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 14:56:14,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2024-10-13 14:56:14,915 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 40 [2024-10-13 14:56:14,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:14,915 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2024-10-13 14:56:14,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-13 14:56:14,915 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2024-10-13 14:56:14,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 14:56:14,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:14,917 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] [2024-10-13 14:56:14,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 14:56:14,917 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:56:14,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:14,918 INFO L85 PathProgramCache]: Analyzing trace with hash -863019157, now seen corresponding path program 1 times [2024-10-13 14:56:14,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:14,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303947100] [2024-10-13 14:56:14,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:14,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 14:56:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:14,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 14:56:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:15,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 14:56:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:15,006 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-13 14:56:15,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:15,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303947100] [2024-10-13 14:56:15,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303947100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:15,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:15,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:56:15,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582497046] [2024-10-13 14:56:15,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:15,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 14:56:15,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:15,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 14:56:15,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 14:56:15,010 INFO L87 Difference]: Start difference. First operand 54 states and 69 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, (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-13 14:56:15,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:15,039 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2024-10-13 14:56:15,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 14:56:15,039 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, (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 45 [2024-10-13 14:56:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:15,040 INFO L225 Difference]: With dead ends: 60 [2024-10-13 14:56:15,041 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 14:56:15,041 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-13 14:56:15,041 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:15,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 183 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:15,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 14:56:15,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-13 14:56:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 45 states have internal predecessors, (50), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 14:56:15,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2024-10-13 14:56:15,047 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 45 [2024-10-13 14:56:15,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:15,047 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2024-10-13 14:56:15,048 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, (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-13 14:56:15,048 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2024-10-13 14:56:15,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 14:56:15,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:15,049 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] [2024-10-13 14:56:15,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 14:56:15,049 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:56:15,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:15,050 INFO L85 PathProgramCache]: Analyzing trace with hash -982005396, now seen corresponding path program 1 times [2024-10-13 14:56:15,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:15,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469824776] [2024-10-13 14:56:15,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:15,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:15,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:15,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 14:56:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:15,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 14:56:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:15,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 14:56:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:15,096 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-13 14:56:15,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:15,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469824776] [2024-10-13 14:56:15,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469824776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:15,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:15,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:56:15,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21447196] [2024-10-13 14:56:15,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:15,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:56:15,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:15,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:56:15,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:56:15,099 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-13 14:56:15,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:15,112 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2024-10-13 14:56:15,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:56:15,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 46 [2024-10-13 14:56:15,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:15,114 INFO L225 Difference]: With dead ends: 58 [2024-10-13 14:56:15,114 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 14:56:15,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-13 14:56:15,115 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 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-13 14:56:15,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:15,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 14:56:15,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 14:56:15,116 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-13 14:56:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 14:56:15,116 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2024-10-13 14:56:15,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:15,116 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 14:56:15,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-13 14:56:15,116 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 14:56:15,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 14:56:15,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-13 14:56:15,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-13 14:56:15,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-13 14:56:15,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-13 14:56:15,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-13 14:56:15,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-13 14:56:15,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-13 14:56:15,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-13 14:56:15,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 14:56:15,131 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:15,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 14:56:15,166 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 14:56:15,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:56:15 BoogieIcfgContainer [2024-10-13 14:56:15,179 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 14:56:15,179 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 14:56:15,179 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 14:56:15,180 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 14:56:15,180 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:56:13" (3/4) ... [2024-10-13 14:56:15,182 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 14:56:15,185 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-13 14:56:15,185 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-13 14:56:15,190 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-13 14:56:15,191 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-13 14:56:15,191 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 14:56:15,191 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 14:56:15,192 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 14:56:15,285 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 14:56:15,285 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 14:56:15,285 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 14:56:15,286 INFO L158 Benchmark]: Toolchain (without parser) took 3915.03ms. Allocated memory was 140.5MB in the beginning and 207.6MB in the end (delta: 67.1MB). Free memory was 83.4MB in the beginning and 127.1MB in the end (delta: -43.7MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2024-10-13 14:56:15,286 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 140.5MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 14:56:15,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1041.85ms. Allocated memory was 140.5MB in the beginning and 207.6MB in the end (delta: 67.1MB). Free memory was 83.0MB in the beginning and 140.2MB in the end (delta: -57.2MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-10-13 14:56:15,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.74ms. Allocated memory is still 207.6MB. Free memory was 140.2MB in the beginning and 137.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 14:56:15,287 INFO L158 Benchmark]: Boogie Preprocessor took 48.05ms. Allocated memory is still 207.6MB. Free memory was 137.1MB in the beginning and 135.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 14:56:15,288 INFO L158 Benchmark]: RCFGBuilder took 511.77ms. Allocated memory is still 207.6MB. Free memory was 135.0MB in the beginning and 112.9MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 14:56:15,288 INFO L158 Benchmark]: TraceAbstraction took 2123.88ms. Allocated memory is still 207.6MB. Free memory was 112.9MB in the beginning and 134.4MB in the end (delta: -21.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 14:56:15,288 INFO L158 Benchmark]: Witness Printer took 106.23ms. Allocated memory is still 207.6MB. Free memory was 134.4MB in the beginning and 127.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 14:56:15,290 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.12ms. Allocated memory is still 140.5MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1041.85ms. Allocated memory was 140.5MB in the beginning and 207.6MB in the end (delta: 67.1MB). Free memory was 83.0MB in the beginning and 140.2MB in the end (delta: -57.2MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.74ms. Allocated memory is still 207.6MB. Free memory was 140.2MB in the beginning and 137.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.05ms. Allocated memory is still 207.6MB. Free memory was 137.1MB in the beginning and 135.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 511.77ms. Allocated memory is still 207.6MB. Free memory was 135.0MB in the beginning and 112.9MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2123.88ms. Allocated memory is still 207.6MB. Free memory was 112.9MB in the beginning and 134.4MB in the end (delta: -21.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 106.23ms. Allocated memory is still 207.6MB. Free memory was 134.4MB in the beginning and 127.1MB 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: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: 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, 74 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 2180 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1218 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 227 IncrementalHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 962 mSDtfsCounter, 227 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=0, InterpolantAutomatonStates: 43, 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, 13 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 383 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 370 ConstructedInterpolants, 0 QuantifiedInterpolants, 428 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 40/40 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 RESULT: Ultimate proved your program to be correct! [2024-10-13 14:56:15,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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