./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_square_17_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_square_17_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c5a3bcbe068a296726a8d4df22b919ca4db22add611944e0b66bc707b6f80436 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 00:24:46,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 00:24:46,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-23 00:24:46,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 00:24:46,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 00:24:46,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 00:24:46,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 00:24:46,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 00:24:46,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 00:24:46,409 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 00:24:46,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 00:24:46,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 00:24:46,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 00:24:46,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 00:24:46,411 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 00:24:46,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 00:24:46,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 00:24:46,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 00:24:46,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 00:24:46,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 00:24:46,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 00:24:46,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 00:24:46,420 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 00:24:46,420 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-23 00:24:46,421 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 00:24:46,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 00:24:46,421 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 00:24:46,421 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 00:24:46,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 00:24:46,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 00:24:46,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 00:24:46,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 00:24:46,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 00:24:46,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 00:24:46,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 00:24:46,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 00:24:46,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 00:24:46,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 00:24:46,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 00:24:46,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 00:24:46,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 00:24:46,426 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c5a3bcbe068a296726a8d4df22b919ca4db22add611944e0b66bc707b6f80436 [2024-11-23 00:24:46,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 00:24:46,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 00:24:46,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 00:24:46,676 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 00:24:46,677 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 00:24:46,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_square_17_bad.i [2024-11-23 00:24:48,093 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 00:24:48,482 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 00:24:48,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_square_17_bad.i [2024-11-23 00:24:48,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1350d0e/ccfe7f64afc44a7d8b14c9b076ae564d/FLAG13c11a2f7 [2024-11-23 00:24:48,537 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1350d0e/ccfe7f64afc44a7d8b14c9b076ae564d [2024-11-23 00:24:48,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 00:24:48,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 00:24:48,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 00:24:48,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 00:24:48,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 00:24:48,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:24:48" (1/1) ... [2024-11-23 00:24:48,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d60a302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:48, skipping insertion in model container [2024-11-23 00:24:48,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:24:48" (1/1) ... [2024-11-23 00:24:48,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 00:24:49,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 00:24:49,654 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 00:24:49,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 00:24:50,101 INFO L204 MainTranslator]: Completed translation [2024-11-23 00:24:50,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:50 WrapperNode [2024-11-23 00:24:50,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 00:24:50,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 00:24:50,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 00:24:50,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 00:24:50,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:50" (1/1) ... [2024-11-23 00:24:50,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:50" (1/1) ... [2024-11-23 00:24:50,189 INFO L138 Inliner]: procedures = 935, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2024-11-23 00:24:50,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 00:24:50,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 00:24:50,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 00:24:50,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 00:24:50,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:50" (1/1) ... [2024-11-23 00:24:50,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:50" (1/1) ... [2024-11-23 00:24:50,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:50" (1/1) ... [2024-11-23 00:24:50,222 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-23 00:24:50,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:50" (1/1) ... [2024-11-23 00:24:50,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:50" (1/1) ... [2024-11-23 00:24:50,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:50" (1/1) ... [2024-11-23 00:24:50,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:50" (1/1) ... [2024-11-23 00:24:50,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:50" (1/1) ... [2024-11-23 00:24:50,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:50" (1/1) ... [2024-11-23 00:24:50,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 00:24:50,250 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 00:24:50,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 00:24:50,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 00:24:50,252 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:50" (1/1) ... [2024-11-23 00:24:50,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 00:24:50,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 00:24:50,287 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 00:24:50,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 00:24:50,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 00:24:50,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 00:24:50,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 00:24:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-23 00:24:50,344 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-23 00:24:50,485 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 00:24:50,487 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 00:24:50,621 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-23 00:24:50,621 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 00:24:50,633 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 00:24:50,634 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-23 00:24:50,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:24:50 BoogieIcfgContainer [2024-11-23 00:24:50,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 00:24:50,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 00:24:50,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 00:24:50,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 00:24:50,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:24:48" (1/3) ... [2024-11-23 00:24:50,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626448ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:24:50, skipping insertion in model container [2024-11-23 00:24:50,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:50" (2/3) ... [2024-11-23 00:24:50,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626448ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:24:50, skipping insertion in model container [2024-11-23 00:24:50,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:24:50" (3/3) ... [2024-11-23 00:24:50,645 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_square_17_bad.i [2024-11-23 00:24:50,661 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 00:24:50,661 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-23 00:24:50,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 00:24:50,729 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;@648857f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 00:24:50,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-23 00:24:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 28 states have internal predecessors, (33), 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-11-23 00:24:50,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-23 00:24:50,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 00:24:50,740 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 00:24:50,741 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-11-23 00:24:50,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 00:24:50,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1480219397, now seen corresponding path program 1 times [2024-11-23 00:24:50,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 00:24:50,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977204232] [2024-11-23 00:24:50,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 00:24:50,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 00:24:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 00:24:51,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 00:24:51,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 00:24:51,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977204232] [2024-11-23 00:24:51,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977204232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 00:24:51,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 00:24:51,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 00:24:51,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120538381] [2024-11-23 00:24:51,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 00:24:51,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 00:24:51,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 00:24:51,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 00:24:51,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 00:24:51,123 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 28 states have internal predecessors, (33), 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) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 00:24:51,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 00:24:51,171 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2024-11-23 00:24:51,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 00:24:51,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-23 00:24:51,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 00:24:51,179 INFO L225 Difference]: With dead ends: 59 [2024-11-23 00:24:51,180 INFO L226 Difference]: Without dead ends: 29 [2024-11-23 00:24:51,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-23 00:24:51,184 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 00:24:51,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 83 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 00:24:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-23 00:24:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-23 00:24:51,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 26 states have internal predecessors, (29), 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-11-23 00:24:51,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-11-23 00:24:51,215 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 11 [2024-11-23 00:24:51,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 00:24:51,216 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-11-23 00:24:51,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-11-23 00:24:51,216 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-11-23 00:24:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-23 00:24:51,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 00:24:51,217 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 00:24:51,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 00:24:51,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-23 00:24:51,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 00:24:51,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1379853943, now seen corresponding path program 1 times [2024-11-23 00:24:51,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 00:24:51,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032968598] [2024-11-23 00:24:51,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 00:24:51,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 00:24:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 00:24:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 00:24:51,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 00:24:51,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032968598] [2024-11-23 00:24:51,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032968598] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 00:24:51,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424584536] [2024-11-23 00:24:51,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 00:24:51,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 00:24:51,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 00:24:51,314 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 00:24:51,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 00:24:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 00:24:51,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 00:24:51,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 00:24:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 00:24:51,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 00:24:51,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424584536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 00:24:51,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 00:24:51,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-23 00:24:51,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129421506] [2024-11-23 00:24:51,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 00:24:51,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 00:24:51,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 00:24:51,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 00:24:51,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-23 00:24:51,467 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-11-23 00:24:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 00:24:51,488 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2024-11-23 00:24:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 00:24:51,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 15 [2024-11-23 00:24:51,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 00:24:51,490 INFO L225 Difference]: With dead ends: 41 [2024-11-23 00:24:51,491 INFO L226 Difference]: Without dead ends: 24 [2024-11-23 00:24:51,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-23 00:24:51,492 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 00:24:51,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 00:24:51,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-23 00:24:51,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-23 00:24:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 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-11-23 00:24:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-11-23 00:24:51,497 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 15 [2024-11-23 00:24:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 00:24:51,497 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-11-23 00:24:51,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-11-23 00:24:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-11-23 00:24:51,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-23 00:24:51,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 00:24:51,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 00:24:51,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-23 00:24:51,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 00:24:51,699 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-23 00:24:51,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 00:24:51,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1106848259, now seen corresponding path program 1 times [2024-11-23 00:24:51,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 00:24:51,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036946186] [2024-11-23 00:24:51,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 00:24:51,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 00:24:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-23 00:24:51,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [623359274] [2024-11-23 00:24:51,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 00:24:51,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 00:24:51,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 00:24:51,742 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 00:24:51,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 00:24:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 00:24:51,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 00:24:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 00:24:51,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 00:24:51,871 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-23 00:24:51,872 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-23 00:24:51,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-23 00:24:51,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-23 00:24:51,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-23 00:24:51,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-23 00:24:51,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-23 00:24:51,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-23 00:24:52,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-23 00:24:52,081 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-23 00:24:52,101 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 00:24:52,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:24:52 BoogieIcfgContainer [2024-11-23 00:24:52,104 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 00:24:52,105 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 00:24:52,105 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 00:24:52,105 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 00:24:52,106 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:24:50" (3/4) ... [2024-11-23 00:24:52,108 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-23 00:24:52,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 00:24:52,110 INFO L158 Benchmark]: Toolchain (without parser) took 3567.79ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 100.9MB in the beginning and 123.1MB in the end (delta: -22.2MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2024-11-23 00:24:52,114 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 96.5MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 00:24:52,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1559.02ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 100.9MB in the beginning and 120.8MB in the end (delta: -19.9MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. [2024-11-23 00:24:52,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.88ms. Allocated memory is still 237.0MB. Free memory was 120.8MB in the beginning and 116.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-23 00:24:52,115 INFO L158 Benchmark]: Boogie Preprocessor took 55.12ms. Allocated memory is still 237.0MB. Free memory was 116.6MB in the beginning and 115.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 00:24:52,115 INFO L158 Benchmark]: RCFGBuilder took 384.22ms. Allocated memory is still 237.0MB. Free memory was 114.5MB in the beginning and 184.9MB in the end (delta: -70.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-23 00:24:52,115 INFO L158 Benchmark]: TraceAbstraction took 1468.09ms. Allocated memory is still 237.0MB. Free memory was 184.9MB in the beginning and 123.2MB in the end (delta: 61.7MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-11-23 00:24:52,116 INFO L158 Benchmark]: Witness Printer took 4.33ms. Allocated memory is still 237.0MB. Free memory was 123.2MB in the beginning and 123.1MB in the end (delta: 160.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 00:24:52,118 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 96.5MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1559.02ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 100.9MB in the beginning and 120.8MB in the end (delta: -19.9MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.88ms. Allocated memory is still 237.0MB. Free memory was 120.8MB in the beginning and 116.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.12ms. Allocated memory is still 237.0MB. Free memory was 116.6MB in the beginning and 115.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 384.22ms. Allocated memory is still 237.0MB. Free memory was 114.5MB in the beginning and 184.9MB in the end (delta: -70.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1468.09ms. Allocated memory is still 237.0MB. Free memory was 184.9MB in the beginning and 123.2MB in the end (delta: 61.7MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Witness Printer took 4.33ms. Allocated memory is still 237.0MB. Free memory was 123.2MB in the beginning and 123.1MB in the end (delta: 160.6kB). There was no memory consumed. 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 - UnprovableResult [Line: 1844]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1852. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1852] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1852] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1853] CALL CWE190_Integer_Overflow__int_max_square_17_bad() [L1834] int i,j; [L1835] int data; [L1836] data = 0 [L1837] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1837] COND TRUE i < 1 [L1839] data = 0x7fffffff VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1837] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1837] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1841] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1841] COND TRUE j < 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1844] data * data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1837]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1837]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1844]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1841]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1841]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 141 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 50 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 64 SizeOfPredicates, 0 NumberOfNonLiveVariables, 77 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 5/6 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-23 00:24:52,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_square_17_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c5a3bcbe068a296726a8d4df22b919ca4db22add611944e0b66bc707b6f80436 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 00:24:54,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 00:24:54,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-23 00:24:54,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 00:24:54,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 00:24:54,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-23 00:24:54,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 00:24:54,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 00:24:54,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 00:24:54,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 00:24:54,412 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 00:24:54,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 00:24:54,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 00:24:54,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 00:24:54,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 00:24:54,414 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 00:24:54,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 00:24:54,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 00:24:54,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 00:24:54,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 00:24:54,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 00:24:54,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 00:24:54,420 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-23 00:24:54,421 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-23 00:24:54,421 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 00:24:54,421 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-23 00:24:54,421 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-23 00:24:54,421 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 00:24:54,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 00:24:54,422 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 00:24:54,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 00:24:54,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 00:24:54,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 00:24:54,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 00:24:54,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 00:24:54,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 00:24:54,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 00:24:54,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 00:24:54,441 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-23 00:24:54,441 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-23 00:24:54,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 00:24:54,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 00:24:54,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 00:24:54,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 00:24:54,442 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c5a3bcbe068a296726a8d4df22b919ca4db22add611944e0b66bc707b6f80436 [2024-11-23 00:24:54,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 00:24:54,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 00:24:54,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 00:24:54,807 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 00:24:54,808 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 00:24:54,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_square_17_bad.i [2024-11-23 00:24:56,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 00:24:56,767 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 00:24:56,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_square_17_bad.i [2024-11-23 00:24:56,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e17f172e/ff0e0579b1a4463ca97d19cbe439d185/FLAGabca09191 [2024-11-23 00:24:56,820 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e17f172e/ff0e0579b1a4463ca97d19cbe439d185 [2024-11-23 00:24:56,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 00:24:56,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 00:24:56,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 00:24:56,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 00:24:56,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 00:24:56,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:24:56" (1/1) ... [2024-11-23 00:24:56,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@758a3c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:56, skipping insertion in model container [2024-11-23 00:24:56,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:24:56" (1/1) ... [2024-11-23 00:24:56,898 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 00:24:58,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 00:24:58,049 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 00:24:58,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 00:24:58,375 INFO L204 MainTranslator]: Completed translation [2024-11-23 00:24:58,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:58 WrapperNode [2024-11-23 00:24:58,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 00:24:58,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 00:24:58,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 00:24:58,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 00:24:58,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:58" (1/1) ... [2024-11-23 00:24:58,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:58" (1/1) ... [2024-11-23 00:24:58,439 INFO L138 Inliner]: procedures = 940, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2024-11-23 00:24:58,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 00:24:58,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 00:24:58,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 00:24:58,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 00:24:58,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:58" (1/1) ... [2024-11-23 00:24:58,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:58" (1/1) ... [2024-11-23 00:24:58,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:58" (1/1) ... [2024-11-23 00:24:58,466 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-23 00:24:58,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:58" (1/1) ... [2024-11-23 00:24:58,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:58" (1/1) ... [2024-11-23 00:24:58,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:58" (1/1) ... [2024-11-23 00:24:58,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:58" (1/1) ... [2024-11-23 00:24:58,480 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:58" (1/1) ... [2024-11-23 00:24:58,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:58" (1/1) ... [2024-11-23 00:24:58,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 00:24:58,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 00:24:58,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 00:24:58,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 00:24:58,487 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:58" (1/1) ... [2024-11-23 00:24:58,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 00:24:58,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 00:24:58,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 00:24:58,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 00:24:58,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 00:24:58,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 00:24:58,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 00:24:58,564 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-23 00:24:58,564 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-23 00:24:58,713 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 00:24:58,715 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 00:24:59,229 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-23 00:24:59,229 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 00:24:59,243 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 00:24:59,243 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-23 00:24:59,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:24:59 BoogieIcfgContainer [2024-11-23 00:24:59,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 00:24:59,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 00:24:59,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 00:24:59,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 00:24:59,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:24:56" (1/3) ... [2024-11-23 00:24:59,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c469428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:24:59, skipping insertion in model container [2024-11-23 00:24:59,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:58" (2/3) ... [2024-11-23 00:24:59,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c469428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:24:59, skipping insertion in model container [2024-11-23 00:24:59,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:24:59" (3/3) ... [2024-11-23 00:24:59,263 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_square_17_bad.i [2024-11-23 00:24:59,279 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 00:24:59,279 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-23 00:24:59,342 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 00:24:59,348 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;@7d97e121, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 00:24:59,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-23 00:24:59,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 28 states have internal predecessors, (33), 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-11-23 00:24:59,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-23 00:24:59,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 00:24:59,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 00:24:59,359 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-11-23 00:24:59,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 00:24:59,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1480219397, now seen corresponding path program 1 times [2024-11-23 00:24:59,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 00:24:59,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27916895] [2024-11-23 00:24:59,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 00:24:59,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 00:24:59,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 00:24:59,375 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 00:24:59,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-23 00:24:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 00:24:59,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-23 00:24:59,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 00:24:59,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 00:24:59,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 00:24:59,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 00:24:59,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27916895] [2024-11-23 00:24:59,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27916895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 00:24:59,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 00:24:59,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-23 00:24:59,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179660476] [2024-11-23 00:24:59,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 00:24:59,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-23 00:24:59,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 00:24:59,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 00:24:59,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 00:24:59,543 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 28 states have internal predecessors, (33), 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) Second operand has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 00:24:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 00:24:59,558 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-11-23 00:24:59,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 00:24:59,560 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-23 00:24:59,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 00:24:59,566 INFO L225 Difference]: With dead ends: 53 [2024-11-23 00:24:59,566 INFO L226 Difference]: Without dead ends: 24 [2024-11-23 00:24:59,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 00:24:59,571 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 00:24:59,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 00:24:59,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-23 00:24:59,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-23 00:24:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 21 states have internal predecessors, (24), 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-11-23 00:24:59,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-11-23 00:24:59,599 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 11 [2024-11-23 00:24:59,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 00:24:59,599 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-23 00:24:59,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 00:24:59,599 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-11-23 00:24:59,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-23 00:24:59,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 00:24:59,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 00:24:59,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-23 00:24:59,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 00:24:59,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-23 00:24:59,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 00:24:59,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1357787559, now seen corresponding path program 1 times [2024-11-23 00:24:59,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 00:24:59,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77299779] [2024-11-23 00:24:59,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 00:24:59,803 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 00:24:59,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 00:24:59,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 00:24:59,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-23 00:24:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 00:24:59,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 00:24:59,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 00:24:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 00:24:59,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 00:24:59,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 00:24:59,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77299779] [2024-11-23 00:24:59,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77299779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 00:24:59,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 00:24:59,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 00:24:59,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888654390] [2024-11-23 00:24:59,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 00:24:59,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 00:24:59,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 00:24:59,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 00:24:59,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 00:24:59,931 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11-23 00:24:59,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 00:24:59,959 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-11-23 00:24:59,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 00:24:59,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2024-11-23 00:24:59,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 00:24:59,962 INFO L225 Difference]: With dead ends: 37 [2024-11-23 00:24:59,962 INFO L226 Difference]: Without dead ends: 26 [2024-11-23 00:24:59,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 00:24:59,963 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 00:24:59,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 00:24:59,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-23 00:24:59,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-23 00:24:59,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 22 states have internal predecessors, (25), 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-11-23 00:24:59,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-11-23 00:24:59,974 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2024-11-23 00:24:59,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 00:24:59,974 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-23 00:24:59,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11-23 00:24:59,975 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-11-23 00:24:59,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-23 00:24:59,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 00:24:59,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 00:24:59,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-23 00:25:00,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 00:25:00,177 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-23 00:25:00,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 00:25:00,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1357839005, now seen corresponding path program 1 times [2024-11-23 00:25:00,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 00:25:00,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419041459] [2024-11-23 00:25:00,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 00:25:00,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 00:25:00,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 00:25:00,182 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 00:25:00,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-23 00:25:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 00:25:00,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 00:25:00,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 00:25:00,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 00:25:00,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 00:25:00,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 00:25:00,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419041459] [2024-11-23 00:25:00,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419041459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 00:25:00,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 00:25:00,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 00:25:00,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682355456] [2024-11-23 00:25:00,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 00:25:00,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 00:25:00,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 00:25:00,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 00:25:00,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 00:25:00,297 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-11-23 00:25:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 00:25:00,323 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-11-23 00:25:00,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 00:25:00,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2024-11-23 00:25:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 00:25:00,324 INFO L225 Difference]: With dead ends: 29 [2024-11-23 00:25:00,324 INFO L226 Difference]: Without dead ends: 28 [2024-11-23 00:25:00,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 00:25:00,326 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 00:25:00,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 00:25:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-23 00:25:00,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-23 00:25:00,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 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-11-23 00:25:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-11-23 00:25:00,330 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 12 [2024-11-23 00:25:00,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 00:25:00,331 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-11-23 00:25:00,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-11-23 00:25:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-11-23 00:25:00,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-23 00:25:00,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 00:25:00,332 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 00:25:00,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-23 00:25:00,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 00:25:00,533 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-11-23 00:25:00,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 00:25:00,534 INFO L85 PathProgramCache]: Analyzing trace with hash -174252117, now seen corresponding path program 1 times [2024-11-23 00:25:00,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 00:25:00,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581676119] [2024-11-23 00:25:00,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 00:25:00,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 00:25:00,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 00:25:00,538 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 00:25:00,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-23 00:25:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 00:25:00,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 00:25:00,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 00:25:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 00:25:00,642 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 00:25:00,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 00:25:00,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581676119] [2024-11-23 00:25:00,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581676119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 00:25:00,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 00:25:00,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 00:25:00,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994552906] [2024-11-23 00:25:00,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 00:25:00,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 00:25:00,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 00:25:00,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 00:25:00,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 00:25:00,647 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-11-23 00:25:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 00:25:00,769 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-11-23 00:25:00,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 00:25:00,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-11-23 00:25:00,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 00:25:00,776 INFO L225 Difference]: With dead ends: 32 [2024-11-23 00:25:00,776 INFO L226 Difference]: Without dead ends: 22 [2024-11-23 00:25:00,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-11-23 00:25:00,777 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 00:25:00,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 00:25:00,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-23 00:25:00,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-23 00:25:00,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-11-23 00:25:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-11-23 00:25:00,782 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2024-11-23 00:25:00,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 00:25:00,782 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-11-23 00:25:00,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-11-23 00:25:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-11-23 00:25:00,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-23 00:25:00,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 00:25:00,783 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 00:25:00,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-23 00:25:00,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 00:25:00,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-23 00:25:00,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 00:25:00,984 INFO L85 PathProgramCache]: Analyzing trace with hash -174200671, now seen corresponding path program 1 times [2024-11-23 00:25:00,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 00:25:00,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413712584] [2024-11-23 00:25:00,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 00:25:00,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 00:25:00,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 00:25:00,987 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 00:25:00,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-23 00:25:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 00:25:01,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 00:25:01,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 00:25:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 00:25:01,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 00:25:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 00:25:01,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 00:25:01,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413712584] [2024-11-23 00:25:01,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1413712584] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 00:25:01,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 00:25:01,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-23 00:25:01,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473249168] [2024-11-23 00:25:01,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 00:25:01,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 00:25:01,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 00:25:01,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 00:25:01,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-23 00:25:01,137 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-11-23 00:25:01,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 00:25:01,169 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-11-23 00:25:01,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 00:25:01,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-11-23 00:25:01,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 00:25:01,172 INFO L225 Difference]: With dead ends: 28 [2024-11-23 00:25:01,172 INFO L226 Difference]: Without dead ends: 18 [2024-11-23 00:25:01,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-23 00:25:01,174 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 00:25:01,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 00:25:01,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-23 00:25:01,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-23 00:25:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 00:25:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2024-11-23 00:25:01,178 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2024-11-23 00:25:01,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 00:25:01,179 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2024-11-23 00:25:01,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-11-23 00:25:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2024-11-23 00:25:01,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-23 00:25:01,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 00:25:01,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 00:25:01,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-23 00:25:01,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 00:25:01,380 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-11-23 00:25:01,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 00:25:01,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1106848259, now seen corresponding path program 1 times [2024-11-23 00:25:01,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 00:25:01,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230916760] [2024-11-23 00:25:01,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 00:25:01,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 00:25:01,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 00:25:01,383 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 00:25:01,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-23 00:25:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 00:25:01,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 00:25:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 00:25:01,558 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-23 00:25:01,559 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-23 00:25:01,560 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-23 00:25:01,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-23 00:25:01,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-23 00:25:01,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-23 00:25:01,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-23 00:25:01,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-23 00:25:01,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-23 00:25:01,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 00:25:01,770 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-23 00:25:01,801 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 00:25:01,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:25:01 BoogieIcfgContainer [2024-11-23 00:25:01,806 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 00:25:01,806 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 00:25:01,807 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 00:25:01,807 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 00:25:01,807 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:24:59" (3/4) ... [2024-11-23 00:25:01,810 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-23 00:25:01,811 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 00:25:01,811 INFO L158 Benchmark]: Toolchain (without parser) took 4987.83ms. Allocated memory was 60.8MB in the beginning and 96.5MB in the end (delta: 35.7MB). Free memory was 30.6MB in the beginning and 39.7MB in the end (delta: -9.1MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-11-23 00:25:01,811 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 41.9MB. Free memory was 25.7MB in the beginning and 25.6MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 00:25:01,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1550.74ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 30.4MB in the beginning and 42.9MB in the end (delta: -12.5MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2024-11-23 00:25:01,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.20ms. Allocated memory is still 77.6MB. Free memory was 42.9MB in the beginning and 38.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-23 00:25:01,815 INFO L158 Benchmark]: Boogie Preprocessor took 42.00ms. Allocated memory is still 77.6MB. Free memory was 38.7MB in the beginning and 36.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 00:25:01,815 INFO L158 Benchmark]: RCFGBuilder took 758.28ms. Allocated memory is still 77.6MB. Free memory was 36.1MB in the beginning and 21.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-23 00:25:01,815 INFO L158 Benchmark]: TraceAbstraction took 2550.24ms. Allocated memory was 77.6MB in the beginning and 96.5MB in the end (delta: 18.9MB). Free memory was 45.4MB in the beginning and 39.7MB in the end (delta: 5.7MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-11-23 00:25:01,815 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 96.5MB. Free memory is still 39.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 00:25:01,817 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00ms. Allocated memory is still 41.9MB. Free memory was 25.7MB in the beginning and 25.6MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1550.74ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 30.4MB in the beginning and 42.9MB in the end (delta: -12.5MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.20ms. Allocated memory is still 77.6MB. Free memory was 42.9MB in the beginning and 38.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.00ms. Allocated memory is still 77.6MB. Free memory was 38.7MB in the beginning and 36.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 758.28ms. Allocated memory is still 77.6MB. Free memory was 36.1MB in the beginning and 21.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2550.24ms. Allocated memory was 77.6MB in the beginning and 96.5MB in the end (delta: 18.9MB). Free memory was 45.4MB in the beginning and 39.7MB in the end (delta: 5.7MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 96.5MB. Free memory is still 39.7MB. There was no memory consumed. 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 - UnprovableResult [Line: 1844]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1852. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1852] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1852] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1853] CALL CWE190_Integer_Overflow__int_max_square_17_bad() [L1834] int i,j; [L1835] int data; [L1836] data = 0 [L1837] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1837] COND TRUE i < 1 [L1839] data = 0x7fffffff VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1837] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1837] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1841] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1841] COND TRUE j < 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1844] data * data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1837]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1837]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1844]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1841]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1841]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 251 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 141 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 110 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 209 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 7/9 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-23 00:25:01,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample