./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8ea3a6c4c5d282a54dd1474f835d1a4f2cafe118865b5b50411e3ca4c801360b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 16:05:27,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 16:05:27,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 16:05:27,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 16:05:27,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 16:05:27,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 16:05:27,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 16:05:27,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 16:05:27,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 16:05:27,113 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 16:05:27,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 16:05:27,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 16:05:27,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 16:05:27,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 16:05:27,114 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 16:05:27,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 16:05:27,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 16:05:27,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 16:05:27,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 16:05:27,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 16:05:27,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 16:05:27,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 16:05:27,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 16:05:27,123 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 16:05:27,123 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 16:05:27,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 16:05:27,123 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 16:05:27,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 16:05:27,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 16:05:27,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 16:05:27,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 16:05:27,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 16:05:27,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 16:05:27,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 16:05:27,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 16:05:27,126 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 16:05:27,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 16:05:27,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 16:05:27,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 16:05:27,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 16:05:27,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 16:05:27,127 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 -> 8ea3a6c4c5d282a54dd1474f835d1a4f2cafe118865b5b50411e3ca4c801360b [2024-10-13 16:05:27,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 16:05:27,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 16:05:27,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 16:05:27,391 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 16:05:27,392 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 16:05:27,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_bad.i [2024-10-13 16:05:28,627 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 16:05:28,881 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 16:05:28,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_bad.i [2024-10-13 16:05:28,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4651d179/27dedae0e78544a28c55e59a6c53ec13/FLAGb1845ac22 [2024-10-13 16:05:28,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4651d179/27dedae0e78544a28c55e59a6c53ec13 [2024-10-13 16:05:28,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 16:05:28,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 16:05:28,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 16:05:28,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 16:05:28,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 16:05:28,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:05:28" (1/1) ... [2024-10-13 16:05:28,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@290c8c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:28, skipping insertion in model container [2024-10-13 16:05:28,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:05:28" (1/1) ... [2024-10-13 16:05:28,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 16:05:29,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:05:29,689 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 16:05:29,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:05:29,850 INFO L204 MainTranslator]: Completed translation [2024-10-13 16:05:29,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:29 WrapperNode [2024-10-13 16:05:29,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 16:05:29,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 16:05:29,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 16:05:29,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 16:05:29,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:29" (1/1) ... [2024-10-13 16:05:29,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:29" (1/1) ... [2024-10-13 16:05:29,905 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 121 [2024-10-13 16:05:29,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 16:05:29,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 16:05:29,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 16:05:29,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 16:05:29,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:29" (1/1) ... [2024-10-13 16:05:29,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:29" (1/1) ... [2024-10-13 16:05:29,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:29" (1/1) ... [2024-10-13 16:05:29,934 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 16:05:29,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:29" (1/1) ... [2024-10-13 16:05:29,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:29" (1/1) ... [2024-10-13 16:05:29,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:29" (1/1) ... [2024-10-13 16:05:29,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:29" (1/1) ... [2024-10-13 16:05:29,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:29" (1/1) ... [2024-10-13 16:05:29,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:29" (1/1) ... [2024-10-13 16:05:29,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 16:05:29,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 16:05:29,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 16:05:29,947 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 16:05:29,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:29" (1/1) ... [2024-10-13 16:05:29,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 16:05:29,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:05:29,978 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-10-13 16:05:29,987 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-10-13 16:05:30,053 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 16:05:30,053 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 16:05:30,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 16:05:30,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 16:05:30,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 16:05:30,195 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 16:05:30,196 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 16:05:30,372 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-10-13 16:05:30,372 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 16:05:30,392 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 16:05:30,392 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 16:05:30,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:05:30 BoogieIcfgContainer [2024-10-13 16:05:30,393 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 16:05:30,394 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 16:05:30,394 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 16:05:30,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 16:05:30,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:05:28" (1/3) ... [2024-10-13 16:05:30,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd25ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:05:30, skipping insertion in model container [2024-10-13 16:05:30,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:29" (2/3) ... [2024-10-13 16:05:30,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd25ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:05:30, skipping insertion in model container [2024-10-13 16:05:30,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:05:30" (3/3) ... [2024-10-13 16:05:30,399 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_predec_17_bad.i [2024-10-13 16:05:30,411 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 16:05:30,412 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-13 16:05:30,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 16:05:30,473 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;@10884f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 16:05:30,474 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-13 16:05:30,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 38 states have (on average 1.631578947368421) internal successors, (62), 44 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 16:05:30,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 16:05:30,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:30,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:30,483 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 16:05:30,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:30,487 INFO L85 PathProgramCache]: Analyzing trace with hash -999472409, now seen corresponding path program 1 times [2024-10-13 16:05:30,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:30,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189259447] [2024-10-13 16:05:30,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:30,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:30,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:30,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:05:30,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:30,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189259447] [2024-10-13 16:05:30,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189259447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:30,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:30,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:05:30,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564134643] [2024-10-13 16:05:30,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:30,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:05:30,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:30,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:05:30,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:30,737 INFO L87 Difference]: Start difference. First operand has 48 states, 38 states have (on average 1.631578947368421) internal successors, (62), 44 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:30,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:30,777 INFO L93 Difference]: Finished difference Result 89 states and 124 transitions. [2024-10-13 16:05:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:05:30,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-13 16:05:30,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:30,789 INFO L225 Difference]: With dead ends: 89 [2024-10-13 16:05:30,789 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 16:05:30,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:30,795 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 35 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:30,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 114 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:30,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 16:05:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2024-10-13 16:05:30,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 42 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:30,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2024-10-13 16:05:30,830 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 11 [2024-10-13 16:05:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:30,831 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2024-10-13 16:05:30,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:30,831 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2024-10-13 16:05:30,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 16:05:30,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:30,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:30,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 16:05:30,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 16:05:30,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:30,833 INFO L85 PathProgramCache]: Analyzing trace with hash -542324962, now seen corresponding path program 1 times [2024-10-13 16:05:30,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:30,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552986920] [2024-10-13 16:05:30,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:30,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:30,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:30,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:05:30,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:30,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552986920] [2024-10-13 16:05:30,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552986920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:30,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:30,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:05:30,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455405604] [2024-10-13 16:05:30,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:30,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 16:05:30,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:30,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:05:30,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:05:30,984 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:31,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:31,022 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2024-10-13 16:05:31,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:05:31,022 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-13 16:05:31,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:31,024 INFO L225 Difference]: With dead ends: 71 [2024-10-13 16:05:31,025 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 16:05:31,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:05:31,026 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 30 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:31,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 154 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 16:05:31,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-13 16:05:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 66 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:31,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2024-10-13 16:05:31,036 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 15 [2024-10-13 16:05:31,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:31,036 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2024-10-13 16:05:31,037 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:31,037 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2024-10-13 16:05:31,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 16:05:31,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:31,037 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:31,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 16:05:31,038 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 16:05:31,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:31,039 INFO L85 PathProgramCache]: Analyzing trace with hash -621850970, now seen corresponding path program 1 times [2024-10-13 16:05:31,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:31,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765107952] [2024-10-13 16:05:31,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:31,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:05:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:31,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:05:31,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:05:31,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765107952] [2024-10-13 16:05:31,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765107952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:31,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:31,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 16:05:31,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812346473] [2024-10-13 16:05:31,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:31,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 16:05:31,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:05:31,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 16:05:31,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 16:05:31,193 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:31,345 INFO L93 Difference]: Finished difference Result 109 states and 152 transitions. [2024-10-13 16:05:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 16:05:31,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-13 16:05:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:31,347 INFO L225 Difference]: With dead ends: 109 [2024-10-13 16:05:31,347 INFO L226 Difference]: Without dead ends: 108 [2024-10-13 16:05:31,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 16:05:31,348 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 45 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:31,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 227 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 16:05:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-13 16:05:31,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 81. [2024-10-13 16:05:31,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.5068493150684932) internal successors, (110), 78 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2024-10-13 16:05:31,355 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 20 [2024-10-13 16:05:31,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:31,355 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2024-10-13 16:05:31,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2024-10-13 16:05:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 16:05:31,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:31,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:31,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 16:05:31,360 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 16:05:31,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:31,360 INFO L85 PathProgramCache]: Analyzing trace with hash -910405312, now seen corresponding path program 1 times [2024-10-13 16:05:31,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:05:31,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805766028] [2024-10-13 16:05:31,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:31,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:05:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:05:31,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:05:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:05:31,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:05:31,417 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 16:05:31,418 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-13 16:05:31,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-13 16:05:31,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-13 16:05:31,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-13 16:05:31,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-13 16:05:31,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-13 16:05:31,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 16:05:31,424 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 16:05:31,453 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 16:05:31,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:05:31 BoogieIcfgContainer [2024-10-13 16:05:31,459 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 16:05:31,459 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 16:05:31,460 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 16:05:31,460 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 16:05:31,460 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:05:30" (3/4) ... [2024-10-13 16:05:31,462 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 16:05:31,463 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 16:05:31,463 INFO L158 Benchmark]: Toolchain (without parser) took 2538.87ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 117.9MB in the end (delta: 11.5MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-10-13 16:05:31,463 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 104.9MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:05:31,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 925.01ms. Allocated memory is still 167.8MB. Free memory was 128.3MB in the beginning and 63.3MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-10-13 16:05:31,465 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.95ms. Allocated memory is still 167.8MB. Free memory was 63.3MB in the beginning and 60.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:05:31,465 INFO L158 Benchmark]: Boogie Preprocessor took 39.49ms. Allocated memory is still 167.8MB. Free memory was 60.2MB in the beginning and 58.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:05:31,466 INFO L158 Benchmark]: RCFGBuilder took 446.39ms. Allocated memory is still 167.8MB. Free memory was 58.1MB in the beginning and 120.1MB in the end (delta: -62.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 16:05:31,467 INFO L158 Benchmark]: TraceAbstraction took 1064.77ms. Allocated memory is still 167.8MB. Free memory was 119.1MB in the beginning and 117.9MB in the end (delta: 1.2MB). Peak memory consumption was 189.3kB. Max. memory is 16.1GB. [2024-10-13 16:05:31,467 INFO L158 Benchmark]: Witness Printer took 3.37ms. Allocated memory is still 167.8MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:05:31,468 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 104.9MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 925.01ms. Allocated memory is still 167.8MB. Free memory was 128.3MB in the beginning and 63.3MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.95ms. Allocated memory is still 167.8MB. Free memory was 63.3MB in the beginning and 60.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.49ms. Allocated memory is still 167.8MB. Free memory was 60.2MB in the beginning and 58.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 446.39ms. Allocated memory is still 167.8MB. Free memory was 58.1MB in the beginning and 120.1MB in the end (delta: -62.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1064.77ms. Allocated memory is still 167.8MB. Free memory was 119.1MB in the beginning and 117.9MB in the end (delta: 1.2MB). Peak memory consumption was 189.3kB. Max. memory is 16.1GB. * Witness Printer took 3.37ms. Allocated memory is still 167.8MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE191_Integer_Underflow__int_rand_predec_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1557] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1557] COND TRUE j < 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1560] --data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 495 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 336 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 159 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=3, 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 49 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 91 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1/1 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-10-13 16:05:31,501 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8ea3a6c4c5d282a54dd1474f835d1a4f2cafe118865b5b50411e3ca4c801360b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 16:05:33,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 16:05:33,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-13 16:05:33,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 16:05:33,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 16:05:33,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-13 16:05:33,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 16:05:33,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 16:05:33,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 16:05:33,458 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 16:05:33,458 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 16:05:33,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 16:05:33,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 16:05:33,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 16:05:33,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 16:05:33,459 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 16:05:33,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 16:05:33,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 16:05:33,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 16:05:33,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 16:05:33,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 16:05:33,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 16:05:33,464 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 16:05:33,464 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 16:05:33,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 16:05:33,465 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 16:05:33,465 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 16:05:33,465 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 16:05:33,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 16:05:33,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 16:05:33,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 16:05:33,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 16:05:33,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 16:05:33,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 16:05:33,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 16:05:33,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 16:05:33,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 16:05:33,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 16:05:33,468 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 16:05:33,468 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 16:05:33,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 16:05:33,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 16:05:33,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 16:05:33,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 16:05:33,469 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 16:05:33,469 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 -> 8ea3a6c4c5d282a54dd1474f835d1a4f2cafe118865b5b50411e3ca4c801360b [2024-10-13 16:05:33,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 16:05:33,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 16:05:33,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 16:05:33,763 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 16:05:33,764 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 16:05:33,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_bad.i [2024-10-13 16:05:35,047 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 16:05:35,317 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 16:05:35,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_bad.i [2024-10-13 16:05:35,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1148fb204/2218d8c047af40769194793717b7becb/FLAG75b928c9c [2024-10-13 16:05:35,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1148fb204/2218d8c047af40769194793717b7becb [2024-10-13 16:05:35,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 16:05:35,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 16:05:35,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 16:05:35,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 16:05:35,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 16:05:35,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:05:35" (1/1) ... [2024-10-13 16:05:35,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@818627d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:35, skipping insertion in model container [2024-10-13 16:05:35,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:05:35" (1/1) ... [2024-10-13 16:05:35,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 16:05:36,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:05:36,176 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 16:05:36,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:05:36,339 INFO L204 MainTranslator]: Completed translation [2024-10-13 16:05:36,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:36 WrapperNode [2024-10-13 16:05:36,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 16:05:36,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 16:05:36,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 16:05:36,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 16:05:36,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:36" (1/1) ... [2024-10-13 16:05:36,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:36" (1/1) ... [2024-10-13 16:05:36,385 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2024-10-13 16:05:36,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 16:05:36,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 16:05:36,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 16:05:36,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 16:05:36,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:36" (1/1) ... [2024-10-13 16:05:36,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:36" (1/1) ... [2024-10-13 16:05:36,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:36" (1/1) ... [2024-10-13 16:05:36,406 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 16:05:36,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:36" (1/1) ... [2024-10-13 16:05:36,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:36" (1/1) ... [2024-10-13 16:05:36,413 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:36" (1/1) ... [2024-10-13 16:05:36,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:36" (1/1) ... [2024-10-13 16:05:36,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:36" (1/1) ... [2024-10-13 16:05:36,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:36" (1/1) ... [2024-10-13 16:05:36,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 16:05:36,425 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 16:05:36,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 16:05:36,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 16:05:36,426 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:36" (1/1) ... [2024-10-13 16:05:36,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 16:05:36,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:05:36,450 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-10-13 16:05:36,452 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-10-13 16:05:36,482 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 16:05:36,482 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 16:05:36,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 16:05:36,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 16:05:36,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 16:05:36,601 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 16:05:36,603 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 16:05:36,757 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-13 16:05:36,758 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 16:05:36,794 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 16:05:36,794 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 16:05:36,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:05:36 BoogieIcfgContainer [2024-10-13 16:05:36,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 16:05:36,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 16:05:36,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 16:05:36,801 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 16:05:36,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:05:35" (1/3) ... [2024-10-13 16:05:36,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1816493d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:05:36, skipping insertion in model container [2024-10-13 16:05:36,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:36" (2/3) ... [2024-10-13 16:05:36,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1816493d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:05:36, skipping insertion in model container [2024-10-13 16:05:36,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:05:36" (3/3) ... [2024-10-13 16:05:36,805 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_predec_17_bad.i [2024-10-13 16:05:36,820 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 16:05:36,821 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-13 16:05:36,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 16:05:36,895 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;@7a3309da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 16:05:36,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-13 16:05:36,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 16:05:36,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 16:05:36,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:36,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:36,907 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 16:05:36,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:36,912 INFO L85 PathProgramCache]: Analyzing trace with hash -169406556, now seen corresponding path program 1 times [2024-10-13 16:05:36,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 16:05:36,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766143] [2024-10-13 16:05:36,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:36,925 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-10-13 16:05:36,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 16:05:36,928 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-10-13 16:05:36,929 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-10-13 16:05:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:37,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:05:37,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:05:37,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:05:37,046 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 16:05:37,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 16:05:37,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766143] [2024-10-13 16:05:37,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:37,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:37,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:05:37,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106228875] [2024-10-13 16:05:37,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:37,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:05:37,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 16:05:37,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:05:37,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:37,070 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:37,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:37,110 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2024-10-13 16:05:37,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:05:37,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-13 16:05:37,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:37,117 INFO L225 Difference]: With dead ends: 47 [2024-10-13 16:05:37,117 INFO L226 Difference]: Without dead ends: 24 [2024-10-13 16:05:37,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:05:37,124 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:37,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 44 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-13 16:05:37,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-10-13 16:05:37,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-10-13 16:05:37,153 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 11 [2024-10-13 16:05:37,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:37,154 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-10-13 16:05:37,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-10-13 16:05:37,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 16:05:37,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:37,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:37,160 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-10-13 16:05:37,358 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-10-13 16:05:37,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 16:05:37,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:37,360 INFO L85 PathProgramCache]: Analyzing trace with hash -955177575, now seen corresponding path program 1 times [2024-10-13 16:05:37,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 16:05:37,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911693476] [2024-10-13 16:05:37,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:37,360 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-10-13 16:05:37,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 16:05:37,363 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-10-13 16:05:37,364 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-10-13 16:05:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:05:37,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 16:05:37,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:05:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:05:37,472 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 16:05:37,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 16:05:37,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911693476] [2024-10-13 16:05:37,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911693476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:05:37,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:05:37,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:05:37,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800736732] [2024-10-13 16:05:37,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:05:37,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 16:05:37,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 16:05:37,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:05:37,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:05:37,476 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:37,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:05:37,499 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-10-13 16:05:37,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:05:37,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-13 16:05:37,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:05:37,500 INFO L225 Difference]: With dead ends: 27 [2024-10-13 16:05:37,500 INFO L226 Difference]: Without dead ends: 26 [2024-10-13 16:05:37,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:05:37,501 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:05:37,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 50 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:05:37,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-13 16:05:37,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-13 16:05:37,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 23 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-10-13 16:05:37,505 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 12 [2024-10-13 16:05:37,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:05:37,505 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-10-13 16:05:37,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 16:05:37,505 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-10-13 16:05:37,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 16:05:37,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:05:37,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:05:37,514 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-10-13 16:05:37,709 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-10-13 16:05:37,710 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 16:05:37,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:05:37,711 INFO L85 PathProgramCache]: Analyzing trace with hash -394688562, now seen corresponding path program 1 times [2024-10-13 16:05:37,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 16:05:37,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162178326] [2024-10-13 16:05:37,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:05:37,711 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-10-13 16:05:37,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 16:05:37,720 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-10-13 16:05:37,721 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-10-13 16:05:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:05:37,774 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:05:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:05:37,864 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 16:05:37,868 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 16:05:37,869 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-13 16:05:37,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-13 16:05:37,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-13 16:05:37,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-13 16:05:37,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-13 16:05:37,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-13 16:05:37,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 16:05:38,076 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-10-13 16:05:38,081 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 16:05:38,106 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 16:05:38,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:05:38 BoogieIcfgContainer [2024-10-13 16:05:38,108 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 16:05:38,109 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 16:05:38,109 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 16:05:38,109 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 16:05:38,109 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:05:36" (3/4) ... [2024-10-13 16:05:38,111 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 16:05:38,112 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 16:05:38,113 INFO L158 Benchmark]: Toolchain (without parser) took 2748.98ms. Allocated memory was 71.3MB in the beginning and 119.5MB in the end (delta: 48.2MB). Free memory was 47.1MB in the beginning and 85.8MB in the end (delta: -38.7MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-10-13 16:05:38,113 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 46.1MB. Free memory was 24.8MB in the beginning and 24.8MB in the end (delta: 60.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:05:38,113 INFO L158 Benchmark]: CACSL2BoogieTranslator took 975.35ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 46.9MB in the beginning and 63.1MB in the end (delta: -16.2MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2024-10-13 16:05:38,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.12ms. Allocated memory is still 92.3MB. Free memory was 63.1MB in the beginning and 60.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 16:05:38,114 INFO L158 Benchmark]: Boogie Preprocessor took 35.22ms. Allocated memory is still 92.3MB. Free memory was 60.0MB in the beginning and 56.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:05:38,114 INFO L158 Benchmark]: RCFGBuilder took 369.09ms. Allocated memory is still 92.3MB. Free memory was 56.9MB in the beginning and 39.5MB in the end (delta: 17.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 16:05:38,115 INFO L158 Benchmark]: TraceAbstraction took 1312.10ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 39.0MB in the beginning and 85.8MB in the end (delta: -46.8MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-10-13 16:05:38,115 INFO L158 Benchmark]: Witness Printer took 3.37ms. Allocated memory is still 119.5MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:05:38,118 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 46.1MB. Free memory was 24.8MB in the beginning and 24.8MB in the end (delta: 60.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 975.35ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 46.9MB in the beginning and 63.1MB in the end (delta: -16.2MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.12ms. Allocated memory is still 92.3MB. Free memory was 63.1MB in the beginning and 60.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.22ms. Allocated memory is still 92.3MB. Free memory was 60.0MB in the beginning and 56.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 369.09ms. Allocated memory is still 92.3MB. Free memory was 56.9MB in the beginning and 39.5MB in the end (delta: 17.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1312.10ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 39.0MB in the beginning and 85.8MB in the end (delta: -46.8MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Witness Printer took 3.37ms. Allocated memory is still 119.5MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE191_Integer_Underflow__int_rand_predec_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1557] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1557] COND TRUE j < 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1560] --data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 42 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 33 SizeOfPredicates, 0 NumberOfNonLiveVariables, 81 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 16:05:38,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample