./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_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 a7bf12efb165ae38e6a5b7ea360f1f04cc4b40bbbbde4906a6f5fa41669f98f5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 05:48:03,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 05:48:03,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-17 05:48:03,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 05:48:03,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 05:48:03,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 05:48:03,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 05:48:03,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 05:48:03,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 05:48:03,573 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 05:48:03,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 05:48:03,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 05:48:03,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 05:48:03,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 05:48:03,577 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 05:48:03,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 05:48:03,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 05:48:03,577 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 05:48:03,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 05:48:03,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 05:48:03,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 05:48:03,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 05:48:03,580 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 05:48:03,581 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 05:48:03,581 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 05:48:03,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 05:48:03,581 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 05:48:03,582 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 05:48:03,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 05:48:03,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 05:48:03,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 05:48:03,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 05:48:03,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 05:48:03,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 05:48:03,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 05:48:03,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 05:48:03,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 05:48:03,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 05:48:03,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 05:48:03,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 05:48:03,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 05:48:03,585 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 -> a7bf12efb165ae38e6a5b7ea360f1f04cc4b40bbbbde4906a6f5fa41669f98f5 [2024-11-17 05:48:03,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 05:48:03,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 05:48:03,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 05:48:03,814 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 05:48:03,817 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 05:48:03,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2024-11-17 05:48:05,036 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 05:48:05,319 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 05:48:05,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2024-11-17 05:48:05,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/869b25b98/44b2daafa8794008a19649aeb63bab1d/FLAG48293ab0e [2024-11-17 05:48:05,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/869b25b98/44b2daafa8794008a19649aeb63bab1d [2024-11-17 05:48:05,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 05:48:05,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 05:48:05,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 05:48:05,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 05:48:05,365 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 05:48:05,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:48:05" (1/1) ... [2024-11-17 05:48:05,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ac7493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:05, skipping insertion in model container [2024-11-17 05:48:05,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:48:05" (1/1) ... [2024-11-17 05:48:05,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 05:48:06,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 05:48:06,014 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 05:48:06,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 05:48:06,175 INFO L204 MainTranslator]: Completed translation [2024-11-17 05:48:06,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:06 WrapperNode [2024-11-17 05:48:06,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 05:48:06,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 05:48:06,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 05:48:06,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 05:48:06,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:06" (1/1) ... [2024-11-17 05:48:06,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:06" (1/1) ... [2024-11-17 05:48:06,226 INFO L138 Inliner]: procedures = 498, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2024-11-17 05:48:06,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 05:48:06,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 05:48:06,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 05:48:06,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 05:48:06,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:06" (1/1) ... [2024-11-17 05:48:06,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:06" (1/1) ... [2024-11-17 05:48:06,241 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:06" (1/1) ... [2024-11-17 05:48:06,259 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2024-11-17 05:48:06,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:06" (1/1) ... [2024-11-17 05:48:06,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:06" (1/1) ... [2024-11-17 05:48:06,266 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:06" (1/1) ... [2024-11-17 05:48:06,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:06" (1/1) ... [2024-11-17 05:48:06,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:06" (1/1) ... [2024-11-17 05:48:06,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:06" (1/1) ... [2024-11-17 05:48:06,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 05:48:06,278 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 05:48:06,278 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 05:48:06,278 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 05:48:06,279 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:06" (1/1) ... [2024-11-17 05:48:06,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 05:48:06,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 05:48:06,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 05:48:06,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 05:48:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 05:48:06,349 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 05:48:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 05:48:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 05:48:06,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 05:48:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 05:48:06,482 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 05:48:06,484 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 05:48:06,580 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-17 05:48:06,580 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 05:48:06,589 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 05:48:06,590 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 05:48:06,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:48:06 BoogieIcfgContainer [2024-11-17 05:48:06,590 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 05:48:06,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 05:48:06,592 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 05:48:06,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 05:48:06,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 05:48:05" (1/3) ... [2024-11-17 05:48:06,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52699724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:48:06, skipping insertion in model container [2024-11-17 05:48:06,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:06" (2/3) ... [2024-11-17 05:48:06,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52699724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:48:06, skipping insertion in model container [2024-11-17 05:48:06,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:48:06" (3/3) ... [2024-11-17 05:48:06,599 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2024-11-17 05:48:06,611 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 05:48:06,612 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-17 05:48:06,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 05:48:06,660 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;@4dfdce4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 05:48:06,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-17 05:48:06,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 05:48:06,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 05:48:06,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:48:06,670 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:48:06,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 05:48:06,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:48:06,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1246963686, now seen corresponding path program 1 times [2024-11-17 05:48:06,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:48:06,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366722380] [2024-11-17 05:48:06,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:48:06,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:48:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:48:06,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 05:48:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:48:07,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 05:48:07,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 05:48:07,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366722380] [2024-11-17 05:48:07,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366722380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:48:07,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 05:48:07,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 05:48:07,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207527882] [2024-11-17 05:48:07,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:48:07,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 05:48:07,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 05:48:07,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 05:48:07,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 05:48:07,046 INFO L87 Difference]: Start difference. First operand has 39 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:48:07,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:48:07,087 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2024-11-17 05:48:07,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 05:48:07,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 13 [2024-11-17 05:48:07,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:48:07,095 INFO L225 Difference]: With dead ends: 74 [2024-11-17 05:48:07,095 INFO L226 Difference]: Without dead ends: 42 [2024-11-17 05:48:07,097 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-11-17 05:48:07,101 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 05:48:07,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 110 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:48:07,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-17 05:48:07,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-17 05:48:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 05:48:07,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-17 05:48:07,128 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 13 [2024-11-17 05:48:07,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:48:07,129 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-17 05:48:07,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:48:07,129 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-17 05:48:07,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 05:48:07,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:48:07,130 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:48:07,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 05:48:07,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 05:48:07,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:48:07,131 INFO L85 PathProgramCache]: Analyzing trace with hash -314355703, now seen corresponding path program 1 times [2024-11-17 05:48:07,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:48:07,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529901797] [2024-11-17 05:48:07,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:48:07,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:48:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:48:07,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 05:48:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:48:07,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 05:48:07,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 05:48:07,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529901797] [2024-11-17 05:48:07,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529901797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 05:48:07,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412008551] [2024-11-17 05:48:07,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:48:07,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 05:48:07,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 05:48:07,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 05:48:07,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 05:48:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:48:07,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 05:48:07,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 05:48:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 05:48:07,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 05:48:07,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412008551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:48:07,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 05:48:07,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-17 05:48:07,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189232404] [2024-11-17 05:48:07,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:48:07,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 05:48:07,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 05:48:07,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 05:48:07,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-17 05:48:07,437 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-11-17 05:48:07,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:48:07,460 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2024-11-17 05:48:07,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 05:48:07,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-11-17 05:48:07,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:48:07,462 INFO L225 Difference]: With dead ends: 62 [2024-11-17 05:48:07,462 INFO L226 Difference]: Without dead ends: 33 [2024-11-17 05:48:07,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-17 05:48:07,464 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 05:48:07,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 86 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:48:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-17 05:48:07,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-17 05:48:07,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 05:48:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-17 05:48:07,469 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 20 [2024-11-17 05:48:07,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:48:07,469 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-17 05:48:07,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-11-17 05:48:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-17 05:48:07,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 05:48:07,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:48:07,471 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:48:07,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 05:48:07,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 05:48:07,676 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 05:48:07,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:48:07,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1157155697, now seen corresponding path program 1 times [2024-11-17 05:48:07,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:48:07,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246911698] [2024-11-17 05:48:07,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:48:07,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:48:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:48:07,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 05:48:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:48:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 05:48:07,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 05:48:07,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246911698] [2024-11-17 05:48:07,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246911698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:48:07,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 05:48:07,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 05:48:07,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662637315] [2024-11-17 05:48:07,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:48:07,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 05:48:07,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 05:48:07,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 05:48:07,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 05:48:07,746 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:48:07,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:48:07,764 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-11-17 05:48:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 05:48:07,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 21 [2024-11-17 05:48:07,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:48:07,766 INFO L225 Difference]: With dead ends: 33 [2024-11-17 05:48:07,766 INFO L226 Difference]: Without dead ends: 32 [2024-11-17 05:48:07,766 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-11-17 05:48:07,768 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 05:48:07,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 66 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:48:07,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-17 05:48:07,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-17 05:48:07,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 05:48:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-17 05:48:07,777 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 21 [2024-11-17 05:48:07,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:48:07,778 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-17 05:48:07,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:48:07,778 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-17 05:48:07,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 05:48:07,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:48:07,779 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:48:07,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 05:48:07,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 05:48:07,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:48:07,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1512088253, now seen corresponding path program 1 times [2024-11-17 05:48:07,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:48:07,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888033793] [2024-11-17 05:48:07,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:48:07,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:48:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 05:48:07,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 05:48:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 05:48:07,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 05:48:07,825 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 05:48:07,826 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-17 05:48:07,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-17 05:48:07,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-17 05:48:07,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-17 05:48:07,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-17 05:48:07,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-17 05:48:07,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 05:48:07,834 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-17 05:48:07,856 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 05:48:07,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 05:48:07 BoogieIcfgContainer [2024-11-17 05:48:07,858 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 05:48:07,859 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 05:48:07,859 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 05:48:07,859 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 05:48:07,859 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:48:06" (3/4) ... [2024-11-17 05:48:07,861 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 05:48:07,862 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 05:48:07,863 INFO L158 Benchmark]: Toolchain (without parser) took 2504.52ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 82.7MB in the beginning and 120.1MB in the end (delta: -37.3MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2024-11-17 05:48:07,865 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 108.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 05:48:07,865 INFO L158 Benchmark]: CACSL2BoogieTranslator took 815.09ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 82.4MB in the beginning and 156.0MB in the end (delta: -73.6MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-11-17 05:48:07,865 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.81ms. Allocated memory is still 237.0MB. Free memory was 156.0MB in the beginning and 153.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 05:48:07,866 INFO L158 Benchmark]: Boogie Preprocessor took 49.75ms. Allocated memory is still 237.0MB. Free memory was 153.9MB in the beginning and 151.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 05:48:07,866 INFO L158 Benchmark]: IcfgBuilder took 312.42ms. Allocated memory is still 237.0MB. Free memory was 150.8MB in the beginning and 135.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 05:48:07,867 INFO L158 Benchmark]: TraceAbstraction took 1266.96ms. Allocated memory is still 237.0MB. Free memory was 135.0MB in the beginning and 121.1MB in the end (delta: 13.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-17 05:48:07,867 INFO L158 Benchmark]: Witness Printer took 3.29ms. Allocated memory is still 237.0MB. Free memory was 121.1MB in the beginning and 120.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 05:48:07,868 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 108.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 815.09ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 82.4MB in the beginning and 156.0MB in the end (delta: -73.6MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.81ms. Allocated memory is still 237.0MB. Free memory was 156.0MB in the beginning and 153.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.75ms. Allocated memory is still 237.0MB. Free memory was 153.9MB in the beginning and 151.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 312.42ms. Allocated memory is still 237.0MB. Free memory was 150.8MB in the beginning and 135.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1266.96ms. Allocated memory is still 237.0MB. Free memory was 135.0MB in the beginning and 121.1MB in the end (delta: 13.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Witness Printer took 3.29ms. Allocated memory is still 237.0MB. Free memory was 121.1MB in the beginning and 120.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of large string literal at line 1579, overapproximation of fgets at line 1557. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1579] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1579] 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] [L1580] CALL CWE190_Integer_Overflow__int_fgets_postinc_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 [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; 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] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1567] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1567] COND TRUE j < 1 [L1570] 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: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1570]: 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: 1553]: 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, 39 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 262 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 164 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 98 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=1, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 153 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 10/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-17 05:48:07,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_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 a7bf12efb165ae38e6a5b7ea360f1f04cc4b40bbbbde4906a6f5fa41669f98f5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 05:48:09,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 05:48:09,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-17 05:48:09,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 05:48:09,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 05:48:09,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-17 05:48:09,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 05:48:09,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 05:48:09,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 05:48:09,731 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 05:48:09,731 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 05:48:09,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 05:48:09,732 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 05:48:09,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 05:48:09,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 05:48:09,733 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 05:48:09,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 05:48:09,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 05:48:09,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 05:48:09,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 05:48:09,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 05:48:09,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 05:48:09,735 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 05:48:09,735 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 05:48:09,735 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 05:48:09,736 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 05:48:09,736 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 05:48:09,736 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 05:48:09,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 05:48:09,737 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 05:48:09,737 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 05:48:09,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 05:48:09,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 05:48:09,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 05:48:09,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 05:48:09,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 05:48:09,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 05:48:09,742 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 05:48:09,743 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 05:48:09,743 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 05:48:09,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 05:48:09,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 05:48:09,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 05:48:09,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 05:48:09,744 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 -> a7bf12efb165ae38e6a5b7ea360f1f04cc4b40bbbbde4906a6f5fa41669f98f5 [2024-11-17 05:48:10,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 05:48:10,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 05:48:10,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 05:48:10,034 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 05:48:10,038 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 05:48:10,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2024-11-17 05:48:11,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 05:48:11,549 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 05:48:11,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2024-11-17 05:48:11,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f29449c1/b79ea97d44a341a88aef7c7a7c2feed4/FLAG4288e20f1 [2024-11-17 05:48:11,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f29449c1/b79ea97d44a341a88aef7c7a7c2feed4 [2024-11-17 05:48:11,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 05:48:11,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 05:48:11,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 05:48:11,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 05:48:11,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 05:48:11,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:48:11" (1/1) ... [2024-11-17 05:48:11,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64db45a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:11, skipping insertion in model container [2024-11-17 05:48:11,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:48:11" (1/1) ... [2024-11-17 05:48:11,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 05:48:12,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 05:48:12,223 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 05:48:12,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 05:48:12,381 INFO L204 MainTranslator]: Completed translation [2024-11-17 05:48:12,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:12 WrapperNode [2024-11-17 05:48:12,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 05:48:12,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 05:48:12,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 05:48:12,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 05:48:12,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:12" (1/1) ... [2024-11-17 05:48:12,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:12" (1/1) ... [2024-11-17 05:48:12,423 INFO L138 Inliner]: procedures = 503, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 86 [2024-11-17 05:48:12,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 05:48:12,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 05:48:12,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 05:48:12,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 05:48:12,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:12" (1/1) ... [2024-11-17 05:48:12,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:12" (1/1) ... [2024-11-17 05:48:12,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:12" (1/1) ... [2024-11-17 05:48:12,447 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2024-11-17 05:48:12,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:12" (1/1) ... [2024-11-17 05:48:12,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:12" (1/1) ... [2024-11-17 05:48:12,453 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:12" (1/1) ... [2024-11-17 05:48:12,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:12" (1/1) ... [2024-11-17 05:48:12,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:12" (1/1) ... [2024-11-17 05:48:12,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:12" (1/1) ... [2024-11-17 05:48:12,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 05:48:12,464 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 05:48:12,464 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 05:48:12,464 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 05:48:12,465 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:12" (1/1) ... [2024-11-17 05:48:12,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 05:48:12,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 05:48:12,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 05:48:12,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 05:48:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 05:48:12,519 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 05:48:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 05:48:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 05:48:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 05:48:12,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 05:48:12,632 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 05:48:12,634 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 05:48:12,757 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-17 05:48:12,757 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 05:48:12,772 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 05:48:12,773 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 05:48:12,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:48:12 BoogieIcfgContainer [2024-11-17 05:48:12,774 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 05:48:12,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 05:48:12,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 05:48:12,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 05:48:12,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 05:48:11" (1/3) ... [2024-11-17 05:48:12,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25724e18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:48:12, skipping insertion in model container [2024-11-17 05:48:12,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:48:12" (2/3) ... [2024-11-17 05:48:12,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25724e18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:48:12, skipping insertion in model container [2024-11-17 05:48:12,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:48:12" (3/3) ... [2024-11-17 05:48:12,782 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2024-11-17 05:48:12,795 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 05:48:12,795 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-17 05:48:12,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 05:48:12,875 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;@5c38d538, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 05:48:12,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-17 05:48:12,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 05:48:12,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 05:48:12,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:48:12,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:48:12,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 05:48:12,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:48:12,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1246963686, now seen corresponding path program 1 times [2024-11-17 05:48:12,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 05:48:12,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026335405] [2024-11-17 05:48:12,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:48:12,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 05:48:12,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 05:48:12,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 05:48:12,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 05:48:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:48:13,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 05:48:13,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 05:48:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 05:48:13,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 05:48:13,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 05:48:13,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026335405] [2024-11-17 05:48:13,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026335405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:48:13,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 05:48:13,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 05:48:13,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566687420] [2024-11-17 05:48:13,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:48:13,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 05:48:13,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 05:48:13,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 05:48:13,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 05:48:13,068 INFO L87 Difference]: Start difference. First operand has 39 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:48:13,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:48:13,082 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2024-11-17 05:48:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 05:48:13,083 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (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 13 [2024-11-17 05:48:13,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:48:13,088 INFO L225 Difference]: With dead ends: 61 [2024-11-17 05:48:13,088 INFO L226 Difference]: Without dead ends: 30 [2024-11-17 05:48:13,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 05:48:13,094 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 05:48:13,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:48:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-17 05:48:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-17 05:48:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 26 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-11-17 05:48:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-11-17 05:48:13,129 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 13 [2024-11-17 05:48:13,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:48:13,130 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-17 05:48:13,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:48:13,131 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-11-17 05:48:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 05:48:13,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:48:13,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:48:13,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-17 05:48:13,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 05:48:13,334 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 05:48:13,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:48:13,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1168604, now seen corresponding path program 1 times [2024-11-17 05:48:13,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 05:48:13,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083920766] [2024-11-17 05:48:13,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:48:13,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 05:48:13,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 05:48:13,340 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 05:48:13,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 05:48:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:48:13,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 05:48:13,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 05:48:13,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 05:48:13,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 05:48:13,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 05:48:13,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083920766] [2024-11-17 05:48:13,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083920766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:48:13,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 05:48:13,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 05:48:13,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844727733] [2024-11-17 05:48:13,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:48:13,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 05:48:13,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 05:48:13,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 05:48:13,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 05:48:13,535 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:48:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:48:13,564 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2024-11-17 05:48:13,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 05:48:13,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2024-11-17 05:48:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:48:13,566 INFO L225 Difference]: With dead ends: 52 [2024-11-17 05:48:13,566 INFO L226 Difference]: Without dead ends: 39 [2024-11-17 05:48:13,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 05:48:13,567 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 05:48:13,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 83 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:48:13,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-17 05:48:13,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-11-17 05:48:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 05:48:13,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-17 05:48:13,575 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 14 [2024-11-17 05:48:13,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:48:13,576 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-17 05:48:13,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:48:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-17 05:48:13,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 05:48:13,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:48:13,577 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:48:13,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-17 05:48:13,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 05:48:13,778 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 05:48:13,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:48:13,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1155092203, now seen corresponding path program 1 times [2024-11-17 05:48:13,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 05:48:13,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767652273] [2024-11-17 05:48:13,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:48:13,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 05:48:13,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 05:48:13,782 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 05:48:13,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 05:48:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:48:13,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 05:48:13,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 05:48:13,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 05:48:13,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 05:48:13,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 05:48:13,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 05:48:13,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767652273] [2024-11-17 05:48:13,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767652273] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 05:48:13,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 05:48:13,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 05:48:13,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033272653] [2024-11-17 05:48:13,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 05:48:13,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 05:48:13,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 05:48:13,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 05:48:13,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 05:48:13,929 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:48:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:48:13,957 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2024-11-17 05:48:13,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 05:48:13,958 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-17 05:48:13,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:48:13,959 INFO L225 Difference]: With dead ends: 57 [2024-11-17 05:48:13,959 INFO L226 Difference]: Without dead ends: 31 [2024-11-17 05:48:13,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 05:48:13,961 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 102 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-11-17 05:48:13,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 102 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:48:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-17 05:48:13,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-17 05:48:13,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 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-11-17 05:48:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-11-17 05:48:13,967 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 21 [2024-11-17 05:48:13,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:48:13,968 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-11-17 05:48:13,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 05:48:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-17 05:48:13,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 05:48:13,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:48:13,969 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:48:13,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-17 05:48:14,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 05:48:14,170 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 05:48:14,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:48:14,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1512088253, now seen corresponding path program 1 times [2024-11-17 05:48:14,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 05:48:14,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465235619] [2024-11-17 05:48:14,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:48:14,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 05:48:14,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 05:48:14,174 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 05:48:14,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 05:48:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 05:48:14,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 05:48:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 05:48:14,294 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 05:48:14,294 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 05:48:14,295 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-17 05:48:14,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-17 05:48:14,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-17 05:48:14,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-17 05:48:14,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-17 05:48:14,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-17 05:48:14,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-17 05:48:14,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 05:48:14,502 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-17 05:48:14,519 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 05:48:14,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 05:48:14 BoogieIcfgContainer [2024-11-17 05:48:14,521 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 05:48:14,522 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 05:48:14,522 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 05:48:14,522 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 05:48:14,522 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:48:12" (3/4) ... [2024-11-17 05:48:14,524 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 05:48:14,524 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 05:48:14,525 INFO L158 Benchmark]: Toolchain (without parser) took 2932.70ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 52.0MB in the beginning and 72.0MB in the end (delta: -19.9MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-11-17 05:48:14,528 INFO L158 Benchmark]: CDTParser took 1.64ms. Allocated memory is still 52.4MB. Free memory is still 35.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 05:48:14,529 INFO L158 Benchmark]: CACSL2BoogieTranslator took 787.57ms. Allocated memory is still 88.1MB. Free memory was 52.0MB in the beginning and 56.2MB in the end (delta: -4.3MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2024-11-17 05:48:14,529 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.65ms. Allocated memory is still 88.1MB. Free memory was 56.2MB in the beginning and 53.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 05:48:14,530 INFO L158 Benchmark]: Boogie Preprocessor took 36.11ms. Allocated memory is still 88.1MB. Free memory was 53.1MB in the beginning and 50.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 05:48:14,530 INFO L158 Benchmark]: IcfgBuilder took 310.48ms. Allocated memory is still 88.1MB. Free memory was 50.5MB in the beginning and 34.8MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 05:48:14,531 INFO L158 Benchmark]: TraceAbstraction took 1745.16ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 33.7MB in the beginning and 72.6MB in the end (delta: -38.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 05:48:14,532 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 113.2MB. Free memory was 72.6MB in the beginning and 72.0MB in the end (delta: 586.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 05:48:14,533 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.64ms. Allocated memory is still 52.4MB. Free memory is still 35.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 787.57ms. Allocated memory is still 88.1MB. Free memory was 52.0MB in the beginning and 56.2MB in the end (delta: -4.3MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.65ms. Allocated memory is still 88.1MB. Free memory was 56.2MB in the beginning and 53.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.11ms. Allocated memory is still 88.1MB. Free memory was 53.1MB in the beginning and 50.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 310.48ms. Allocated memory is still 88.1MB. Free memory was 50.5MB in the beginning and 34.8MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1745.16ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 33.7MB in the beginning and 72.6MB in the end (delta: -38.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 113.2MB. Free memory was 72.6MB in the beginning and 72.0MB in the end (delta: 586.7kB). 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: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of large string literal at line 1579, overapproximation of fgets at line 1557. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1579] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1579] 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] [L1580] CALL CWE190_Integer_Overflow__int_fgets_postinc_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 [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; 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] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1567] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1567] COND TRUE j < 1 [L1570] 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: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1570]: 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: 1553]: 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, 39 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 226 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 128 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 98 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 208 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 8/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-17 05:48:14,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample