./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_12_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc 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_postinc_12_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 dc871371b7eb8945d46d164766cb79863f9bb5635a141197f34c58e079caf6b0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 12:34:38,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 12:34:38,532 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 12:34:38,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 12:34:38,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 12:34:38,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 12:34:38,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 12:34:38,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 12:34:38,563 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 12:34:38,565 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 12:34:38,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 12:34:38,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 12:34:38,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 12:34:38,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 12:34:38,567 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 12:34:38,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 12:34:38,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 12:34:38,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 12:34:38,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 12:34:38,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 12:34:38,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 12:34:38,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 12:34:38,571 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 12:34:38,571 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 12:34:38,571 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 12:34:38,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 12:34:38,572 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 12:34:38,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 12:34:38,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 12:34:38,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 12:34:38,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 12:34:38,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:34:38,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 12:34:38,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 12:34:38,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 12:34:38,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 12:34:38,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 12:34:38,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 12:34:38,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 12:34:38,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 12:34:38,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 12:34:38,576 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 -> dc871371b7eb8945d46d164766cb79863f9bb5635a141197f34c58e079caf6b0 [2024-11-19 12:34:38,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 12:34:38,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 12:34:38,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 12:34:38,837 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 12:34:38,838 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 12:34:38,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_12_bad.i [2024-11-19 12:34:40,230 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 12:34:40,449 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 12:34:40,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_12_bad.i [2024-11-19 12:34:40,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0d4a32a/71086ed0a2e24042b2acc6919018e052/FLAG13abe7de9 [2024-11-19 12:34:40,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0d4a32a/71086ed0a2e24042b2acc6919018e052 [2024-11-19 12:34:40,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 12:34:40,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 12:34:40,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 12:34:40,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 12:34:40,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 12:34:40,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:34:40" (1/1) ... [2024-11-19 12:34:40,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10dd8d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:40, skipping insertion in model container [2024-11-19 12:34:40,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:34:40" (1/1) ... [2024-11-19 12:34:40,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 12:34:41,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:34:41,594 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 12:34:41,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:34:41,778 INFO L204 MainTranslator]: Completed translation [2024-11-19 12:34:41,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:41 WrapperNode [2024-11-19 12:34:41,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 12:34:41,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 12:34:41,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 12:34:41,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 12:34:41,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:41" (1/1) ... [2024-11-19 12:34:41,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:41" (1/1) ... [2024-11-19 12:34:41,844 INFO L138 Inliner]: procedures = 497, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 120 [2024-11-19 12:34:41,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 12:34:41,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 12:34:41,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 12:34:41,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 12:34:41,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:41" (1/1) ... [2024-11-19 12:34:41,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:41" (1/1) ... [2024-11-19 12:34:41,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:41" (1/1) ... [2024-11-19 12:34:41,879 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 12:34:41,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:41" (1/1) ... [2024-11-19 12:34:41,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:41" (1/1) ... [2024-11-19 12:34:41,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:41" (1/1) ... [2024-11-19 12:34:41,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:41" (1/1) ... [2024-11-19 12:34:41,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:41" (1/1) ... [2024-11-19 12:34:41,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:41" (1/1) ... [2024-11-19 12:34:41,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 12:34:41,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 12:34:41,906 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 12:34:41,906 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 12:34:41,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:41" (1/1) ... [2024-11-19 12:34:41,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:34:41,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 12:34:41,938 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-19 12:34:41,939 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-19 12:34:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-19 12:34:41,973 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-19 12:34:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-19 12:34:41,973 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-19 12:34:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-19 12:34:41,974 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-19 12:34:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 12:34:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 12:34:41,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 12:34:42,075 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 12:34:42,077 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 12:34:42,235 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-11-19 12:34:42,236 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 12:34:42,246 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 12:34:42,246 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 12:34:42,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:34:42 BoogieIcfgContainer [2024-11-19 12:34:42,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 12:34:42,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 12:34:42,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 12:34:42,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 12:34:42,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:34:40" (1/3) ... [2024-11-19 12:34:42,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29777050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:34:42, skipping insertion in model container [2024-11-19 12:34:42,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:41" (2/3) ... [2024-11-19 12:34:42,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29777050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:34:42, skipping insertion in model container [2024-11-19 12:34:42,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:34:42" (3/3) ... [2024-11-19 12:34:42,254 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_12_bad.i [2024-11-19 12:34:42,268 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 12:34:42,268 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-19 12:34:42,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 12:34:42,318 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;@591e40bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 12:34:42,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-19 12:34:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 48 states have (on average 1.4375) internal successors, (69), 52 states have internal predecessors, (69), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 12:34:42,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 12:34:42,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:34:42,329 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:34:42,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 12:34:42,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:34:42,333 INFO L85 PathProgramCache]: Analyzing trace with hash 410761618, now seen corresponding path program 1 times [2024-11-19 12:34:42,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 12:34:42,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281259985] [2024-11-19 12:34:42,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:34:42,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 12:34:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:34:42,621 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-19 12:34:42,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 12:34:42,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281259985] [2024-11-19 12:34:42,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281259985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:34:42,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:34:42,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 12:34:42,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851416104] [2024-11-19 12:34:42,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:34:42,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 12:34:42,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 12:34:42,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 12:34:42,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:34:42,654 INFO L87 Difference]: Start difference. First operand has 63 states, 48 states have (on average 1.4375) internal successors, (69), 52 states have internal predecessors, (69), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-19 12:34:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:34:42,716 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2024-11-19 12:34:42,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 12:34:42,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 21 [2024-11-19 12:34:42,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:34:42,728 INFO L225 Difference]: With dead ends: 83 [2024-11-19 12:34:42,728 INFO L226 Difference]: Without dead ends: 52 [2024-11-19 12:34:42,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:34:42,733 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 2 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:34:42,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 242 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:34:42,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-19 12:34:42,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-11-19 12:34:42,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 44 states have internal predecessors, (59), 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-19 12:34:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-11-19 12:34:42,763 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 21 [2024-11-19 12:34:42,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:34:42,765 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-11-19 12:34:42,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-19 12:34:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-11-19 12:34:42,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 12:34:42,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:34:42,766 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-19 12:34:42,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 12:34:42,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 12:34:42,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:34:42,767 INFO L85 PathProgramCache]: Analyzing trace with hash -151283612, now seen corresponding path program 1 times [2024-11-19 12:34:42,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 12:34:42,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323214682] [2024-11-19 12:34:42,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:34:42,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 12:34:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:34:42,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-19 12:34:42,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 12:34:42,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323214682] [2024-11-19 12:34:42,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323214682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:34:42,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:34:42,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 12:34:42,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301171850] [2024-11-19 12:34:42,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:34:42,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 12:34:42,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 12:34:42,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 12:34:42,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:34:42,909 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-19 12:34:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:34:42,935 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2024-11-19 12:34:42,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 12:34:42,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-19 12:34:42,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:34:42,936 INFO L225 Difference]: With dead ends: 56 [2024-11-19 12:34:42,936 INFO L226 Difference]: Without dead ends: 48 [2024-11-19 12:34:42,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:34:42,937 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 1 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:34:42,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 186 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:34:42,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-19 12:34:42,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-19 12:34:42,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.435897435897436) internal successors, (56), 42 states have internal predecessors, (56), 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-19 12:34:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2024-11-19 12:34:42,943 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 22 [2024-11-19 12:34:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:34:42,943 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2024-11-19 12:34:42,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-19 12:34:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2024-11-19 12:34:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 12:34:42,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:34:42,944 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] [2024-11-19 12:34:42,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 12:34:42,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 12:34:42,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:34:42,945 INFO L85 PathProgramCache]: Analyzing trace with hash 859877077, now seen corresponding path program 1 times [2024-11-19 12:34:42,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 12:34:42,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633665373] [2024-11-19 12:34:42,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:34:42,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 12:34:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:34:43,131 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-19 12:34:43,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 12:34:43,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633665373] [2024-11-19 12:34:43,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633665373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:34:43,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:34:43,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 12:34:43,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132168074] [2024-11-19 12:34:43,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:34:43,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 12:34:43,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 12:34:43,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 12:34:43,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:34:43,135 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-19 12:34:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:34:43,153 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2024-11-19 12:34:43,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 12:34:43,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 27 [2024-11-19 12:34:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:34:43,154 INFO L225 Difference]: With dead ends: 48 [2024-11-19 12:34:43,155 INFO L226 Difference]: Without dead ends: 47 [2024-11-19 12:34:43,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:34:43,157 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:34:43,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:34:43,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-19 12:34:43,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-19 12:34:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 41 states have internal predecessors, (55), 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-19 12:34:43,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2024-11-19 12:34:43,183 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 27 [2024-11-19 12:34:43,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:34:43,183 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2024-11-19 12:34:43,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-19 12:34:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2024-11-19 12:34:43,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 12:34:43,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:34:43,189 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-19 12:34:43,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 12:34:43,189 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 12:34:43,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:34:43,192 INFO L85 PathProgramCache]: Analyzing trace with hash 886393729, now seen corresponding path program 1 times [2024-11-19 12:34:43,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 12:34:43,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557877652] [2024-11-19 12:34:43,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:34:43,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 12:34:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:34:43,337 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-19 12:34:43,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 12:34:43,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557877652] [2024-11-19 12:34:43,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557877652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:34:43,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:34:43,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 12:34:43,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69709042] [2024-11-19 12:34:43,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:34:43,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 12:34:43,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 12:34:43,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 12:34:43,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:34:43,341 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-19 12:34:43,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:34:43,356 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2024-11-19 12:34:43,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 12:34:43,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 28 [2024-11-19 12:34:43,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:34:43,357 INFO L225 Difference]: With dead ends: 47 [2024-11-19 12:34:43,357 INFO L226 Difference]: Without dead ends: 46 [2024-11-19 12:34:43,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:34:43,360 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:34:43,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 163 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:34:43,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-19 12:34:43,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-19 12:34:43,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 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-19 12:34:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2024-11-19 12:34:43,366 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 28 [2024-11-19 12:34:43,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:34:43,366 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2024-11-19 12:34:43,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-19 12:34:43,366 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2024-11-19 12:34:43,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 12:34:43,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:34:43,367 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-19 12:34:43,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 12:34:43,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 12:34:43,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:34:43,368 INFO L85 PathProgramCache]: Analyzing trace with hash 886385753, now seen corresponding path program 1 times [2024-11-19 12:34:43,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 12:34:43,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652470745] [2024-11-19 12:34:43,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:34:43,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 12:34:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:34:43,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 12:34:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:34:43,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 12:34:43,445 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 12:34:43,446 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-19 12:34:43,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-19 12:34:43,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-19 12:34:43,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-19 12:34:43,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 12:34:43,451 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-19 12:34:43,479 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 12:34:43,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:34:43 BoogieIcfgContainer [2024-11-19 12:34:43,484 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 12:34:43,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 12:34:43,485 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 12:34:43,485 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 12:34:43,486 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:34:42" (3/4) ... [2024-11-19 12:34:43,488 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 12:34:43,490 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 12:34:43,491 INFO L158 Benchmark]: Toolchain (without parser) took 2699.41ms. Allocated memory was 153.1MB in the beginning and 224.4MB in the end (delta: 71.3MB). Free memory was 94.9MB in the beginning and 138.7MB in the end (delta: -43.8MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2024-11-19 12:34:43,491 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 153.1MB. Free memory was 91.0MB in the beginning and 91.0MB in the end (delta: 36.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:34:43,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 987.17ms. Allocated memory was 153.1MB in the beginning and 224.4MB in the end (delta: 71.3MB). Free memory was 94.9MB in the beginning and 156.9MB in the end (delta: -62.0MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2024-11-19 12:34:43,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.33ms. Allocated memory is still 224.4MB. Free memory was 156.9MB in the beginning and 153.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 12:34:43,493 INFO L158 Benchmark]: Boogie Preprocessor took 56.05ms. Allocated memory is still 224.4MB. Free memory was 153.6MB in the beginning and 151.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 12:34:43,493 INFO L158 Benchmark]: RCFGBuilder took 344.67ms. Allocated memory is still 224.4MB. Free memory was 151.6MB in the beginning and 131.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 12:34:43,494 INFO L158 Benchmark]: TraceAbstraction took 1236.51ms. Allocated memory is still 224.4MB. Free memory was 130.7MB in the beginning and 138.7MB in the end (delta: -8.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:34:43,494 INFO L158 Benchmark]: Witness Printer took 4.84ms. Allocated memory is still 224.4MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:34:43,495 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.16ms. Allocated memory is still 153.1MB. Free memory was 91.0MB in the beginning and 91.0MB in the end (delta: 36.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 987.17ms. Allocated memory was 153.1MB in the beginning and 224.4MB in the end (delta: 71.3MB). Free memory was 94.9MB in the beginning and 156.9MB in the end (delta: -62.0MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.33ms. Allocated memory is still 224.4MB. Free memory was 156.9MB in the beginning and 153.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.05ms. Allocated memory is still 224.4MB. Free memory was 153.6MB in the beginning and 151.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 344.67ms. Allocated memory is still 224.4MB. Free memory was 151.6MB in the beginning and 131.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1236.51ms. Allocated memory is still 224.4MB. Free memory was 130.7MB in the beginning and 138.7MB in the end (delta: -8.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.84ms. Allocated memory is still 224.4MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1563]: 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 1585. 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] [L1585] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={2:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1585] 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] [L1586] CALL CWE190_Integer_Overflow__int_rand_postinc_12_bad() [L1550] int data; [L1551] data = 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] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] 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, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1560] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1560] RET globalReturnsTrueOrFalse() 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] [L1560] COND TRUE globalReturnsTrueOrFalse() [L1563] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: 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 4 procedures, 63 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 757 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 492 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56 IncrementalHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 265 mSDtfsCounter, 56 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 12/12 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-19 12:34:43,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_postinc_12_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 dc871371b7eb8945d46d164766cb79863f9bb5635a141197f34c58e079caf6b0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 12:34:45,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 12:34:45,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-19 12:34:45,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 12:34:45,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 12:34:45,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-19 12:34:45,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 12:34:45,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 12:34:45,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 12:34:45,584 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 12:34:45,584 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 12:34:45,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 12:34:45,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 12:34:45,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 12:34:45,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 12:34:45,586 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 12:34:45,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 12:34:45,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 12:34:45,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 12:34:45,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 12:34:45,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 12:34:45,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 12:34:45,588 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 12:34:45,591 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 12:34:45,591 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 12:34:45,592 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 12:34:45,592 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 12:34:45,592 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 12:34:45,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 12:34:45,593 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 12:34:45,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 12:34:45,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 12:34:45,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 12:34:45,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 12:34:45,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:34:45,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 12:34:45,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 12:34:45,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 12:34:45,595 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 12:34:45,596 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 12:34:45,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 12:34:45,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 12:34:45,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 12:34:45,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 12:34:45,600 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 -> dc871371b7eb8945d46d164766cb79863f9bb5635a141197f34c58e079caf6b0 [2024-11-19 12:34:45,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 12:34:45,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 12:34:45,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 12:34:45,878 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 12:34:45,879 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 12:34:45,880 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_12_bad.i [2024-11-19 12:34:47,315 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 12:34:47,628 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 12:34:47,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_12_bad.i [2024-11-19 12:34:47,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429ee7e04/8662bcf1d98c4066ad78b65e849f12d3/FLAG61f703ad6 [2024-11-19 12:34:47,888 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429ee7e04/8662bcf1d98c4066ad78b65e849f12d3 [2024-11-19 12:34:47,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 12:34:47,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 12:34:47,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 12:34:47,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 12:34:47,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 12:34:47,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:34:47" (1/1) ... [2024-11-19 12:34:47,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@208f0fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:47, skipping insertion in model container [2024-11-19 12:34:47,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:34:47" (1/1) ... [2024-11-19 12:34:47,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 12:34:48,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:34:48,618 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 12:34:48,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:34:48,810 INFO L204 MainTranslator]: Completed translation [2024-11-19 12:34:48,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:48 WrapperNode [2024-11-19 12:34:48,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 12:34:48,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 12:34:48,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 12:34:48,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 12:34:48,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:48" (1/1) ... [2024-11-19 12:34:48,844 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:48" (1/1) ... [2024-11-19 12:34:48,870 INFO L138 Inliner]: procedures = 502, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-11-19 12:34:48,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 12:34:48,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 12:34:48,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 12:34:48,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 12:34:48,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:48" (1/1) ... [2024-11-19 12:34:48,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:48" (1/1) ... [2024-11-19 12:34:48,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:48" (1/1) ... [2024-11-19 12:34:48,902 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 12:34:48,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:48" (1/1) ... [2024-11-19 12:34:48,902 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:48" (1/1) ... [2024-11-19 12:34:48,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:48" (1/1) ... [2024-11-19 12:34:48,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:48" (1/1) ... [2024-11-19 12:34:48,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:48" (1/1) ... [2024-11-19 12:34:48,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:48" (1/1) ... [2024-11-19 12:34:48,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 12:34:48,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 12:34:48,916 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 12:34:48,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 12:34:48,917 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:48" (1/1) ... [2024-11-19 12:34:48,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:34:48,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 12:34:48,960 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-19 12:34:48,963 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-19 12:34:48,999 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-19 12:34:48,999 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-19 12:34:48,999 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-19 12:34:49,000 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-19 12:34:49,000 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-19 12:34:49,000 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-19 12:34:49,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 12:34:49,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 12:34:49,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 12:34:49,146 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 12:34:49,148 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 12:34:49,294 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-19 12:34:49,295 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 12:34:49,308 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 12:34:49,309 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 12:34:49,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:34:49 BoogieIcfgContainer [2024-11-19 12:34:49,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 12:34:49,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 12:34:49,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 12:34:49,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 12:34:49,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:34:47" (1/3) ... [2024-11-19 12:34:49,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b6e887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:34:49, skipping insertion in model container [2024-11-19 12:34:49,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:48" (2/3) ... [2024-11-19 12:34:49,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b6e887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:34:49, skipping insertion in model container [2024-11-19 12:34:49,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:34:49" (3/3) ... [2024-11-19 12:34:49,318 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_12_bad.i [2024-11-19 12:34:49,330 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 12:34:49,330 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-19 12:34:49,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 12:34:49,393 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;@9959d27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 12:34:49,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-19 12:34:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 12:34:49,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 12:34:49,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:34:49,403 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:34:49,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 12:34:49,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:34:49,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1536608006, now seen corresponding path program 1 times [2024-11-19 12:34:49,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:34:49,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523150656] [2024-11-19 12:34:49,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:34:49,420 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-19 12:34:49,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:34:49,422 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-19 12:34:49,423 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-19 12:34:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:34:49,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 12:34:49,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 12:34:49,544 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-19 12:34:49,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 12:34:49,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 12:34:49,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523150656] [2024-11-19 12:34:49,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1523150656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:34:49,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:34:49,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 12:34:49,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923346522] [2024-11-19 12:34:49,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:34:49,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 12:34:49,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 12:34:49,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 12:34:49,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 12:34:49,575 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 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-19 12:34:49,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:34:49,591 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-11-19 12:34:49,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 12:34:49,592 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 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 19 [2024-11-19 12:34:49,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:34:49,598 INFO L225 Difference]: With dead ends: 41 [2024-11-19 12:34:49,598 INFO L226 Difference]: Without dead ends: 24 [2024-11-19 12:34:49,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 12:34:49,606 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:34:49,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:34:49,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-19 12:34:49,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-19 12:34:49,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-19 12:34:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-19 12:34:49,639 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 19 [2024-11-19 12:34:49,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:34:49,640 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-19 12:34:49,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 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-19 12:34:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-19 12:34:49,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 12:34:49,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:34:49,642 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-19 12:34:49,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 12:34:49,842 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-19 12:34:49,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 12:34:49,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:34:49,844 INFO L85 PathProgramCache]: Analyzing trace with hash 390207998, now seen corresponding path program 1 times [2024-11-19 12:34:49,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:34:49,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896491514] [2024-11-19 12:34:49,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:34:49,847 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-19 12:34:49,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:34:49,849 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-19 12:34:49,850 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-19 12:34:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:34:49,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 12:34:49,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 12:34:49,970 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-19 12:34:49,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 12:34:49,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 12:34:49,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896491514] [2024-11-19 12:34:49,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896491514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:34:49,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:34:49,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 12:34:49,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982953589] [2024-11-19 12:34:49,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:34:49,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 12:34:49,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 12:34:49,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 12:34:49,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:34:49,973 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-19 12:34:50,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:34:50,003 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-19 12:34:50,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 12:34:50,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 20 [2024-11-19 12:34:50,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:34:50,008 INFO L225 Difference]: With dead ends: 30 [2024-11-19 12:34:50,008 INFO L226 Difference]: Without dead ends: 27 [2024-11-19 12:34:50,008 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-19 12:34:50,009 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:34:50,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:34:50,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-19 12:34:50,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-19 12:34:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 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-19 12:34:50,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-19 12:34:50,018 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2024-11-19 12:34:50,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:34:50,019 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-19 12:34:50,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-19 12:34:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-19 12:34:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 12:34:50,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:34:50,024 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:34:50,032 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-19 12:34:50,224 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-19 12:34:50,225 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 12:34:50,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:34:50,226 INFO L85 PathProgramCache]: Analyzing trace with hash -788206615, now seen corresponding path program 1 times [2024-11-19 12:34:50,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:34:50,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535331888] [2024-11-19 12:34:50,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:34:50,227 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-19 12:34:50,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:34:50,234 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-19 12:34:50,250 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-19 12:34:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:34:50,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 12:34:50,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 12:34:50,326 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-19 12:34:50,326 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 12:34:50,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 12:34:50,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535331888] [2024-11-19 12:34:50,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535331888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:34:50,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:34:50,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 12:34:50,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422418524] [2024-11-19 12:34:50,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:34:50,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 12:34:50,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 12:34:50,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 12:34:50,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:34:50,329 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-19 12:34:50,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:34:50,347 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-19 12:34:50,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 12:34:50,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 21 [2024-11-19 12:34:50,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:34:50,349 INFO L225 Difference]: With dead ends: 30 [2024-11-19 12:34:50,349 INFO L226 Difference]: Without dead ends: 24 [2024-11-19 12:34:50,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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-19 12:34:50,351 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:34:50,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:34:50,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-19 12:34:50,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-19 12:34:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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-19 12:34:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-11-19 12:34:50,356 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2024-11-19 12:34:50,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:34:50,356 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-19 12:34:50,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-19 12:34:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-11-19 12:34:50,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 12:34:50,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:34:50,357 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-19 12:34:50,362 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-19 12:34:50,558 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-19 12:34:50,559 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 12:34:50,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:34:50,559 INFO L85 PathProgramCache]: Analyzing trace with hash -2030650941, now seen corresponding path program 1 times [2024-11-19 12:34:50,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:34:50,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517584578] [2024-11-19 12:34:50,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:34:50,560 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-19 12:34:50,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:34:50,563 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 12:34:50,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 12:34:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:34:50,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 12:34:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:34:50,666 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 12:34:50,666 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 12:34:50,667 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-19 12:34:50,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-19 12:34:50,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-19 12:34:50,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-19 12:34:50,677 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 (5)] Ended with exit code 0 [2024-11-19 12:34:50,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:34:50,872 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-19 12:34:50,899 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 12:34:50,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:34:50 BoogieIcfgContainer [2024-11-19 12:34:50,906 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 12:34:50,906 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 12:34:50,906 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 12:34:50,906 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 12:34:50,910 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:34:49" (3/4) ... [2024-11-19 12:34:50,912 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 12:34:50,913 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 12:34:50,914 INFO L158 Benchmark]: Toolchain (without parser) took 3022.94ms. Allocated memory is still 98.6MB. Free memory was 78.5MB in the beginning and 50.4MB in the end (delta: 28.1MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2024-11-19 12:34:50,918 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 67.1MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:34:50,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 918.11ms. Allocated memory is still 98.6MB. Free memory was 78.2MB in the beginning and 38.6MB in the end (delta: 39.5MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-19 12:34:50,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.86ms. Allocated memory is still 98.6MB. Free memory was 38.6MB in the beginning and 36.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 12:34:50,919 INFO L158 Benchmark]: Boogie Preprocessor took 44.73ms. Allocated memory is still 98.6MB. Free memory was 36.0MB in the beginning and 33.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 12:34:50,919 INFO L158 Benchmark]: RCFGBuilder took 393.44ms. Allocated memory is still 98.6MB. Free memory was 33.0MB in the beginning and 61.4MB in the end (delta: -28.4MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-11-19 12:34:50,919 INFO L158 Benchmark]: TraceAbstraction took 1594.93ms. Allocated memory is still 98.6MB. Free memory was 60.6MB in the beginning and 50.4MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-11-19 12:34:50,919 INFO L158 Benchmark]: Witness Printer took 7.08ms. Allocated memory is still 98.6MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:34:50,920 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.94ms. Allocated memory is still 67.1MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 918.11ms. Allocated memory is still 98.6MB. Free memory was 78.2MB in the beginning and 38.6MB in the end (delta: 39.5MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.86ms. Allocated memory is still 98.6MB. Free memory was 38.6MB in the beginning and 36.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.73ms. Allocated memory is still 98.6MB. Free memory was 36.0MB in the beginning and 33.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 393.44ms. Allocated memory is still 98.6MB. Free memory was 33.0MB in the beginning and 61.4MB in the end (delta: -28.4MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1594.93ms. Allocated memory is still 98.6MB. Free memory was 60.6MB in the beginning and 50.4MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Witness Printer took 7.08ms. Allocated memory is still 98.6MB. Free memory is still 50.4MB. 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: 1563]: 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 1585. 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] [L1585] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={2:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1585] 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] [L1586] CALL CWE190_Integer_Overflow__int_rand_postinc_12_bad() [L1550] int data; [L1551] data = 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] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] 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, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1560] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1560] RET globalReturnsTrueOrFalse() 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] [L1560] COND TRUE globalReturnsTrueOrFalse() [L1563] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: 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 4 procedures, 41 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, 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, 192 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 100 mSDtfsCounter, 23 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 75 SizeOfPredicates, 0 NumberOfNonLiveVariables, 174 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 9/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-19 12:34:50,963 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