./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_07_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_rand_postinc_07_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 e7d025f968a518a8922b38ef2cfea5ef601dcadbc08da8e289309cab3b5124c6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 00:27:59,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 00:27:59,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-23 00:27:59,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 00:27:59,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 00:27:59,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 00:27:59,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 00:27:59,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 00:27:59,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 00:27:59,989 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 00:27:59,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 00:27:59,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 00:27:59,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 00:27:59,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 00:27:59,992 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 00:27:59,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 00:27:59,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 00:27:59,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 00:27:59,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 00:27:59,994 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 00:27:59,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 00:27:59,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 00:27:59,999 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 00:27:59,999 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-23 00:27:59,999 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 00:27:59,999 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 00:27:59,999 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 00:28:00,000 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 00:28:00,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 00:28:00,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 00:28:00,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 00:28:00,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 00:28:00,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 00:28:00,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 00:28:00,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 00:28:00,002 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 00:28:00,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 00:28:00,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 00:28:00,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 00:28:00,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 00:28:00,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 00:28:00,006 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 -> e7d025f968a518a8922b38ef2cfea5ef601dcadbc08da8e289309cab3b5124c6 [2024-11-23 00:28:00,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 00:28:00,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 00:28:00,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 00:28:00,275 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 00:28:00,275 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 00:28:00,276 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_rand_postinc_07_bad.i [2024-11-23 00:28:01,728 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 00:28:02,049 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 00:28:02,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_07_bad.i [2024-11-23 00:28:02,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c550ff1fd/06f1a8bc80864b7eaffc8978298655c7/FLAG4cf34f340 [2024-11-23 00:28:02,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c550ff1fd/06f1a8bc80864b7eaffc8978298655c7 [2024-11-23 00:28:02,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 00:28:02,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 00:28:02,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 00:28:02,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 00:28:02,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 00:28:02,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:28:02" (1/1) ... [2024-11-23 00:28:02,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e60a72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:02, skipping insertion in model container [2024-11-23 00:28:02,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:28:02" (1/1) ... [2024-11-23 00:28:02,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 00:28:02,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 00:28:02,898 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 00:28:02,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 00:28:03,106 INFO L204 MainTranslator]: Completed translation [2024-11-23 00:28:03,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:03 WrapperNode [2024-11-23 00:28:03,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 00:28:03,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 00:28:03,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 00:28:03,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 00:28:03,114 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:28:03" (1/1) ... [2024-11-23 00:28:03,145 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:28:03" (1/1) ... [2024-11-23 00:28:03,181 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2024-11-23 00:28:03,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 00:28:03,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 00:28:03,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 00:28:03,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 00:28:03,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:03" (1/1) ... [2024-11-23 00:28:03,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:03" (1/1) ... [2024-11-23 00:28:03,199 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:03" (1/1) ... [2024-11-23 00:28:03,220 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-23 00:28:03,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:03" (1/1) ... [2024-11-23 00:28:03,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:03" (1/1) ... [2024-11-23 00:28:03,227 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:03" (1/1) ... [2024-11-23 00:28:03,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:03" (1/1) ... [2024-11-23 00:28:03,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:03" (1/1) ... [2024-11-23 00:28:03,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:03" (1/1) ... [2024-11-23 00:28:03,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 00:28:03,235 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 00:28:03,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 00:28:03,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 00:28:03,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:03" (1/1) ... [2024-11-23 00:28:03,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 00:28:03,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 00:28:03,271 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:28:03,274 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:28:03,314 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-23 00:28:03,314 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-23 00:28:03,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 00:28:03,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 00:28:03,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 00:28:03,433 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 00:28:03,435 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 00:28:03,602 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-23 00:28:03,602 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 00:28:03,614 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 00:28:03,615 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-23 00:28:03,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:28:03 BoogieIcfgContainer [2024-11-23 00:28:03,615 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 00:28:03,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 00:28:03,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 00:28:03,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 00:28:03,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:28:02" (1/3) ... [2024-11-23 00:28:03,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79413485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:28:03, skipping insertion in model container [2024-11-23 00:28:03,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:03" (2/3) ... [2024-11-23 00:28:03,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79413485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:28:03, skipping insertion in model container [2024-11-23 00:28:03,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:28:03" (3/3) ... [2024-11-23 00:28:03,624 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_07_bad.i [2024-11-23 00:28:03,643 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 00:28:03,643 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-23 00:28:03,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 00:28:03,701 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;@51e30c58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 00:28:03,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 00:28:03,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 39 states have internal predecessors, (55), 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:28:03,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-23 00:28:03,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 00:28:03,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 00:28:03,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-23 00:28:03,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 00:28:03,734 INFO L85 PathProgramCache]: Analyzing trace with hash 433338487, now seen corresponding path program 1 times [2024-11-23 00:28:03,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 00:28:03,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367532937] [2024-11-23 00:28:03,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 00:28:03,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 00:28:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 00:28:04,026 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:28:04,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 00:28:04,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367532937] [2024-11-23 00:28:04,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367532937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 00:28:04,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 00:28:04,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 00:28:04,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259737532] [2024-11-23 00:28:04,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 00:28:04,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 00:28:04,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 00:28:04,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 00:28:04,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 00:28:04,063 INFO L87 Difference]: Start difference. First operand has 43 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 39 states have internal predecessors, (55), 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 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 00:28:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 00:28:04,094 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2024-11-23 00:28:04,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 00:28:04,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-23 00:28:04,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 00:28:04,103 INFO L225 Difference]: With dead ends: 59 [2024-11-23 00:28:04,103 INFO L226 Difference]: Without dead ends: 36 [2024-11-23 00:28:04,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:28:04,110 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 00:28:04,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 55 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 00:28:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-23 00:28:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-23 00:28:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 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:28:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-23 00:28:04,152 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 11 [2024-11-23 00:28:04,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 00:28:04,153 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-23 00:28:04,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 00:28:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-23 00:28:04,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-23 00:28:04,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 00:28:04,155 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:28:04,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 00:28:04,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-23 00:28:04,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 00:28:04,157 INFO L85 PathProgramCache]: Analyzing trace with hash -423377772, now seen corresponding path program 1 times [2024-11-23 00:28:04,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 00:28:04,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850718232] [2024-11-23 00:28:04,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 00:28:04,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 00:28:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 00:28:04,530 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:28:04,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 00:28:04,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850718232] [2024-11-23 00:28:04,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850718232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 00:28:04,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 00:28:04,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 00:28:04,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42872762] [2024-11-23 00:28:04,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 00:28:04,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 00:28:04,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 00:28:04,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 00:28:04,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-23 00:28:04,535 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 00:28:04,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 00:28:04,664 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2024-11-23 00:28:04,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 00:28:04,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-23 00:28:04,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 00:28:04,665 INFO L225 Difference]: With dead ends: 42 [2024-11-23 00:28:04,665 INFO L226 Difference]: Without dead ends: 41 [2024-11-23 00:28:04,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-23 00:28:04,667 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 40 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 00:28:04,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 191 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 00:28:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-23 00:28:04,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-23 00:28:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 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:28:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2024-11-23 00:28:04,679 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 17 [2024-11-23 00:28:04,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 00:28:04,679 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2024-11-23 00:28:04,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 00:28:04,679 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2024-11-23 00:28:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-23 00:28:04,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 00:28:04,681 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:28:04,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 00:28:04,681 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-23 00:28:04,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 00:28:04,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1868440622, now seen corresponding path program 1 times [2024-11-23 00:28:04,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 00:28:04,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691771829] [2024-11-23 00:28:04,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 00:28:04,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 00:28:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 00:28:04,797 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:28:04,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 00:28:04,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691771829] [2024-11-23 00:28:04,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691771829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 00:28:04,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 00:28:04,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 00:28:04,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242449986] [2024-11-23 00:28:04,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 00:28:04,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 00:28:04,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 00:28:04,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 00:28:04,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 00:28:04,802 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 00:28:04,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 00:28:04,818 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2024-11-23 00:28:04,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 00:28:04,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-23 00:28:04,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 00:28:04,821 INFO L225 Difference]: With dead ends: 40 [2024-11-23 00:28:04,821 INFO L226 Difference]: Without dead ends: 39 [2024-11-23 00:28:04,821 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:28:04,823 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 36 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 00:28:04,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 97 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 00:28:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-23 00:28:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-11-23 00:28:04,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 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:28:04,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2024-11-23 00:28:04,829 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 17 [2024-11-23 00:28:04,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 00:28:04,829 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2024-11-23 00:28:04,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 00:28:04,830 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2024-11-23 00:28:04,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-23 00:28:04,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 00:28:04,830 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 00:28:04,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 00:28:04,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-23 00:28:04,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 00:28:04,831 INFO L85 PathProgramCache]: Analyzing trace with hash -239808910, now seen corresponding path program 1 times [2024-11-23 00:28:04,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 00:28:04,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406432104] [2024-11-23 00:28:04,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 00:28:04,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 00:28:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 00:28:04,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 00:28:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 00:28:04,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 00:28:04,897 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-23 00:28:04,899 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-23 00:28:04,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-23 00:28:04,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 00:28:04,904 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-23 00:28:04,932 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 00:28:04,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:28:04 BoogieIcfgContainer [2024-11-23 00:28:04,938 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 00:28:04,939 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 00:28:04,939 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 00:28:04,939 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 00:28:04,940 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:28:03" (3/4) ... [2024-11-23 00:28:04,942 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-23 00:28:04,943 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 00:28:04,944 INFO L158 Benchmark]: Toolchain (without parser) took 2839.15ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 79.2MB in the beginning and 78.8MB in the end (delta: 377.3kB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2024-11-23 00:28:04,944 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 138.4MB. Free memory was 111.4MB in the beginning and 111.2MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 00:28:04,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1001.58ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 79.1MB in the beginning and 102.3MB in the end (delta: -23.2MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2024-11-23 00:28:04,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.92ms. Allocated memory is still 188.7MB. Free memory was 102.3MB in the beginning and 99.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 00:28:04,945 INFO L158 Benchmark]: Boogie Preprocessor took 51.83ms. Allocated memory is still 188.7MB. Free memory was 99.4MB in the beginning and 97.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 00:28:04,945 INFO L158 Benchmark]: RCFGBuilder took 380.03ms. Allocated memory is still 188.7MB. Free memory was 97.3MB in the beginning and 80.4MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-23 00:28:04,946 INFO L158 Benchmark]: TraceAbstraction took 1320.73ms. Allocated memory is still 188.7MB. Free memory was 79.3MB in the beginning and 78.8MB in the end (delta: 415.5kB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2024-11-23 00:28:04,946 INFO L158 Benchmark]: Witness Printer took 4.21ms. Allocated memory is still 188.7MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 00:28:04,948 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.18ms. Allocated memory is still 138.4MB. Free memory was 111.4MB in the beginning and 111.2MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1001.58ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 79.1MB in the beginning and 102.3MB in the end (delta: -23.2MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.92ms. Allocated memory is still 188.7MB. Free memory was 102.3MB in the beginning and 99.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.83ms. Allocated memory is still 188.7MB. Free memory was 99.4MB in the beginning and 97.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 380.03ms. Allocated memory is still 188.7MB. Free memory was 97.3MB in the beginning and 80.4MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1320.73ms. Allocated memory is still 188.7MB. Free memory was 79.3MB in the beginning and 78.8MB in the end (delta: 415.5kB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. * Witness Printer took 4.21ms. Allocated memory is still 188.7MB. Free memory is still 78.8MB. 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: 1560]: 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 1569. 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); [L1548] static int staticFive = 5; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1569] 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, staticFive=5] [L1414] COND TRUE line != ((void *)0) [L1569] 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, staticFive=5] [L1570] CALL CWE190_Integer_Overflow__int_rand_postinc_07_bad() [L1551] int data; [L1552] data = 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, staticFive=5] [L1553] COND TRUE staticFive==5 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) 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, staticFive=5] [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() 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, staticFive=5] [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 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, staticFive=5] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1557] COND TRUE staticFive==5 [L1560] 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, staticFive=5] - UnprovableResult [Line: 1560]: 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, 43 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 343 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 138 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 82 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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:28:04,968 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_rand_postinc_07_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 e7d025f968a518a8922b38ef2cfea5ef601dcadbc08da8e289309cab3b5124c6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 00:28:07,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 00:28:07,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-23 00:28:07,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 00:28:07,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 00:28:07,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-23 00:28:07,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 00:28:07,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 00:28:07,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 00:28:07,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 00:28:07,268 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 00:28:07,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 00:28:07,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 00:28:07,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 00:28:07,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 00:28:07,269 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 00:28:07,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 00:28:07,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 00:28:07,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 00:28:07,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 00:28:07,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 00:28:07,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 00:28:07,277 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-23 00:28:07,277 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-23 00:28:07,278 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 00:28:07,278 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-23 00:28:07,278 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-23 00:28:07,278 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 00:28:07,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 00:28:07,279 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 00:28:07,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 00:28:07,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 00:28:07,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 00:28:07,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 00:28:07,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 00:28:07,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 00:28:07,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 00:28:07,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 00:28:07,283 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-23 00:28:07,283 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-23 00:28:07,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 00:28:07,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 00:28:07,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 00:28:07,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 00:28:07,285 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 -> e7d025f968a518a8922b38ef2cfea5ef601dcadbc08da8e289309cab3b5124c6 [2024-11-23 00:28:07,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 00:28:07,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 00:28:07,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 00:28:07,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 00:28:07,633 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 00:28:07,634 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_rand_postinc_07_bad.i [2024-11-23 00:28:09,204 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 00:28:09,542 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 00:28:09,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_07_bad.i [2024-11-23 00:28:09,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dfe33709/5612f2ae2ab14cd2998da76196a48c53/FLAG4dd995f00 [2024-11-23 00:28:09,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dfe33709/5612f2ae2ab14cd2998da76196a48c53 [2024-11-23 00:28:09,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 00:28:09,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 00:28:09,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 00:28:09,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 00:28:09,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 00:28:09,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:28:09" (1/1) ... [2024-11-23 00:28:09,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44493505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:09, skipping insertion in model container [2024-11-23 00:28:09,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:28:09" (1/1) ... [2024-11-23 00:28:09,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 00:28:10,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 00:28:10,644 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 00:28:10,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 00:28:10,875 INFO L204 MainTranslator]: Completed translation [2024-11-23 00:28:10,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:10 WrapperNode [2024-11-23 00:28:10,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 00:28:10,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 00:28:10,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 00:28:10,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 00:28:10,883 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:28:10" (1/1) ... [2024-11-23 00:28:10,910 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:28:10" (1/1) ... [2024-11-23 00:28:10,934 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2024-11-23 00:28:10,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 00:28:10,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 00:28:10,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 00:28:10,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 00:28:10,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:10" (1/1) ... [2024-11-23 00:28:10,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:10" (1/1) ... [2024-11-23 00:28:10,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:10" (1/1) ... [2024-11-23 00:28:10,957 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-23 00:28:10,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:10" (1/1) ... [2024-11-23 00:28:10,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:10" (1/1) ... [2024-11-23 00:28:10,964 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:10" (1/1) ... [2024-11-23 00:28:10,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:10" (1/1) ... [2024-11-23 00:28:10,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:10" (1/1) ... [2024-11-23 00:28:10,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:10" (1/1) ... [2024-11-23 00:28:10,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 00:28:10,974 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 00:28:10,974 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 00:28:10,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 00:28:10,975 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:10" (1/1) ... [2024-11-23 00:28:10,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 00:28:10,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 00:28:11,006 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:28:11,010 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:28:11,046 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-23 00:28:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-23 00:28:11,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 00:28:11,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 00:28:11,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 00:28:11,201 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 00:28:11,203 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 00:28:11,340 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-23 00:28:11,341 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 00:28:11,353 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 00:28:11,354 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-23 00:28:11,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:28:11 BoogieIcfgContainer [2024-11-23 00:28:11,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 00:28:11,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 00:28:11,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 00:28:11,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 00:28:11,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:28:09" (1/3) ... [2024-11-23 00:28:11,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8739ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:28:11, skipping insertion in model container [2024-11-23 00:28:11,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:10" (2/3) ... [2024-11-23 00:28:11,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8739ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:28:11, skipping insertion in model container [2024-11-23 00:28:11,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:28:11" (3/3) ... [2024-11-23 00:28:11,362 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_07_bad.i [2024-11-23 00:28:11,377 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 00:28:11,378 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-23 00:28:11,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 00:28:11,438 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;@766eb5a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 00:28:11,439 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 00:28:11,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 00:28:11,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-23 00:28:11,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 00:28:11,448 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 00:28:11,448 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-23 00:28:11,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 00:28:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1654475935, now seen corresponding path program 1 times [2024-11-23 00:28:11,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 00:28:11,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650050300] [2024-11-23 00:28:11,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 00:28:11,467 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:28:11,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 00:28:11,470 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:28:11,472 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:28:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 00:28:11,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-23 00:28:11,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 00:28:11,611 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:28:11,611 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 00:28:11,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 00:28:11,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650050300] [2024-11-23 00:28:11,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650050300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 00:28:11,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 00:28:11,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-23 00:28:11,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143903451] [2024-11-23 00:28:11,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 00:28:11,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-23 00:28:11,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 00:28:11,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 00:28:11,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 00:28:11,640 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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:28:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 00:28:11,651 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-11-23 00:28:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 00:28:11,652 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:28:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 00:28:11,656 INFO L225 Difference]: With dead ends: 23 [2024-11-23 00:28:11,656 INFO L226 Difference]: Without dead ends: 15 [2024-11-23 00:28:11,658 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:28:11,661 INFO L432 NwaCegarLoop]: 26 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, 26 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:28:11,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 00:28:11,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-23 00:28:11,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-23 00:28:11,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 00:28:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-11-23 00:28:11,684 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2024-11-23 00:28:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 00:28:11,685 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-23 00:28:11,685 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:28:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-11-23 00:28:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-23 00:28:11,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 00:28:11,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 00:28:11,691 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:28:11,887 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:28:11,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-23 00:28:11,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 00:28:11,888 INFO L85 PathProgramCache]: Analyzing trace with hash -250853505, now seen corresponding path program 1 times [2024-11-23 00:28:11,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 00:28:11,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379318855] [2024-11-23 00:28:11,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 00:28:11,889 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:28:11,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 00:28:11,891 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:28:11,892 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:28:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 00:28:11,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 00:28:11,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 00:28:12,011 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:28:12,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 00:28:12,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 00:28:12,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379318855] [2024-11-23 00:28:12,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379318855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 00:28:12,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 00:28:12,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 00:28:12,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143962035] [2024-11-23 00:28:12,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 00:28:12,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 00:28:12,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 00:28:12,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 00:28:12,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 00:28:12,026 INFO L87 Difference]: Start difference. First operand 15 states and 17 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:28:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 00:28:12,036 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2024-11-23 00:28:12,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 00:28:12,037 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:28:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 00:28:12,038 INFO L225 Difference]: With dead ends: 19 [2024-11-23 00:28:12,038 INFO L226 Difference]: Without dead ends: 15 [2024-11-23 00:28:12,038 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:28:12,039 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 00:28:12,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 00:28:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-23 00:28:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-23 00:28:12,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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:28:12,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-23 00:28:12,045 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2024-11-23 00:28:12,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 00:28:12,046 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-23 00:28:12,046 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:28:12,047 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-23 00:28:12,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-23 00:28:12,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 00:28:12,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 00:28:12,053 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 (3)] Forceful destruction successful, exit code 0 [2024-11-23 00:28:12,249 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:28:12,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-23 00:28:12,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 00:28:12,251 INFO L85 PathProgramCache]: Analyzing trace with hash -819187548, now seen corresponding path program 1 times [2024-11-23 00:28:12,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 00:28:12,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268263047] [2024-11-23 00:28:12,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 00:28:12,252 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:28:12,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 00:28:12,257 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:28:12,258 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:28:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 00:28:12,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 00:28:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 00:28:12,376 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-23 00:28:12,376 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-23 00:28:12,377 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-23 00:28:12,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-23 00:28:12,384 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:28:12,579 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:28:12,582 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-23 00:28:12,602 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 00:28:12,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:28:12 BoogieIcfgContainer [2024-11-23 00:28:12,605 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 00:28:12,606 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 00:28:12,606 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 00:28:12,606 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 00:28:12,606 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:28:11" (3/4) ... [2024-11-23 00:28:12,608 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-23 00:28:12,609 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 00:28:12,609 INFO L158 Benchmark]: Toolchain (without parser) took 2817.38ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 36.1MB in the beginning and 40.4MB in the end (delta: -4.3MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-11-23 00:28:12,610 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 46.1MB. Free memory is still 29.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 00:28:12,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1081.87ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 35.9MB in the beginning and 46.1MB in the end (delta: -10.2MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2024-11-23 00:28:12,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.11ms. Allocated memory is still 81.8MB. Free memory was 46.1MB in the beginning and 43.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 00:28:12,618 INFO L158 Benchmark]: Boogie Preprocessor took 38.60ms. Allocated memory is still 81.8MB. Free memory was 43.0MB in the beginning and 40.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 00:28:12,618 INFO L158 Benchmark]: RCFGBuilder took 380.05ms. Allocated memory is still 81.8MB. Free memory was 40.4MB in the beginning and 52.2MB in the end (delta: -11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-23 00:28:12,618 INFO L158 Benchmark]: TraceAbstraction took 1249.11ms. Allocated memory is still 81.8MB. Free memory was 51.7MB in the beginning and 40.9MB in the end (delta: 10.8MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-23 00:28:12,619 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 81.8MB. Free memory was 40.9MB in the beginning and 40.4MB in the end (delta: 502.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 00:28:12,622 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.21ms. Allocated memory is still 46.1MB. Free memory is still 29.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1081.87ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 35.9MB in the beginning and 46.1MB in the end (delta: -10.2MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.11ms. Allocated memory is still 81.8MB. Free memory was 46.1MB in the beginning and 43.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.60ms. Allocated memory is still 81.8MB. Free memory was 43.0MB in the beginning and 40.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 380.05ms. Allocated memory is still 81.8MB. Free memory was 40.4MB in the beginning and 52.2MB in the end (delta: -11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1249.11ms. Allocated memory is still 81.8MB. Free memory was 51.7MB in the beginning and 40.9MB in the end (delta: 10.8MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 81.8MB. Free memory was 40.9MB in the beginning and 40.4MB in the end (delta: 502.1kB). 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: 1560]: 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 1569. 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); [L1548] static int staticFive = 5; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1569] 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, staticFive=5] [L1414] COND TRUE line != ((void *)0) [L1569] 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, staticFive=5] [L1570] CALL CWE190_Integer_Overflow__int_rand_postinc_07_bad() [L1551] int data; [L1552] data = 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, staticFive=5] [L1553] COND TRUE staticFive==5 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 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, staticFive=5] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1557] COND TRUE staticFive==5 [L1560] 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, staticFive=5] - UnprovableResult [Line: 1560]: 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, 23 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 43 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 5, 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.1s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 24 SizeOfPredicates, 0 NumberOfNonLiveVariables, 79 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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:28:12,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample