./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_17_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_17_bad.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 39ca4c94e0ade64f55a198e34d6db6eb7d7577aaa16081fe7bfb5d04e138d6dd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:34:46,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:34:46,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 22:34:46,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:34:46,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:34:46,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:34:46,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:34:46,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:34:46,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:34:46,595 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:34:46,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:34:46,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:34:46,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:34:46,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:34:46,599 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:34:46,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:34:46,600 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:34:46,600 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 22:34:46,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:34:46,600 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:34:46,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:34:46,601 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:34:46,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:34:46,605 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:34:46,605 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:34:46,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:34:46,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:34:46,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:34:46,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:34:46,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:34:46,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:34:46,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:34:46,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:34:46,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:34:46,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:34:46,608 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 22:34:46,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 22:34:46,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:34:46,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:34:46,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:34:46,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:34:46,609 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-clean/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-clean/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 -> 39ca4c94e0ade64f55a198e34d6db6eb7d7577aaa16081fe7bfb5d04e138d6dd [2024-10-11 22:34:46,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:34:46,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:34:46,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:34:46,944 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:34:46,945 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:34:46,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_17_bad.i [2024-10-11 22:34:48,366 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:34:48,679 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:34:48,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_17_bad.i [2024-10-11 22:34:48,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7ae452a01/6ced0caf2e0b45c29dd5e778a6d75cfe/FLAGa4cb62603 [2024-10-11 22:34:48,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7ae452a01/6ced0caf2e0b45c29dd5e778a6d75cfe [2024-10-11 22:34:48,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:34:48,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:34:48,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:34:48,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:34:48,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:34:48,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:34:48" (1/1) ... [2024-10-11 22:34:48,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@753d806f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:48, skipping insertion in model container [2024-10-11 22:34:48,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:34:48" (1/1) ... [2024-10-11 22:34:48,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:34:49,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:34:49,524 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:34:49,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:34:49,734 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:34:49,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:49 WrapperNode [2024-10-11 22:34:49,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:34:49,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:34:49,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:34:49,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:34:49,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:49" (1/1) ... [2024-10-11 22:34:49,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:49" (1/1) ... [2024-10-11 22:34:49,805 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 121 [2024-10-11 22:34:49,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:34:49,808 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:34:49,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:34:49,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:34:49,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:49" (1/1) ... [2024-10-11 22:34:49,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:49" (1/1) ... [2024-10-11 22:34:49,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:49" (1/1) ... [2024-10-11 22:34:49,834 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:34:49,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:49" (1/1) ... [2024-10-11 22:34:49,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:49" (1/1) ... [2024-10-11 22:34:49,842 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:49" (1/1) ... [2024-10-11 22:34:49,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:49" (1/1) ... [2024-10-11 22:34:49,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:49" (1/1) ... [2024-10-11 22:34:49,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:49" (1/1) ... [2024-10-11 22:34:49,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:34:49,852 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:34:49,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:34:49,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:34:49,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:49" (1/1) ... [2024-10-11 22:34:49,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:34:49,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:34:49,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 22:34:49,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 22:34:49,935 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:34:49,935 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:34:49,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:34:49,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:34:49,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:34:50,055 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:34:50,057 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:34:50,304 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-10-11 22:34:50,304 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:34:50,335 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:34:50,335 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 22:34:50,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:34:50 BoogieIcfgContainer [2024-10-11 22:34:50,336 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:34:50,337 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:34:50,337 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:34:50,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:34:50,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:34:48" (1/3) ... [2024-10-11 22:34:50,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1911c70d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:34:50, skipping insertion in model container [2024-10-11 22:34:50,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:49" (2/3) ... [2024-10-11 22:34:50,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1911c70d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:34:50, skipping insertion in model container [2024-10-11 22:34:50,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:34:50" (3/3) ... [2024-10-11 22:34:50,343 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_17_bad.i [2024-10-11 22:34:50,363 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:34:50,363 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 22:34:50,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:34:50,428 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;@2f0021c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:34:50,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 22:34:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 38 states have (on average 1.631578947368421) internal successors, (62), 44 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 22:34:50,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 22:34:50,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:50,439 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:34:50,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 22:34:50,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:50,446 INFO L85 PathProgramCache]: Analyzing trace with hash -999472409, now seen corresponding path program 1 times [2024-10-11 22:34:50,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:34:50,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547389003] [2024-10-11 22:34:50,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:50,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:34:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:50,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:34:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:34:50,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:34:50,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547389003] [2024-10-11 22:34:50,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547389003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:50,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:34:50,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:34:50,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005393570] [2024-10-11 22:34:50,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:50,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:34:50,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:34:50,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:34:50,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:34:50,848 INFO L87 Difference]: Start difference. First operand has 48 states, 38 states have (on average 1.631578947368421) internal successors, (62), 44 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:34:50,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:50,893 INFO L93 Difference]: Finished difference Result 89 states and 124 transitions. [2024-10-11 22:34:50,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:34:50,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 22:34:50,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:50,902 INFO L225 Difference]: With dead ends: 89 [2024-10-11 22:34:50,902 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 22:34:50,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:34:50,908 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 35 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:50,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 114 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:50,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 22:34:50,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2024-10-11 22:34:50,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 42 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:34:50,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2024-10-11 22:34:50,944 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 11 [2024-10-11 22:34:50,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:50,945 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2024-10-11 22:34:50,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:34:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2024-10-11 22:34:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 22:34:50,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:50,946 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:34:50,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 22:34:50,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 22:34:50,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:50,948 INFO L85 PathProgramCache]: Analyzing trace with hash -542324962, now seen corresponding path program 1 times [2024-10-11 22:34:50,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:34:50,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968384589] [2024-10-11 22:34:50,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:50,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:34:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:51,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:34:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:34:51,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:34:51,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968384589] [2024-10-11 22:34:51,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968384589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:51,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:34:51,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:34:51,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124851188] [2024-10-11 22:34:51,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:51,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:34:51,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:34:51,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:34:51,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:34:51,152 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:34:51,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:51,199 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2024-10-11 22:34:51,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:34:51,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-11 22:34:51,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:51,202 INFO L225 Difference]: With dead ends: 71 [2024-10-11 22:34:51,202 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 22:34:51,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:34:51,204 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 30 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:51,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 154 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:51,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 22:34:51,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-11 22:34:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 66 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:34:51,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2024-10-11 22:34:51,215 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 15 [2024-10-11 22:34:51,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:51,215 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2024-10-11 22:34:51,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:34:51,216 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2024-10-11 22:34:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 22:34:51,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:51,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:34:51,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 22:34:51,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 22:34:51,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:51,219 INFO L85 PathProgramCache]: Analyzing trace with hash -621850970, now seen corresponding path program 1 times [2024-10-11 22:34:51,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:34:51,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580992874] [2024-10-11 22:34:51,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:51,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:34:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:51,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:34:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:34:51,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:34:51,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580992874] [2024-10-11 22:34:51,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580992874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:51,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:34:51,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:34:51,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391522262] [2024-10-11 22:34:51,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:51,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:34:51,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:34:51,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:34:51,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:34:51,378 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:34:51,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:51,402 INFO L93 Difference]: Finished difference Result 69 states and 97 transitions. [2024-10-11 22:34:51,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:34:51,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-11 22:34:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:51,406 INFO L225 Difference]: With dead ends: 69 [2024-10-11 22:34:51,407 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 22:34:51,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:34:51,411 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 42 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:51,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 59 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 22:34:51,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 22:34:51,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.540983606557377) internal successors, (94), 65 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:34:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2024-10-11 22:34:51,428 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 20 [2024-10-11 22:34:51,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:51,429 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2024-10-11 22:34:51,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:34:51,429 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2024-10-11 22:34:51,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 22:34:51,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:51,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:34:51,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 22:34:51,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 22:34:51,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:51,431 INFO L85 PathProgramCache]: Analyzing trace with hash -2097510735, now seen corresponding path program 1 times [2024-10-11 22:34:51,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:34:51,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072189359] [2024-10-11 22:34:51,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:51,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:34:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 22:34:51,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 22:34:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 22:34:51,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 22:34:51,532 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 22:34:51,533 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-11 22:34:51,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-11 22:34:51,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-11 22:34:51,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-11 22:34:51,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-11 22:34:51,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-11 22:34:51,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 22:34:51,542 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 22:34:51,578 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:34:51,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:34:51 BoogieIcfgContainer [2024-10-11 22:34:51,587 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:34:51,587 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:34:51,588 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:34:51,588 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:34:51,588 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:34:50" (3/4) ... [2024-10-11 22:34:51,592 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 22:34:51,593 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 22:34:51,594 INFO L158 Benchmark]: Toolchain (without parser) took 2866.82ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 126.3MB in the beginning and 152.8MB in the end (delta: -26.5MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-10-11 22:34:51,600 INFO L158 Benchmark]: CDTParser took 4.12ms. Allocated memory is still 117.4MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:34:51,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1005.01ms. Allocated memory is still 159.4MB. Free memory was 125.2MB in the beginning and 59.4MB in the end (delta: 65.9MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-10-11 22:34:51,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.35ms. Allocated memory is still 159.4MB. Free memory was 59.4MB in the beginning and 56.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 22:34:51,601 INFO L158 Benchmark]: Boogie Preprocessor took 42.98ms. Allocated memory is still 159.4MB. Free memory was 56.2MB in the beginning and 54.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:34:51,602 INFO L158 Benchmark]: RCFGBuilder took 484.04ms. Allocated memory is still 159.4MB. Free memory was 54.1MB in the beginning and 117.8MB in the end (delta: -63.7MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-10-11 22:34:51,605 INFO L158 Benchmark]: TraceAbstraction took 1249.59ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 117.8MB in the beginning and 153.1MB in the end (delta: -35.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:34:51,606 INFO L158 Benchmark]: Witness Printer took 6.07ms. Allocated memory is still 192.9MB. Free memory was 153.1MB in the beginning and 152.8MB in the end (delta: 280.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:34:51,607 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.12ms. Allocated memory is still 117.4MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1005.01ms. Allocated memory is still 159.4MB. Free memory was 125.2MB in the beginning and 59.4MB in the end (delta: 65.9MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.35ms. Allocated memory is still 159.4MB. Free memory was 59.4MB in the beginning and 56.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.98ms. Allocated memory is still 159.4MB. Free memory was 56.2MB in the beginning and 54.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 484.04ms. Allocated memory is still 159.4MB. Free memory was 54.1MB in the beginning and 117.8MB in the end (delta: -63.7MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1249.59ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 117.8MB in the beginning and 153.1MB in the end (delta: -35.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.07ms. Allocated memory is still 192.9MB. Free memory was 153.1MB in the beginning and 152.8MB in the end (delta: 280.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE190_Integer_Overflow__int_rand_preinc_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=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] [L1557] 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] [L1557] COND TRUE j < 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, j=0] [L1560] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 327 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 165 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 85 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 22:34:51,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_17_bad.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 39ca4c94e0ade64f55a198e34d6db6eb7d7577aaa16081fe7bfb5d04e138d6dd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:34:53,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:34:54,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-11 22:34:54,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:34:54,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:34:54,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-11 22:34:54,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:34:54,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:34:54,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:34:54,064 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:34:54,066 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:34:54,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:34:54,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:34:54,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:34:54,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:34:54,071 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:34:54,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:34:54,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:34:54,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:34:54,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:34:54,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:34:54,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:34:54,074 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 22:34:54,075 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 22:34:54,075 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:34:54,075 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:34:54,076 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 22:34:54,076 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:34:54,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:34:54,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:34:54,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:34:54,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:34:54,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:34:54,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:34:54,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:34:54,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:34:54,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:34:54,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:34:54,080 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 22:34:54,081 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 22:34:54,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:34:54,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:34:54,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:34:54,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:34:54,084 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 22:34:54,085 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-clean/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-clean/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 -> 39ca4c94e0ade64f55a198e34d6db6eb7d7577aaa16081fe7bfb5d04e138d6dd [2024-10-11 22:34:54,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:34:54,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:34:54,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:34:54,455 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:34:54,455 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:34:54,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_17_bad.i [2024-10-11 22:34:56,048 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:34:56,401 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:34:56,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_17_bad.i [2024-10-11 22:34:56,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b5e36f8f8/8c1f279152ba44f9a929b974978085d4/FLAG383a19241 [2024-10-11 22:34:56,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b5e36f8f8/8c1f279152ba44f9a929b974978085d4 [2024-10-11 22:34:56,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:34:56,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:34:56,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:34:56,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:34:56,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:34:56,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:34:56" (1/1) ... [2024-10-11 22:34:56,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15968761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:56, skipping insertion in model container [2024-10-11 22:34:56,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:34:56" (1/1) ... [2024-10-11 22:34:56,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:34:57,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:34:57,359 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:34:57,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:34:57,589 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:34:57,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:57 WrapperNode [2024-10-11 22:34:57,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:34:57,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:34:57,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:34:57,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:34:57,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:57" (1/1) ... [2024-10-11 22:34:57,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:57" (1/1) ... [2024-10-11 22:34:57,652 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2024-10-11 22:34:57,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:34:57,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:34:57,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:34:57,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:34:57,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:57" (1/1) ... [2024-10-11 22:34:57,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:57" (1/1) ... [2024-10-11 22:34:57,672 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:57" (1/1) ... [2024-10-11 22:34:57,683 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:34:57,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:57" (1/1) ... [2024-10-11 22:34:57,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:57" (1/1) ... [2024-10-11 22:34:57,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:57" (1/1) ... [2024-10-11 22:34:57,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:57" (1/1) ... [2024-10-11 22:34:57,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:57" (1/1) ... [2024-10-11 22:34:57,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:57" (1/1) ... [2024-10-11 22:34:57,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:34:57,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:34:57,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:34:57,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:34:57,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:57" (1/1) ... [2024-10-11 22:34:57,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:34:57,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:34:57,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 22:34:57,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 22:34:57,798 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:34:57,798 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:34:57,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:34:57,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:34:57,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:34:57,945 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:34:57,947 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:34:58,154 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-11 22:34:58,154 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:34:58,196 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:34:58,197 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 22:34:58,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:34:58 BoogieIcfgContainer [2024-10-11 22:34:58,197 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:34:58,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:34:58,200 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:34:58,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:34:58,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:34:56" (1/3) ... [2024-10-11 22:34:58,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34351faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:34:58, skipping insertion in model container [2024-10-11 22:34:58,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:34:57" (2/3) ... [2024-10-11 22:34:58,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34351faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:34:58, skipping insertion in model container [2024-10-11 22:34:58,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:34:58" (3/3) ... [2024-10-11 22:34:58,210 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_17_bad.i [2024-10-11 22:34:58,227 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:34:58,227 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 22:34:58,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:34:58,297 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;@152a4cbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:34:58,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 22:34:58,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 22:34:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 22:34:58,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:58,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:34:58,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 22:34:58,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:58,313 INFO L85 PathProgramCache]: Analyzing trace with hash -169406556, now seen corresponding path program 1 times [2024-10-11 22:34:58,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:34:58,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728840834] [2024-10-11 22:34:58,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:58,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:34:58,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:34:58,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 22:34:58,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 22:34:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:58,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 22:34:58,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:34:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:34:58,467 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:34:58,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:34:58,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728840834] [2024-10-11 22:34:58,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728840834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:58,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:34:58,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 22:34:58,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569043985] [2024-10-11 22:34:58,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:58,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 22:34:58,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:34:58,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 22:34:58,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 22:34:58,502 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:34:58,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:58,547 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2024-10-11 22:34:58,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 22:34:58,549 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 22:34:58,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:58,557 INFO L225 Difference]: With dead ends: 44 [2024-10-11 22:34:58,557 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 22:34:58,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 22:34:58,565 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:58,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:58,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 22:34:58,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-11 22:34:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:34:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-10-11 22:34:58,607 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 11 [2024-10-11 22:34:58,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:58,608 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-10-11 22:34:58,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:34:58,609 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-10-11 22:34:58,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 22:34:58,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:58,610 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:34:58,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 22:34:58,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:34:58,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 22:34:58,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:58,812 INFO L85 PathProgramCache]: Analyzing trace with hash -956635861, now seen corresponding path program 1 times [2024-10-11 22:34:58,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:34:58,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547478738] [2024-10-11 22:34:58,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:58,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:34:58,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:34:58,816 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 22:34:58,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 22:34:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:58,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 22:34:58,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:34:58,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:34:58,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:34:58,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:34:58,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547478738] [2024-10-11 22:34:58,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547478738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:58,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:34:58,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:34:58,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303990099] [2024-10-11 22:34:58,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:58,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:34:58,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:34:58,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:34:58,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:34:58,938 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:34:58,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:58,966 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2024-10-11 22:34:58,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:34:58,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-11 22:34:58,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:58,970 INFO L225 Difference]: With dead ends: 32 [2024-10-11 22:34:58,970 INFO L226 Difference]: Without dead ends: 24 [2024-10-11 22:34:58,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:34:58,971 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:58,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 37 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-11 22:34:58,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-10-11 22:34:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:34:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-10-11 22:34:58,982 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2024-10-11 22:34:58,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:58,982 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-10-11 22:34:58,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:34:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-10-11 22:34:58,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 22:34:58,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:58,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:34:58,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 22:34:59,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:34:59,192 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 22:34:59,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:59,193 INFO L85 PathProgramCache]: Analyzing trace with hash -955177575, now seen corresponding path program 1 times [2024-10-11 22:34:59,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:34:59,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138427317] [2024-10-11 22:34:59,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:59,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:34:59,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:34:59,197 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 22:34:59,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 22:34:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:34:59,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 22:34:59,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:34:59,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:34:59,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:34:59,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 22:34:59,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138427317] [2024-10-11 22:34:59,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138427317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:34:59,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:34:59,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:34:59,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561028437] [2024-10-11 22:34:59,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:34:59,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:34:59,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 22:34:59,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:34:59,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:34:59,296 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:34:59,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:34:59,331 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-10-11 22:34:59,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:34:59,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-11 22:34:59,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:34:59,333 INFO L225 Difference]: With dead ends: 27 [2024-10-11 22:34:59,333 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 22:34:59,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:34:59,334 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:34:59,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 50 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:34:59,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 22:34:59,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 22:34:59,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 23 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:34:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-10-11 22:34:59,340 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 12 [2024-10-11 22:34:59,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:34:59,340 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-10-11 22:34:59,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:34:59,341 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-10-11 22:34:59,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 22:34:59,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:34:59,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:34:59,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 22:34:59,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:34:59,542 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 22:34:59,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:34:59,543 INFO L85 PathProgramCache]: Analyzing trace with hash 649556545, now seen corresponding path program 1 times [2024-10-11 22:34:59,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 22:34:59,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493229470] [2024-10-11 22:34:59,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:34:59,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:34:59,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 22:34:59,547 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 22:34:59,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 22:34:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 22:34:59,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 22:34:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 22:34:59,674 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 22:34:59,674 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 22:34:59,675 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-11 22:34:59,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-11 22:34:59,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-11 22:34:59,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-11 22:34:59,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-11 22:34:59,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-11 22:34:59,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 22:34:59,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 22:34:59,881 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 22:34:59,908 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:34:59,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:34:59 BoogieIcfgContainer [2024-10-11 22:34:59,913 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:34:59,913 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:34:59,913 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:34:59,914 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:34:59,914 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:34:58" (3/4) ... [2024-10-11 22:34:59,918 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 22:34:59,919 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 22:34:59,922 INFO L158 Benchmark]: Toolchain (without parser) took 3472.31ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 45.9MB in the beginning and 45.8MB in the end (delta: 51.9kB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-10-11 22:34:59,922 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 48.2MB. Free memory is still 29.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:34:59,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1141.72ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 45.6MB in the beginning and 48.9MB in the end (delta: -3.3MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2024-10-11 22:34:59,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.37ms. Allocated memory is still 81.8MB. Free memory was 48.9MB in the beginning and 45.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:34:59,925 INFO L158 Benchmark]: Boogie Preprocessor took 63.71ms. Allocated memory is still 81.8MB. Free memory was 45.6MB in the beginning and 43.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:34:59,925 INFO L158 Benchmark]: RCFGBuilder took 479.27ms. Allocated memory is still 81.8MB. Free memory was 42.6MB in the beginning and 47.1MB in the end (delta: -4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 22:34:59,925 INFO L158 Benchmark]: TraceAbstraction took 1713.10ms. Allocated memory is still 81.8MB. Free memory was 46.3MB in the beginning and 45.8MB in the end (delta: 453.4kB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. [2024-10-11 22:34:59,926 INFO L158 Benchmark]: Witness Printer took 5.87ms. Allocated memory is still 81.8MB. Free memory is still 45.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:34:59,928 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.14ms. Allocated memory is still 48.2MB. Free memory is still 29.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1141.72ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 45.6MB in the beginning and 48.9MB in the end (delta: -3.3MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.37ms. Allocated memory is still 81.8MB. Free memory was 48.9MB in the beginning and 45.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.71ms. Allocated memory is still 81.8MB. Free memory was 45.6MB in the beginning and 43.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 479.27ms. Allocated memory is still 81.8MB. Free memory was 42.6MB in the beginning and 47.1MB in the end (delta: -4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1713.10ms. Allocated memory is still 81.8MB. Free memory was 46.3MB in the beginning and 45.8MB in the end (delta: 453.4kB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. * Witness Printer took 5.87ms. Allocated memory is still 81.8MB. Free memory is still 45.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE190_Integer_Overflow__int_rand_preinc_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=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] [L1557] 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] [L1557] COND TRUE j < 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, j=0] [L1560] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 112 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 63 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 9, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 44 SizeOfPredicates, 0 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 22:34:59,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample