./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_21_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_21_good.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 317c4f34fc1dbfe22ca718cefeb5c9cf425761fee9933ca0117084335c34c263 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:33:39,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:33:39,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 22:33:39,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:33:39,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:33:39,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:33:39,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:33:39,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:33:39,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:33:39,325 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:33:39,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:33:39,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:33:39,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:33:39,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:33:39,327 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:33:39,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:33:39,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:33:39,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 22:33:39,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:33:39,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:33:39,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:33:39,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:33:39,331 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:33:39,331 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:33:39,332 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:33:39,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:33:39,332 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:33:39,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:33:39,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:33:39,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:33:39,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:33:39,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:33:39,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:33:39,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:33:39,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:33:39,335 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 22:33:39,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 22:33:39,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:33:39,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:33:39,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:33:39,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:33:39,340 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 317c4f34fc1dbfe22ca718cefeb5c9cf425761fee9933ca0117084335c34c263 [2024-10-11 22:33:39,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:33:39,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:33:39,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:33:39,578 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:33:39,579 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:33:39,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_21_good.i [2024-10-11 22:33:40,933 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:33:41,243 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:33:41,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_21_good.i [2024-10-11 22:33:41,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/46fb0e01e/e19a8f870c514ed88394c15e0710f16c/FLAG6117c3e78 [2024-10-11 22:33:41,503 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/46fb0e01e/e19a8f870c514ed88394c15e0710f16c [2024-10-11 22:33:41,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:33:41,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:33:41,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:33:41,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:33:41,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:33:41,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:33:41" (1/1) ... [2024-10-11 22:33:41,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@668f39f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:41, skipping insertion in model container [2024-10-11 22:33:41,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:33:41" (1/1) ... [2024-10-11 22:33:41,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:33:42,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:33:42,289 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:33:42,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:33:42,508 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:33:42,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:42 WrapperNode [2024-10-11 22:33:42,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:33:42,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:33:42,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:33:42,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:33:42,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:42" (1/1) ... [2024-10-11 22:33:42,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:42" (1/1) ... [2024-10-11 22:33:42,582 INFO L138 Inliner]: procedures = 503, calls = 37, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 208 [2024-10-11 22:33:42,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:33:42,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:33:42,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:33:42,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:33:42,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:42" (1/1) ... [2024-10-11 22:33:42,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:42" (1/1) ... [2024-10-11 22:33:42,602 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:42" (1/1) ... [2024-10-11 22:33:42,618 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:33:42,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:42" (1/1) ... [2024-10-11 22:33:42,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:42" (1/1) ... [2024-10-11 22:33:42,627 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:42" (1/1) ... [2024-10-11 22:33:42,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:42" (1/1) ... [2024-10-11 22:33:42,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:42" (1/1) ... [2024-10-11 22:33:42,639 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:42" (1/1) ... [2024-10-11 22:33:42,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:33:42,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:33:42,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:33:42,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:33:42,646 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:42" (1/1) ... [2024-10-11 22:33:42,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:33:42,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:33:42,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 22:33:42,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 22:33:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 22:33:42,718 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 22:33:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:33:42,718 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:33:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:33:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:33:42,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:33:42,862 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:33:42,865 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:33:43,173 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-10-11 22:33:43,174 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:33:43,201 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:33:43,201 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:33:43,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:33:43 BoogieIcfgContainer [2024-10-11 22:33:43,202 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:33:43,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:33:43,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:33:43,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:33:43,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:33:41" (1/3) ... [2024-10-11 22:33:43,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cffc92e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:33:43, skipping insertion in model container [2024-10-11 22:33:43,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:33:42" (2/3) ... [2024-10-11 22:33:43,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cffc92e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:33:43, skipping insertion in model container [2024-10-11 22:33:43,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:33:43" (3/3) ... [2024-10-11 22:33:43,207 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_21_good.i [2024-10-11 22:33:43,219 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:33:43,219 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 22:33:43,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:33:43,262 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;@1268af53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:33:43,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 22:33:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 71 states have (on average 1.5352112676056338) internal successors, (109), 77 states have internal predecessors, (109), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 22:33:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 22:33:43,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:43,272 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:33:43,272 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 22:33:43,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:43,275 INFO L85 PathProgramCache]: Analyzing trace with hash 143351267, now seen corresponding path program 1 times [2024-10-11 22:33:43,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:43,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545150613] [2024-10-11 22:33:43,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:43,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:43,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:33:43,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:43,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545150613] [2024-10-11 22:33:43,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545150613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:43,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:43,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:33:43,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098070475] [2024-10-11 22:33:43,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:43,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:33:43,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:43,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:33:43,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:33:43,717 INFO L87 Difference]: Start difference. First operand has 88 states, 71 states have (on average 1.5352112676056338) internal successors, (109), 77 states have internal predecessors, (109), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:33:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:43,771 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2024-10-11 22:33:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:33:43,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 22:33:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:43,779 INFO L225 Difference]: With dead ends: 89 [2024-10-11 22:33:43,779 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 22:33:43,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:33:43,784 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 3 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:43,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 333 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:43,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 22:33:43,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2024-10-11 22:33:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 72 states have internal predecessors, (103), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 22:33:43,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-10-11 22:33:43,814 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 16 [2024-10-11 22:33:43,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:43,815 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-10-11 22:33:43,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:33:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-10-11 22:33:43,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 22:33:43,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:43,817 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:33:43,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 22:33:43,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 22:33:43,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:43,818 INFO L85 PathProgramCache]: Analyzing trace with hash 148922118, now seen corresponding path program 1 times [2024-10-11 22:33:43,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:43,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445601173] [2024-10-11 22:33:43,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:43,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:43,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:43,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:33:43,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:43,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445601173] [2024-10-11 22:33:43,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445601173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:43,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:43,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:33:43,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352070682] [2024-10-11 22:33:43,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:43,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:33:43,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:43,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:33:43,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:33:43,907 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 3 states, 2 states have (on average 7.5) 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-11 22:33:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:43,937 INFO L93 Difference]: Finished difference Result 81 states and 115 transitions. [2024-10-11 22:33:43,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:33:43,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) 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-11 22:33:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:43,941 INFO L225 Difference]: With dead ends: 81 [2024-10-11 22:33:43,941 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 22:33:43,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:33:43,942 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 214 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-11 22:33:43,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 22:33:43,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-11 22:33:43,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 68 states have (on average 1.5) internal successors, (102), 71 states have internal predecessors, (102), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 22:33:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2024-10-11 22:33:43,957 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 17 [2024-10-11 22:33:43,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:43,957 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2024-10-11 22:33:43,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) 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-11 22:33:43,957 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2024-10-11 22:33:43,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 22:33:43,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:43,959 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] [2024-10-11 22:33:43,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 22:33:43,959 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 22:33:43,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:43,960 INFO L85 PathProgramCache]: Analyzing trace with hash -458030292, now seen corresponding path program 1 times [2024-10-11 22:33:43,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:43,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900457630] [2024-10-11 22:33:43,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:43,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:43,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:44,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 22:33:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 22:33:44,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:44,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900457630] [2024-10-11 22:33:44,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900457630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:44,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:44,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:33:44,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547957880] [2024-10-11 22:33:44,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:44,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:33:44,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:44,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:33:44,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:33:44,009 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 22:33:44,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:44,032 INFO L93 Difference]: Finished difference Result 125 states and 174 transitions. [2024-10-11 22:33:44,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:33:44,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 30 [2024-10-11 22:33:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:44,035 INFO L225 Difference]: With dead ends: 125 [2024-10-11 22:33:44,035 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 22:33:44,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:33:44,036 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:44,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 105 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:44,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 22:33:44,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 22:33:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.492537313432836) internal successors, (100), 70 states have internal predecessors, (100), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 22:33:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 110 transitions. [2024-10-11 22:33:44,049 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 110 transitions. Word has length 30 [2024-10-11 22:33:44,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:44,049 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 110 transitions. [2024-10-11 22:33:44,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 22:33:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 110 transitions. [2024-10-11 22:33:44,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 22:33:44,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:44,051 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, 1, 1] [2024-10-11 22:33:44,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 22:33:44,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 22:33:44,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:44,054 INFO L85 PathProgramCache]: Analyzing trace with hash -432709798, now seen corresponding path program 1 times [2024-10-11 22:33:44,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:44,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085742786] [2024-10-11 22:33:44,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:44,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:44,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:44,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 22:33:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:33:44,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:44,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085742786] [2024-10-11 22:33:44,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085742786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:44,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:44,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 22:33:44,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253020386] [2024-10-11 22:33:44,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:44,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 22:33:44,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:44,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 22:33:44,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 22:33:44,293 INFO L87 Difference]: Start difference. First operand 78 states and 110 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:33:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:44,378 INFO L93 Difference]: Finished difference Result 86 states and 121 transitions. [2024-10-11 22:33:44,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 22:33:44,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-10-11 22:33:44,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:44,380 INFO L225 Difference]: With dead ends: 86 [2024-10-11 22:33:44,381 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 22:33:44,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 22:33:44,383 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 5 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:44,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 554 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 22:33:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 22:33:44,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2024-10-11 22:33:44,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 75 states have internal predecessors, (107), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 22:33:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2024-10-11 22:33:44,394 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 31 [2024-10-11 22:33:44,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:44,396 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2024-10-11 22:33:44,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:33:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2024-10-11 22:33:44,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 22:33:44,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:44,397 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, 1, 1] [2024-10-11 22:33:44,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 22:33:44,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 22:33:44,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:44,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1894183680, now seen corresponding path program 1 times [2024-10-11 22:33:44,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:44,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605506239] [2024-10-11 22:33:44,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:44,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:44,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:44,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 22:33:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:33:44,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:44,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605506239] [2024-10-11 22:33:44,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605506239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:44,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:44,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:33:44,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417776578] [2024-10-11 22:33:44,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:44,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:33:44,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:44,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:33:44,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:33:44,560 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:33:44,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:44,587 INFO L93 Difference]: Finished difference Result 84 states and 118 transitions. [2024-10-11 22:33:44,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:33:44,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-10-11 22:33:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:44,589 INFO L225 Difference]: With dead ends: 84 [2024-10-11 22:33:44,589 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 22:33:44,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:33:44,590 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:44,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 296 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:44,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 22:33:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2024-10-11 22:33:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 69 states have internal predecessors, (99), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 22:33:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2024-10-11 22:33:44,602 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 31 [2024-10-11 22:33:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:44,602 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2024-10-11 22:33:44,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:33:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2024-10-11 22:33:44,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 22:33:44,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:44,605 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, 1, 1, 1] [2024-10-11 22:33:44,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 22:33:44,606 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 22:33:44,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:44,606 INFO L85 PathProgramCache]: Analyzing trace with hash -529101614, now seen corresponding path program 1 times [2024-10-11 22:33:44,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:44,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238417938] [2024-10-11 22:33:44,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:44,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:44,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:44,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 22:33:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:33:44,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:44,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238417938] [2024-10-11 22:33:44,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238417938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:44,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:44,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:33:44,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146581746] [2024-10-11 22:33:44,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:44,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:33:44,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:44,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:33:44,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:33:44,720 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:33:44,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:44,732 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2024-10-11 22:33:44,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:33:44,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 32 [2024-10-11 22:33:44,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:44,734 INFO L225 Difference]: With dead ends: 77 [2024-10-11 22:33:44,734 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 22:33:44,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:33:44,735 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 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-11 22:33:44,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:44,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 22:33:44,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-11 22:33:44,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 67 states have (on average 1.462686567164179) internal successors, (98), 68 states have internal predecessors, (98), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 22:33:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 108 transitions. [2024-10-11 22:33:44,740 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 108 transitions. Word has length 32 [2024-10-11 22:33:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:44,740 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 108 transitions. [2024-10-11 22:33:44,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:33:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2024-10-11 22:33:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 22:33:44,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:44,741 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, 1, 1, 1] [2024-10-11 22:33:44,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 22:33:44,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 22:33:44,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:44,742 INFO L85 PathProgramCache]: Analyzing trace with hash -528568644, now seen corresponding path program 1 times [2024-10-11 22:33:44,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:44,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75520790] [2024-10-11 22:33:44,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:44,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:44,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:44,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 22:33:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:33:44,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:44,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75520790] [2024-10-11 22:33:44,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75520790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:44,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:44,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:33:44,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309220690] [2024-10-11 22:33:44,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:44,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:33:44,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:44,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:33:44,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:33:44,787 INFO L87 Difference]: Start difference. First operand 76 states and 108 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:33:44,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:44,799 INFO L93 Difference]: Finished difference Result 88 states and 118 transitions. [2024-10-11 22:33:44,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:33:44,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 32 [2024-10-11 22:33:44,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:44,800 INFO L225 Difference]: With dead ends: 88 [2024-10-11 22:33:44,800 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 22:33:44,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:33:44,801 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 21 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:44,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 193 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:44,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 22:33:44,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-11 22:33:44,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 22:33:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 112 transitions. [2024-10-11 22:33:44,811 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 112 transitions. Word has length 32 [2024-10-11 22:33:44,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:44,812 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 112 transitions. [2024-10-11 22:33:44,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:33:44,812 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 112 transitions. [2024-10-11 22:33:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 22:33:44,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:33:44,813 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] [2024-10-11 22:33:44,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 22:33:44,813 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 22:33:44,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:33:44,814 INFO L85 PathProgramCache]: Analyzing trace with hash 584077453, now seen corresponding path program 1 times [2024-10-11 22:33:44,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:33:44,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869775248] [2024-10-11 22:33:44,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:33:44,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:33:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:44,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:33:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:44,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 22:33:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:44,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 22:33:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:33:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 22:33:44,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:33:44,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869775248] [2024-10-11 22:33:44,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869775248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:33:44,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:33:44,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:33:44,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711370212] [2024-10-11 22:33:44,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:33:44,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:33:44,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:33:44,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:33:44,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:33:44,903 INFO L87 Difference]: Start difference. First operand 82 states and 112 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:33:44,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:33:44,927 INFO L93 Difference]: Finished difference Result 82 states and 112 transitions. [2024-10-11 22:33:44,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:33:44,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 39 [2024-10-11 22:33:44,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:33:44,928 INFO L225 Difference]: With dead ends: 82 [2024-10-11 22:33:44,929 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 22:33:44,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:33:44,934 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 1 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:33:44,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 297 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:33:44,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 22:33:44,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 22:33:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 22:33:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 22:33:44,935 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2024-10-11 22:33:44,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:33:44,935 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 22:33:44,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:33:44,935 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 22:33:44,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 22:33:44,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-11 22:33:44,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-11 22:33:44,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-11 22:33:44,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-11 22:33:44,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-11 22:33:44,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-11 22:33:44,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 22:33:44,946 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:33:44,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 22:33:44,992 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:33:45,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:33:45 BoogieIcfgContainer [2024-10-11 22:33:45,007 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:33:45,008 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:33:45,008 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:33:45,008 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:33:45,009 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:33:43" (3/4) ... [2024-10-11 22:33:45,010 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 22:33:45,014 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 22:33:45,014 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 22:33:45,022 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-10-11 22:33:45,023 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-11 22:33:45,023 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 22:33:45,023 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 22:33:45,114 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 22:33:45,115 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 22:33:45,117 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 22:33:45,117 INFO L158 Benchmark]: Toolchain (without parser) took 3610.55ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 151.0MB in the beginning and 110.7MB in the end (delta: 40.2MB). Peak memory consumption was 82.4MB. Max. memory is 16.1GB. [2024-10-11 22:33:45,117 INFO L158 Benchmark]: CDTParser took 2.47ms. Allocated memory is still 102.8MB. Free memory was 67.2MB in the beginning and 67.1MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:33:45,118 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1001.22ms. Allocated memory is still 205.5MB. Free memory was 151.0MB in the beginning and 132.6MB in the end (delta: 18.4MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-11 22:33:45,118 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.49ms. Allocated memory is still 205.5MB. Free memory was 132.6MB in the beginning and 128.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 22:33:45,118 INFO L158 Benchmark]: Boogie Preprocessor took 60.30ms. Allocated memory is still 205.5MB. Free memory was 128.4MB in the beginning and 126.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:33:45,118 INFO L158 Benchmark]: RCFGBuilder took 556.53ms. Allocated memory is still 205.5MB. Free memory was 126.3MB in the beginning and 100.1MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 22:33:45,118 INFO L158 Benchmark]: TraceAbstraction took 1803.81ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 99.0MB in the beginning and 118.1MB in the end (delta: -19.1MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2024-10-11 22:33:45,118 INFO L158 Benchmark]: Witness Printer took 109.19ms. Allocated memory is still 247.5MB. Free memory was 118.1MB in the beginning and 110.7MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 22:33:45,119 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.47ms. Allocated memory is still 102.8MB. Free memory was 67.2MB in the beginning and 67.1MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1001.22ms. Allocated memory is still 205.5MB. Free memory was 151.0MB in the beginning and 132.6MB in the end (delta: 18.4MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.49ms. Allocated memory is still 205.5MB. Free memory was 132.6MB in the beginning and 128.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.30ms. Allocated memory is still 205.5MB. Free memory was 128.4MB in the beginning and 126.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 556.53ms. Allocated memory is still 205.5MB. Free memory was 126.3MB in the beginning and 100.1MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1803.81ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 99.0MB in the beginning and 118.1MB in the end (delta: -19.1MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * Witness Printer took 109.19ms. Allocated memory is still 247.5MB. Free memory was 118.1MB in the beginning and 110.7MB in the end (delta: 7.4MB). 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: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1608]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1608]: 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, 88 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 141 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 140 mSDsluCounter, 2194 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1368 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 214 IncrementalHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 826 mSDtfsCounter, 214 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=0, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 286 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 8/8 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 22:33:45,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE