./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_08_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_multiply_08_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 04922c70fa5bd130bc4f0a7411e2bd337735881da4bcb810ef3dd2bf337b06ed --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 21:01:15,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 21:01:15,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-10 21:01:15,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 21:01:15,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 21:01:15,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 21:01:15,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 21:01:15,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 21:01:15,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 21:01:15,875 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 21:01:15,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 21:01:15,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 21:01:15,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 21:01:15,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 21:01:15,878 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 21:01:15,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 21:01:15,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 21:01:15,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 21:01:15,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 21:01:15,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 21:01:15,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 21:01:15,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 21:01:15,883 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 21:01:15,883 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 21:01:15,883 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 21:01:15,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 21:01:15,883 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 21:01:15,883 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 21:01:15,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 21:01:15,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 21:01:15,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 21:01:15,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:01:15,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 21:01:15,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 21:01:15,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 21:01:15,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 21:01:15,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 21:01:15,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 21:01:15,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 21:01:15,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 21:01:15,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 21:01:15,886 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 -> 04922c70fa5bd130bc4f0a7411e2bd337735881da4bcb810ef3dd2bf337b06ed [2024-11-10 21:01:16,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 21:01:16,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 21:01:16,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 21:01:16,101 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 21:01:16,101 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 21:01:16,102 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_multiply_08_bad.i [2024-11-10 21:01:17,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 21:01:17,568 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 21:01:17,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_08_bad.i [2024-11-10 21:01:17,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c9bbda8/5a5849ef14d8483a8891172980d48973/FLAG3ce8a005e [2024-11-10 21:01:17,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c9bbda8/5a5849ef14d8483a8891172980d48973 [2024-11-10 21:01:17,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 21:01:17,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 21:01:17,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 21:01:17,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 21:01:17,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 21:01:17,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:01:17" (1/1) ... [2024-11-10 21:01:17,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d2d17c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:17, skipping insertion in model container [2024-11-10 21:01:17,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:01:17" (1/1) ... [2024-11-10 21:01:17,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 21:01:18,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:01:18,225 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 21:01:18,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:01:18,384 INFO L204 MainTranslator]: Completed translation [2024-11-10 21:01:18,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:18 WrapperNode [2024-11-10 21:01:18,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 21:01:18,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 21:01:18,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 21:01:18,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 21:01:18,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:18" (1/1) ... [2024-11-10 21:01:18,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:18" (1/1) ... [2024-11-10 21:01:18,445 INFO L138 Inliner]: procedures = 499, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 107 [2024-11-10 21:01:18,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 21:01:18,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 21:01:18,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 21:01:18,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 21:01:18,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:18" (1/1) ... [2024-11-10 21:01:18,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:18" (1/1) ... [2024-11-10 21:01:18,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:18" (1/1) ... [2024-11-10 21:01:18,466 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-10 21:01:18,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:18" (1/1) ... [2024-11-10 21:01:18,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:18" (1/1) ... [2024-11-10 21:01:18,470 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:18" (1/1) ... [2024-11-10 21:01:18,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:18" (1/1) ... [2024-11-10 21:01:18,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:18" (1/1) ... [2024-11-10 21:01:18,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:18" (1/1) ... [2024-11-10 21:01:18,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 21:01:18,475 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 21:01:18,475 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 21:01:18,475 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 21:01:18,475 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:18" (1/1) ... [2024-11-10 21:01:18,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:01:18,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:01:18,503 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-10 21:01:18,504 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-10 21:01:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-10 21:01:18,536 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-10 21:01:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 21:01:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 21:01:18,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 21:01:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2024-11-10 21:01:18,537 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2024-11-10 21:01:18,638 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 21:01:18,640 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 21:01:18,805 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-10 21:01:18,805 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 21:01:18,827 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 21:01:18,828 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 21:01:18,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:01:18 BoogieIcfgContainer [2024-11-10 21:01:18,829 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 21:01:18,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 21:01:18,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 21:01:18,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 21:01:18,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:01:17" (1/3) ... [2024-11-10 21:01:18,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de1b480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:01:18, skipping insertion in model container [2024-11-10 21:01:18,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:18" (2/3) ... [2024-11-10 21:01:18,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de1b480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:01:18, skipping insertion in model container [2024-11-10 21:01:18,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:01:18" (3/3) ... [2024-11-10 21:01:18,837 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_08_bad.i [2024-11-10 21:01:18,849 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 21:01:18,849 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 21:01:18,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 21:01:18,935 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;@2271c170, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 21:01:18,936 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 21:01:18,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 43 states have (on average 1.441860465116279) internal successors, (62), 45 states have internal predecessors, (62), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 21:01:18,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 21:01:18,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:01:18,962 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:01:18,963 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 21:01:18,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:01:18,967 INFO L85 PathProgramCache]: Analyzing trace with hash -946183578, now seen corresponding path program 1 times [2024-11-10 21:01:18,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:01:18,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920059129] [2024-11-10 21:01:18,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:01:18,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:01:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:01:19,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 21:01:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:01:19,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 21:01:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:01:19,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 21:01:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:01:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 21:01:19,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:01:19,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920059129] [2024-11-10 21:01:19,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920059129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:01:19,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506864449] [2024-11-10 21:01:19,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:01:19,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:01:19,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:01:19,294 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:01:19,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 21:01:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:01:19,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 21:01:19,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:01:19,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 21:01:19,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:01:19,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506864449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:01:19,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:01:19,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-10 21:01:19,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099511887] [2024-11-10 21:01:19,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:01:19,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:01:19,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:01:19,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:01:19,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:01:19,429 INFO L87 Difference]: Start difference. First operand has 52 states, 43 states have (on average 1.441860465116279) internal successors, (62), 45 states have internal predecessors, (62), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 21:01:19,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:01:19,467 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2024-11-10 21:01:19,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:01:19,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-10 21:01:19,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:01:19,476 INFO L225 Difference]: With dead ends: 73 [2024-11-10 21:01:19,476 INFO L226 Difference]: Without dead ends: 44 [2024-11-10 21:01:19,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:01:19,483 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 36 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:01:19,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 87 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:01:19,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-10 21:01:19,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-10 21:01:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 21:01:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2024-11-10 21:01:19,516 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 22 [2024-11-10 21:01:19,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:01:19,518 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2024-11-10 21:01:19,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 21:01:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2024-11-10 21:01:19,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 21:01:19,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:01:19,521 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:01:19,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 21:01:19,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-10 21:01:19,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 21:01:19,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:01:19,723 INFO L85 PathProgramCache]: Analyzing trace with hash 746207220, now seen corresponding path program 1 times [2024-11-10 21:01:19,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:01:19,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043736382] [2024-11-10 21:01:19,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:01:19,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:01:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:01:19,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 21:01:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:01:19,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 21:01:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:01:19,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 21:01:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:01:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 21:01:19,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:01:19,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043736382] [2024-11-10 21:01:19,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043736382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:01:19,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:01:19,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 21:01:19,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895142900] [2024-11-10 21:01:19,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:01:19,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:01:19,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:01:19,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:01:19,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:01:19,831 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 21:01:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:01:19,850 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2024-11-10 21:01:19,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:01:19,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-10 21:01:19,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:01:19,852 INFO L225 Difference]: With dead ends: 44 [2024-11-10 21:01:19,852 INFO L226 Difference]: Without dead ends: 43 [2024-11-10 21:01:19,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-10 21:01:19,854 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:01:19,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 99 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:01:19,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-10 21:01:19,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-10 21:01:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 21:01:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2024-11-10 21:01:19,862 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 28 [2024-11-10 21:01:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:01:19,863 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2024-11-10 21:01:19,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 21:01:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2024-11-10 21:01:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 21:01:19,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:01:19,865 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:01:19,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 21:01:19,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 21:01:19,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:01:19,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1657587321, now seen corresponding path program 1 times [2024-11-10 21:01:19,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:01:19,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935282566] [2024-11-10 21:01:19,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:01:19,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:01:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 21:01:19,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 21:01:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 21:01:19,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 21:01:19,931 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 21:01:19,932 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-10 21:01:19,933 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-10 21:01:19,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 21:01:19,936 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 21:01:19,963 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 21:01:19,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:01:19 BoogieIcfgContainer [2024-11-10 21:01:19,968 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 21:01:19,968 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 21:01:19,968 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 21:01:19,969 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 21:01:19,969 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:01:18" (3/4) ... [2024-11-10 21:01:19,971 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 21:01:19,972 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 21:01:19,972 INFO L158 Benchmark]: Toolchain (without parser) took 2359.56ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 116.8MB in the beginning and 148.0MB in the end (delta: -31.2MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2024-11-10 21:01:19,973 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 96.5MB. Free memory is still 47.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 21:01:19,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 770.01ms. Allocated memory is still 184.5MB. Free memory was 116.8MB in the beginning and 98.6MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 21:01:19,974 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.76ms. Allocated memory is still 184.5MB. Free memory was 98.6MB in the beginning and 95.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 21:01:19,974 INFO L158 Benchmark]: Boogie Preprocessor took 26.84ms. Allocated memory is still 184.5MB. Free memory was 95.6MB in the beginning and 93.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 21:01:19,975 INFO L158 Benchmark]: IcfgBuilder took 354.79ms. Allocated memory is still 184.5MB. Free memory was 93.5MB in the beginning and 75.6MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 21:01:19,976 INFO L158 Benchmark]: TraceAbstraction took 1136.96ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 74.7MB in the beginning and 148.0MB in the end (delta: -73.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 21:01:19,976 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 241.2MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 21:01:19,977 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.61ms. Allocated memory is still 96.5MB. Free memory is still 47.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 770.01ms. Allocated memory is still 184.5MB. Free memory was 116.8MB in the beginning and 98.6MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.76ms. Allocated memory is still 184.5MB. Free memory was 98.6MB in the beginning and 95.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.84ms. Allocated memory is still 184.5MB. Free memory was 95.6MB in the beginning and 93.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 354.79ms. Allocated memory is still 184.5MB. Free memory was 93.5MB in the beginning and 75.6MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1136.96ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 74.7MB in the beginning and 148.0MB in the end (delta: -73.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 241.2MB. Free memory is still 148.0MB. 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: 1568]: 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 1576. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1576] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1576] 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] [L1577] CALL CWE190_Integer_Overflow__int_rand_multiply_08_bad() [L1558] int data; [L1559] 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] [L1560] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] RET staticReturnsTrue() 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] [L1560] COND TRUE staticReturnsTrue() [L1562] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1562] 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] [L1562] 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] [L1562] 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] [L1562] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1564] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] RET staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] COND TRUE staticReturnsTrue() [L1566] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1568] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1568]: 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 3 procedures, 52 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 186 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 116 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 93 SizeOfPredicates, 0 NumberOfNonLiveVariables, 85 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 7/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 21:01:20,001 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/11.0.12-open/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_multiply_08_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 04922c70fa5bd130bc4f0a7411e2bd337735881da4bcb810ef3dd2bf337b06ed --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 21:01:21,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 21:01:21,893 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-10 21:01:21,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 21:01:21,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 21:01:21,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-10 21:01:21,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 21:01:21,923 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 21:01:21,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 21:01:21,927 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 21:01:21,927 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 21:01:21,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 21:01:21,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 21:01:21,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 21:01:21,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 21:01:21,928 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 21:01:21,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 21:01:21,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 21:01:21,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 21:01:21,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 21:01:21,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 21:01:21,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 21:01:21,931 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 21:01:21,932 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 21:01:21,932 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 21:01:21,933 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 21:01:21,933 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 21:01:21,933 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 21:01:21,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 21:01:21,933 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 21:01:21,934 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 21:01:21,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 21:01:21,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 21:01:21,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 21:01:21,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:01:21,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 21:01:21,934 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 21:01:21,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 21:01:21,935 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 21:01:21,935 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 21:01:21,935 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 21:01:21,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 21:01:21,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 21:01:21,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 21:01:21,937 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 -> 04922c70fa5bd130bc4f0a7411e2bd337735881da4bcb810ef3dd2bf337b06ed [2024-11-10 21:01:22,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 21:01:22,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 21:01:22,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 21:01:22,222 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 21:01:22,222 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 21:01:22,223 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_multiply_08_bad.i [2024-11-10 21:01:23,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 21:01:23,759 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 21:01:23,759 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_08_bad.i [2024-11-10 21:01:23,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50bfa2d95/1713848b339e4fc7a3aeb80fe2a2a593/FLAG88a6cae52 [2024-11-10 21:01:24,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50bfa2d95/1713848b339e4fc7a3aeb80fe2a2a593 [2024-11-10 21:01:24,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 21:01:24,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 21:01:24,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 21:01:24,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 21:01:24,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 21:01:24,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:01:24" (1/1) ... [2024-11-10 21:01:24,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@420d6104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:24, skipping insertion in model container [2024-11-10 21:01:24,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:01:24" (1/1) ... [2024-11-10 21:01:24,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 21:01:24,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:01:24,696 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 21:01:24,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:01:24,853 INFO L204 MainTranslator]: Completed translation [2024-11-10 21:01:24,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:24 WrapperNode [2024-11-10 21:01:24,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 21:01:24,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 21:01:24,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 21:01:24,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 21:01:24,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:24" (1/1) ... [2024-11-10 21:01:24,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:24" (1/1) ... [2024-11-10 21:01:24,901 INFO L138 Inliner]: procedures = 504, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2024-11-10 21:01:24,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 21:01:24,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 21:01:24,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 21:01:24,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 21:01:24,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:24" (1/1) ... [2024-11-10 21:01:24,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:24" (1/1) ... [2024-11-10 21:01:24,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:24" (1/1) ... [2024-11-10 21:01:24,926 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-10 21:01:24,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:24" (1/1) ... [2024-11-10 21:01:24,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:24" (1/1) ... [2024-11-10 21:01:24,938 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:24" (1/1) ... [2024-11-10 21:01:24,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:24" (1/1) ... [2024-11-10 21:01:24,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:24" (1/1) ... [2024-11-10 21:01:24,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:24" (1/1) ... [2024-11-10 21:01:24,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 21:01:24,948 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 21:01:24,948 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 21:01:24,948 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 21:01:24,948 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:24" (1/1) ... [2024-11-10 21:01:24,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:01:24,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:01:24,973 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-10 21:01:24,975 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-10 21:01:25,005 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-10 21:01:25,005 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-10 21:01:25,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 21:01:25,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 21:01:25,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 21:01:25,005 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2024-11-10 21:01:25,005 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2024-11-10 21:01:25,144 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 21:01:25,146 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 21:01:25,257 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-10 21:01:25,257 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 21:01:25,267 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 21:01:25,268 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 21:01:25,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:01:25 BoogieIcfgContainer [2024-11-10 21:01:25,269 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 21:01:25,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 21:01:25,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 21:01:25,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 21:01:25,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:01:24" (1/3) ... [2024-11-10 21:01:25,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26246e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:01:25, skipping insertion in model container [2024-11-10 21:01:25,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:24" (2/3) ... [2024-11-10 21:01:25,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26246e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:01:25, skipping insertion in model container [2024-11-10 21:01:25,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:01:25" (3/3) ... [2024-11-10 21:01:25,277 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_08_bad.i [2024-11-10 21:01:25,289 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 21:01:25,290 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 21:01:25,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 21:01:25,342 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;@21a0678, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 21:01:25,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 21:01:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 21:01:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 21:01:25,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:01:25,352 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:01:25,352 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 21:01:25,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:01:25,357 INFO L85 PathProgramCache]: Analyzing trace with hash -861156824, now seen corresponding path program 1 times [2024-11-10 21:01:25,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:01:25,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268467876] [2024-11-10 21:01:25,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:01:25,370 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-10 21:01:25,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:01:25,372 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-10 21:01:25,397 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-10 21:01:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:01:25,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 21:01:25,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:01:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:01:25,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:01:25,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:01:25,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268467876] [2024-11-10 21:01:25,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268467876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:01:25,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:01:25,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:01:25,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047092426] [2024-11-10 21:01:25,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:01:25,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:01:25,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:01:25,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:01:25,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:01:25,560 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 21:01:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:01:25,585 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2024-11-10 21:01:25,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:01:25,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-10 21:01:25,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:01:25,592 INFO L225 Difference]: With dead ends: 52 [2024-11-10 21:01:25,592 INFO L226 Difference]: Without dead ends: 22 [2024-11-10 21:01:25,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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-10 21:01:25,598 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:01:25,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:01:25,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-10 21:01:25,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-10 21:01:25,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 21:01:25,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-10 21:01:25,624 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2024-11-10 21:01:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:01:25,625 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-10 21:01:25,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 21:01:25,626 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-10 21:01:25,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 21:01:25,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:01:25,628 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:01:25,632 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 (2)] Forceful destruction successful, exit code 0 [2024-11-10 21:01:25,828 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-10 21:01:25,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 21:01:25,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:01:25,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1630855050, now seen corresponding path program 1 times [2024-11-10 21:01:25,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:01:25,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455129716] [2024-11-10 21:01:25,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:01:25,831 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-10 21:01:25,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:01:25,832 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-10 21:01:25,833 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-10 21:01:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:01:25,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 21:01:25,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:01:25,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 21:01:25,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:01:25,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:01:25,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455129716] [2024-11-10 21:01:25,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455129716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:01:25,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:01:25,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 21:01:25,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047786251] [2024-11-10 21:01:25,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:01:25,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:01:25,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:01:25,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:01:25,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:01:25,910 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 21:01:25,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:01:25,919 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2024-11-10 21:01:25,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:01:25,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2024-11-10 21:01:25,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:01:25,920 INFO L225 Difference]: With dead ends: 22 [2024-11-10 21:01:25,920 INFO L226 Difference]: Without dead ends: 21 [2024-11-10 21:01:25,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-10 21:01:25,921 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:01:25,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 39 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:01:25,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-10 21:01:25,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-10 21:01:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 21:01:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-11-10 21:01:25,925 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 22 [2024-11-10 21:01:25,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:01:25,925 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-10 21:01:25,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 21:01:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-11-10 21:01:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 21:01:25,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:01:25,926 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:01:25,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 21:01:26,126 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-10 21:01:26,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 21:01:26,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:01:26,130 INFO L85 PathProgramCache]: Analyzing trace with hash -983101021, now seen corresponding path program 1 times [2024-11-10 21:01:26,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:01:26,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194552666] [2024-11-10 21:01:26,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:01:26,131 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-10 21:01:26,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:01:26,155 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-10 21:01:26,156 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-10 21:01:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 21:01:26,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 21:01:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 21:01:26,279 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 21:01:26,294 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 21:01:26,295 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-10 21:01:26,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-10 21:01:26,304 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-10 21:01:26,497 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-10 21:01:26,500 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 21:01:26,519 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 21:01:26,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:01:26 BoogieIcfgContainer [2024-11-10 21:01:26,523 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 21:01:26,523 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 21:01:26,523 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 21:01:26,523 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 21:01:26,524 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:01:25" (3/4) ... [2024-11-10 21:01:26,527 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 21:01:26,527 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 21:01:26,528 INFO L158 Benchmark]: Toolchain (without parser) took 2493.53ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 68.6MB in the beginning and 90.3MB in the end (delta: -21.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 21:01:26,528 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 60.8MB. Free memory is still 40.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 21:01:26,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 818.18ms. Allocated memory is still 104.9MB. Free memory was 68.6MB in the beginning and 64.8MB in the end (delta: 3.8MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2024-11-10 21:01:26,529 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.15ms. Allocated memory is still 104.9MB. Free memory was 64.6MB in the beginning and 61.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 21:01:26,531 INFO L158 Benchmark]: Boogie Preprocessor took 44.08ms. Allocated memory is still 104.9MB. Free memory was 61.2MB in the beginning and 59.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 21:01:26,531 INFO L158 Benchmark]: IcfgBuilder took 321.12ms. Allocated memory is still 104.9MB. Free memory was 58.5MB in the beginning and 43.7MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 21:01:26,532 INFO L158 Benchmark]: TraceAbstraction took 1252.64ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 43.0MB in the beginning and 90.3MB in the end (delta: -47.3MB). Peak memory consumption was 29.0kB. Max. memory is 16.1GB. [2024-11-10 21:01:26,532 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 125.8MB. Free memory is still 90.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 21:01:26,533 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 60.8MB. Free memory is still 40.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 818.18ms. Allocated memory is still 104.9MB. Free memory was 68.6MB in the beginning and 64.8MB in the end (delta: 3.8MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.15ms. Allocated memory is still 104.9MB. Free memory was 64.6MB in the beginning and 61.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.08ms. Allocated memory is still 104.9MB. Free memory was 61.2MB in the beginning and 59.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 321.12ms. Allocated memory is still 104.9MB. Free memory was 58.5MB in the beginning and 43.7MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1252.64ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 43.0MB in the beginning and 90.3MB in the end (delta: -47.3MB). Peak memory consumption was 29.0kB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 125.8MB. Free memory is still 90.3MB. 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: 1568]: 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 1576. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1576] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1576] 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] [L1577] CALL CWE190_Integer_Overflow__int_rand_multiply_08_bad() [L1558] int data; [L1559] 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] [L1560] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] RET staticReturnsTrue() 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] [L1560] COND TRUE staticReturnsTrue() [L1562] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1562] 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] [L1562] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1564] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] RET staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] COND TRUE staticReturnsTrue() [L1566] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1568] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1568]: 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 3 procedures, 30 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 55 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 7, 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, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 48 SizeOfPredicates, 0 NumberOfNonLiveVariables, 111 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 21:01:26,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample