./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash da84b0bfdfce2fad5f551c5bc14b33ff3764ad6f4b0c00bd09707e2922ecd646 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:52:17,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:52:17,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-17 03:52:17,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:52:17,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:52:18,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:52:18,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:52:18,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:52:18,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:52:18,033 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:52:18,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:52:18,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:52:18,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:52:18,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:52:18,036 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:52:18,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:52:18,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 03:52:18,036 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:52:18,039 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:52:18,040 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:52:18,040 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:52:18,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 03:52:18,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:52:18,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 03:52:18,041 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:52:18,041 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 03:52:18,042 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:52:18,042 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:52:18,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 03:52:18,042 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:52:18,043 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:52:18,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:52:18,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:52:18,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:52:18,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:52:18,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:52:18,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:52:18,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 03:52:18,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:52:18,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:52:18,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:52:18,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:52:18,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:52:18,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:52:18,048 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> da84b0bfdfce2fad5f551c5bc14b33ff3764ad6f4b0c00bd09707e2922ecd646 [2024-11-17 03:52:18,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:52:18,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:52:18,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:52:18,346 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:52:18,346 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:52:18,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c [2024-11-17 03:52:19,828 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:52:20,025 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:52:20,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c [2024-11-17 03:52:20,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/943fecebf/464f4b2c6a93442cafe6f49d8cd59f9e/FLAG015b899af [2024-11-17 03:52:20,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/943fecebf/464f4b2c6a93442cafe6f49d8cd59f9e [2024-11-17 03:52:20,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:52:20,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:52:20,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:52:20,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:52:20,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:52:20,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:52:20" (1/1) ... [2024-11-17 03:52:20,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df685b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:20, skipping insertion in model container [2024-11-17 03:52:20,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:52:20" (1/1) ... [2024-11-17 03:52:20,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:52:20,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:52:20,731 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:52:20,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:52:20,815 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:52:20,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:20 WrapperNode [2024-11-17 03:52:20,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:52:20,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:52:20,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:52:20,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:52:20,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:20" (1/1) ... [2024-11-17 03:52:20,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:20" (1/1) ... [2024-11-17 03:52:20,926 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 162 [2024-11-17 03:52:20,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:52:20,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:52:20,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:52:20,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:52:20,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:20" (1/1) ... [2024-11-17 03:52:20,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:20" (1/1) ... [2024-11-17 03:52:20,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:20" (1/1) ... [2024-11-17 03:52:21,010 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 03:52:21,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:20" (1/1) ... [2024-11-17 03:52:21,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:20" (1/1) ... [2024-11-17 03:52:21,019 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:20" (1/1) ... [2024-11-17 03:52:21,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:20" (1/1) ... [2024-11-17 03:52:21,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:20" (1/1) ... [2024-11-17 03:52:21,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:20" (1/1) ... [2024-11-17 03:52:21,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:52:21,033 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:52:21,037 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:52:21,037 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:52:21,038 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:20" (1/1) ... [2024-11-17 03:52:21,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:52:21,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:52:21,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 03:52:21,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 03:52:21,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:52:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 03:52:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-17 03:52:21,135 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-17 03:52:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:52:21,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:52:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-17 03:52:21,136 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-17 03:52:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 03:52:21,137 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 03:52:21,233 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:52:21,236 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:52:21,735 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2024-11-17 03:52:21,736 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:52:21,778 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:52:21,780 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-17 03:52:21,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:52:21 BoogieIcfgContainer [2024-11-17 03:52:21,781 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:52:21,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:52:21,784 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:52:21,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:52:21,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:52:20" (1/3) ... [2024-11-17 03:52:21,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b71bedf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:52:21, skipping insertion in model container [2024-11-17 03:52:21,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:20" (2/3) ... [2024-11-17 03:52:21,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b71bedf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:52:21, skipping insertion in model container [2024-11-17 03:52:21,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:52:21" (3/3) ... [2024-11-17 03:52:21,798 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2.c.cil.c [2024-11-17 03:52:21,822 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:52:21,822 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-17 03:52:21,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:52:21,908 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;@7763116f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:52:21,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-17 03:52:21,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 100 states have (on average 1.54) internal successors, (154), 122 states have internal predecessors, (154), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-17 03:52:21,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 03:52:21,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:21,923 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:21,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-17 03:52:21,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:21,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1071435353, now seen corresponding path program 1 times [2024-11-17 03:52:21,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:21,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171839645] [2024-11-17 03:52:21,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:21,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:52:22,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:22,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171839645] [2024-11-17 03:52:22,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171839645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:22,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:22,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:52:22,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792664964] [2024-11-17 03:52:22,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:22,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:52:22,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:22,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:52:22,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:52:22,267 INFO L87 Difference]: Start difference. First operand has 134 states, 100 states have (on average 1.54) internal successors, (154), 122 states have internal predecessors, (154), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:22,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:22,483 INFO L93 Difference]: Finished difference Result 334 states and 448 transitions. [2024-11-17 03:52:22,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:52:22,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 03:52:22,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:22,501 INFO L225 Difference]: With dead ends: 334 [2024-11-17 03:52:22,502 INFO L226 Difference]: Without dead ends: 193 [2024-11-17 03:52:22,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:52:22,514 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 110 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:22,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 417 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:22,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-17 03:52:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2024-11-17 03:52:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 150 states have (on average 1.4133333333333333) internal successors, (212), 168 states have internal predecessors, (212), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 03:52:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 225 transitions. [2024-11-17 03:52:22,569 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 225 transitions. Word has length 11 [2024-11-17 03:52:22,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:22,570 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 225 transitions. [2024-11-17 03:52:22,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:22,571 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 225 transitions. [2024-11-17 03:52:22,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 03:52:22,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:22,573 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:22,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 03:52:22,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-17 03:52:22,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:22,575 INFO L85 PathProgramCache]: Analyzing trace with hash -837658028, now seen corresponding path program 1 times [2024-11-17 03:52:22,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:22,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746135797] [2024-11-17 03:52:22,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:22,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:22,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 03:52:22,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:22,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746135797] [2024-11-17 03:52:22,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746135797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:22,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:22,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:52:22,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846618303] [2024-11-17 03:52:22,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:22,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:52:22,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:22,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:52:22,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:52:22,671 INFO L87 Difference]: Start difference. First operand 179 states and 225 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:52:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:22,781 INFO L93 Difference]: Finished difference Result 179 states and 225 transitions. [2024-11-17 03:52:22,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:52:22,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-17 03:52:22,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:22,783 INFO L225 Difference]: With dead ends: 179 [2024-11-17 03:52:22,783 INFO L226 Difference]: Without dead ends: 178 [2024-11-17 03:52:22,784 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-11-17 03:52:22,785 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 2 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:22,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 240 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:22,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-17 03:52:22,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-17 03:52:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 150 states have (on average 1.4) internal successors, (210), 167 states have internal predecessors, (210), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 03:52:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 223 transitions. [2024-11-17 03:52:22,818 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 223 transitions. Word has length 18 [2024-11-17 03:52:22,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:22,820 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 223 transitions. [2024-11-17 03:52:22,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:52:22,821 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 223 transitions. [2024-11-17 03:52:22,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 03:52:22,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:22,824 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:22,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 03:52:22,825 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-17 03:52:22,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:22,826 INFO L85 PathProgramCache]: Analyzing trace with hash -197595092, now seen corresponding path program 1 times [2024-11-17 03:52:22,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:22,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640126327] [2024-11-17 03:52:22,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:22,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:22,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:22,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:52:22,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:22,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640126327] [2024-11-17 03:52:22,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640126327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:22,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:22,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:52:22,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401542779] [2024-11-17 03:52:22,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:22,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:52:22,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:22,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:52:22,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:52:22,947 INFO L87 Difference]: Start difference. First operand 178 states and 223 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:52:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:23,127 INFO L93 Difference]: Finished difference Result 253 states and 323 transitions. [2024-11-17 03:52:23,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:52:23,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-17 03:52:23,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:23,129 INFO L225 Difference]: With dead ends: 253 [2024-11-17 03:52:23,130 INFO L226 Difference]: Without dead ends: 250 [2024-11-17 03:52:23,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:52:23,132 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 114 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:23,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 436 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:23,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-17 03:52:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 228. [2024-11-17 03:52:23,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 200 states have (on average 1.4) internal successors, (280), 216 states have internal predecessors, (280), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 03:52:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 293 transitions. [2024-11-17 03:52:23,170 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 293 transitions. Word has length 19 [2024-11-17 03:52:23,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:23,171 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 293 transitions. [2024-11-17 03:52:23,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:52:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 293 transitions. [2024-11-17 03:52:23,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 03:52:23,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:23,173 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:23,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 03:52:23,173 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-17 03:52:23,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:23,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1192826410, now seen corresponding path program 1 times [2024-11-17 03:52:23,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:23,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373798098] [2024-11-17 03:52:23,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:23,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:23,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:23,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:52:23,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:23,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373798098] [2024-11-17 03:52:23,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373798098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:23,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:23,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:52:23,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523632516] [2024-11-17 03:52:23,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:23,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:52:23,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:23,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:52:23,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:52:23,249 INFO L87 Difference]: Start difference. First operand 228 states and 293 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:52:23,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:23,379 INFO L93 Difference]: Finished difference Result 253 states and 317 transitions. [2024-11-17 03:52:23,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:52:23,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-17 03:52:23,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:23,382 INFO L225 Difference]: With dead ends: 253 [2024-11-17 03:52:23,382 INFO L226 Difference]: Without dead ends: 249 [2024-11-17 03:52:23,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:52:23,384 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 102 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:23,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 434 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:23,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-17 03:52:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 234. [2024-11-17 03:52:23,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.3623188405797102) internal successors, (282), 222 states have internal predecessors, (282), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 03:52:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 295 transitions. [2024-11-17 03:52:23,408 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 295 transitions. Word has length 19 [2024-11-17 03:52:23,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:23,408 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 295 transitions. [2024-11-17 03:52:23,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:52:23,408 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 295 transitions. [2024-11-17 03:52:23,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 03:52:23,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:23,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:23,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 03:52:23,410 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-17 03:52:23,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:23,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1042578480, now seen corresponding path program 1 times [2024-11-17 03:52:23,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:23,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009699887] [2024-11-17 03:52:23,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:23,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:52:23,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:23,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009699887] [2024-11-17 03:52:23,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009699887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:23,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:23,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:52:23,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058996435] [2024-11-17 03:52:23,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:23,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:52:23,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:23,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:52:23,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:52:23,483 INFO L87 Difference]: Start difference. First operand 234 states and 295 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:23,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:23,552 INFO L93 Difference]: Finished difference Result 438 states and 551 transitions. [2024-11-17 03:52:23,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:52:23,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-17 03:52:23,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:23,555 INFO L225 Difference]: With dead ends: 438 [2024-11-17 03:52:23,555 INFO L226 Difference]: Without dead ends: 251 [2024-11-17 03:52:23,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:52:23,557 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 15 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:23,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 245 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:23,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-17 03:52:23,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 240. [2024-11-17 03:52:23,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 213 states have (on average 1.3380281690140845) internal successors, (285), 228 states have internal predecessors, (285), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 03:52:23,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 298 transitions. [2024-11-17 03:52:23,574 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 298 transitions. Word has length 18 [2024-11-17 03:52:23,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:23,575 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 298 transitions. [2024-11-17 03:52:23,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 298 transitions. [2024-11-17 03:52:23,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 03:52:23,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:23,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:23,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 03:52:23,577 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-17 03:52:23,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:23,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2039654563, now seen corresponding path program 1 times [2024-11-17 03:52:23,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:23,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217429747] [2024-11-17 03:52:23,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:23,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:52:23,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:23,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217429747] [2024-11-17 03:52:23,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217429747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:23,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:23,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:52:23,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636875665] [2024-11-17 03:52:23,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:23,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:52:23,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:23,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:52:23,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:52:23,684 INFO L87 Difference]: Start difference. First operand 240 states and 298 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:23,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:23,833 INFO L93 Difference]: Finished difference Result 451 states and 554 transitions. [2024-11-17 03:52:23,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:52:23,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 03:52:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:23,838 INFO L225 Difference]: With dead ends: 451 [2024-11-17 03:52:23,840 INFO L226 Difference]: Without dead ends: 274 [2024-11-17 03:52:23,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:52:23,842 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 172 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:23,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 381 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-17 03:52:23,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 255. [2024-11-17 03:52:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 228 states have (on average 1.3245614035087718) internal successors, (302), 243 states have internal predecessors, (302), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 03:52:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 315 transitions. [2024-11-17 03:52:23,859 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 315 transitions. Word has length 19 [2024-11-17 03:52:23,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:23,860 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 315 transitions. [2024-11-17 03:52:23,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:23,860 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 315 transitions. [2024-11-17 03:52:23,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 03:52:23,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:23,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:23,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 03:52:23,862 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-17 03:52:23,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:23,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1268001734, now seen corresponding path program 1 times [2024-11-17 03:52:23,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:23,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822983262] [2024-11-17 03:52:23,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:23,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:52:23,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:23,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822983262] [2024-11-17 03:52:23,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822983262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:23,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:23,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:52:23,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063238252] [2024-11-17 03:52:23,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:23,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:52:23,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:23,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:52:23,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:52:23,904 INFO L87 Difference]: Start difference. First operand 255 states and 315 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:23,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:23,959 INFO L93 Difference]: Finished difference Result 460 states and 568 transitions. [2024-11-17 03:52:23,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:52:23,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 03:52:23,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:23,961 INFO L225 Difference]: With dead ends: 460 [2024-11-17 03:52:23,962 INFO L226 Difference]: Without dead ends: 267 [2024-11-17 03:52:23,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:52:23,963 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 11 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:23,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 244 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:52:23,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-17 03:52:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 257. [2024-11-17 03:52:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 230 states have (on average 1.3043478260869565) internal successors, (300), 245 states have internal predecessors, (300), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 03:52:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 313 transitions. [2024-11-17 03:52:23,974 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 313 transitions. Word has length 19 [2024-11-17 03:52:23,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:23,975 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 313 transitions. [2024-11-17 03:52:23,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 313 transitions. [2024-11-17 03:52:23,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 03:52:23,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:23,976 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-11-17 03:52:23,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 03:52:23,977 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-17 03:52:23,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:23,977 INFO L85 PathProgramCache]: Analyzing trace with hash -924612300, now seen corresponding path program 1 times [2024-11-17 03:52:23,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:23,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047273637] [2024-11-17 03:52:23,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:23,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:24,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:52:24,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:24,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047273637] [2024-11-17 03:52:24,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047273637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:24,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:24,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:52:24,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109143489] [2024-11-17 03:52:24,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:24,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:52:24,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:24,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:52:24,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:52:24,046 INFO L87 Difference]: Start difference. First operand 257 states and 313 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:24,105 INFO L93 Difference]: Finished difference Result 436 states and 531 transitions. [2024-11-17 03:52:24,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:52:24,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-17 03:52:24,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:24,107 INFO L225 Difference]: With dead ends: 436 [2024-11-17 03:52:24,107 INFO L226 Difference]: Without dead ends: 184 [2024-11-17 03:52:24,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:52:24,108 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 4 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:24,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 374 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:52:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-17 03:52:24,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-17 03:52:24,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 157 states have (on average 1.3375796178343948) internal successors, (210), 172 states have internal predecessors, (210), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 03:52:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 223 transitions. [2024-11-17 03:52:24,144 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 223 transitions. Word has length 20 [2024-11-17 03:52:24,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:24,145 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 223 transitions. [2024-11-17 03:52:24,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 223 transitions. [2024-11-17 03:52:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 03:52:24,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:24,147 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:24,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 03:52:24,148 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-17 03:52:24,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:24,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1694468443, now seen corresponding path program 1 times [2024-11-17 03:52:24,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:24,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711820944] [2024-11-17 03:52:24,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:24,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:24,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:24,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 03:52:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 03:52:24,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:24,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711820944] [2024-11-17 03:52:24,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711820944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:24,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:24,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:52:24,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509869686] [2024-11-17 03:52:24,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:24,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:52:24,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:24,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:52:24,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:52:24,253 INFO L87 Difference]: Start difference. First operand 184 states and 223 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 03:52:24,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:24,397 INFO L93 Difference]: Finished difference Result 201 states and 240 transitions. [2024-11-17 03:52:24,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:52:24,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-17 03:52:24,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:24,399 INFO L225 Difference]: With dead ends: 201 [2024-11-17 03:52:24,399 INFO L226 Difference]: Without dead ends: 199 [2024-11-17 03:52:24,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:52:24,400 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 102 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:24,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 519 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:24,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-17 03:52:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 188. [2024-11-17 03:52:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 162 states have (on average 1.3271604938271604) internal successors, (215), 176 states have internal predecessors, (215), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 03:52:24,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 228 transitions. [2024-11-17 03:52:24,412 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 228 transitions. Word has length 26 [2024-11-17 03:52:24,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:24,412 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 228 transitions. [2024-11-17 03:52:24,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 03:52:24,412 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 228 transitions. [2024-11-17 03:52:24,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 03:52:24,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:24,413 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:24,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 03:52:24,414 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-17 03:52:24,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:24,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1210077351, now seen corresponding path program 1 times [2024-11-17 03:52:24,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:24,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759064454] [2024-11-17 03:52:24,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:24,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:24,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:24,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 03:52:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 03:52:24,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:24,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759064454] [2024-11-17 03:52:24,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759064454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:24,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:24,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:52:24,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133166206] [2024-11-17 03:52:24,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:24,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:52:24,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:24,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:52:24,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:52:24,495 INFO L87 Difference]: Start difference. First operand 188 states and 228 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 03:52:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:24,640 INFO L93 Difference]: Finished difference Result 206 states and 243 transitions. [2024-11-17 03:52:24,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:52:24,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-17 03:52:24,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:24,642 INFO L225 Difference]: With dead ends: 206 [2024-11-17 03:52:24,642 INFO L226 Difference]: Without dead ends: 203 [2024-11-17 03:52:24,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:52:24,643 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 90 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:24,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 512 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:24,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-17 03:52:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 192. [2024-11-17 03:52:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 167 states have (on average 1.3053892215568863) internal successors, (218), 180 states have internal predecessors, (218), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 03:52:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 231 transitions. [2024-11-17 03:52:24,657 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 231 transitions. Word has length 26 [2024-11-17 03:52:24,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:24,658 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 231 transitions. [2024-11-17 03:52:24,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 03:52:24,658 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 231 transitions. [2024-11-17 03:52:24,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 03:52:24,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:24,660 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:24,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 03:52:24,660 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-17 03:52:24,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:24,661 INFO L85 PathProgramCache]: Analyzing trace with hash 418611978, now seen corresponding path program 1 times [2024-11-17 03:52:24,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:24,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416475101] [2024-11-17 03:52:24,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:24,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:24,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:24,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 03:52:24,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:24,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416475101] [2024-11-17 03:52:24,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416475101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:24,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:24,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:52:24,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117035503] [2024-11-17 03:52:24,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:24,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:52:24,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:24,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:52:24,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:52:24,714 INFO L87 Difference]: Start difference. First operand 192 states and 231 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:52:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:24,795 INFO L93 Difference]: Finished difference Result 200 states and 241 transitions. [2024-11-17 03:52:24,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:52:24,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-17 03:52:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:24,797 INFO L225 Difference]: With dead ends: 200 [2024-11-17 03:52:24,797 INFO L226 Difference]: Without dead ends: 198 [2024-11-17 03:52:24,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:52:24,798 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 11 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:24,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 344 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-17 03:52:24,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 180. [2024-11-17 03:52:24,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 157 states have (on average 1.2993630573248407) internal successors, (204), 168 states have internal predecessors, (204), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 03:52:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 217 transitions. [2024-11-17 03:52:24,808 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 217 transitions. Word has length 26 [2024-11-17 03:52:24,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:24,810 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 217 transitions. [2024-11-17 03:52:24,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:52:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 217 transitions. [2024-11-17 03:52:24,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 03:52:24,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:24,811 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:24,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 03:52:24,811 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-17 03:52:24,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:24,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2027760857, now seen corresponding path program 1 times [2024-11-17 03:52:24,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:24,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432191079] [2024-11-17 03:52:24,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:24,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:52:24,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:52:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:52:24,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 03:52:24,852 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:52:24,853 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-11-17 03:52:24,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-11-17 03:52:24,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-11-17 03:52:24,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-11-17 03:52:24,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-11-17 03:52:24,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-11-17 03:52:24,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-11-17 03:52:24,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-11-17 03:52:24,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-11-17 03:52:24,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-11-17 03:52:24,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-11-17 03:52:24,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-11-17 03:52:24,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-11-17 03:52:24,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-11-17 03:52:24,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-11-17 03:52:24,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-11-17 03:52:24,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-11-17 03:52:24,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-11-17 03:52:24,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-11-17 03:52:24,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-11-17 03:52:24,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-11-17 03:52:24,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-11-17 03:52:24,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 03:52:24,866 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:24,892 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:52:24,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:52:24 BoogieIcfgContainer [2024-11-17 03:52:24,897 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:52:24,898 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:52:24,898 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:52:24,898 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:52:24,898 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:52:21" (3/4) ... [2024-11-17 03:52:24,902 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:52:24,903 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:52:24,904 INFO L158 Benchmark]: Toolchain (without parser) took 4509.90ms. Allocated memory was 172.0MB in the beginning and 234.9MB in the end (delta: 62.9MB). Free memory was 102.0MB in the beginning and 130.6MB in the end (delta: -28.6MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2024-11-17 03:52:24,904 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 172.0MB. Free memory was 129.6MB in the beginning and 129.5MB in the end (delta: 165.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:52:24,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.93ms. Allocated memory is still 172.0MB. Free memory was 101.9MB in the beginning and 86.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 03:52:24,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.17ms. Allocated memory is still 172.0MB. Free memory was 86.6MB in the beginning and 144.7MB in the end (delta: -58.1MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-11-17 03:52:24,905 INFO L158 Benchmark]: Boogie Preprocessor took 105.60ms. Allocated memory is still 172.0MB. Free memory was 144.7MB in the beginning and 142.8MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:52:24,905 INFO L158 Benchmark]: IcfgBuilder took 748.06ms. Allocated memory is still 172.0MB. Free memory was 142.8MB in the beginning and 116.4MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-17 03:52:24,906 INFO L158 Benchmark]: TraceAbstraction took 3113.74ms. Allocated memory was 172.0MB in the beginning and 234.9MB in the end (delta: 62.9MB). Free memory was 115.7MB in the beginning and 131.7MB in the end (delta: -16.0MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-17 03:52:24,906 INFO L158 Benchmark]: Witness Printer took 5.97ms. Allocated memory is still 234.9MB. Free memory was 131.7MB in the beginning and 130.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:52:24,908 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.97ms. Allocated memory is still 172.0MB. Free memory was 129.6MB in the beginning and 129.5MB in the end (delta: 165.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.93ms. Allocated memory is still 172.0MB. Free memory was 101.9MB in the beginning and 86.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.17ms. Allocated memory is still 172.0MB. Free memory was 86.6MB in the beginning and 144.7MB in the end (delta: -58.1MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.60ms. Allocated memory is still 172.0MB. Free memory was 144.7MB in the beginning and 142.8MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 748.06ms. Allocated memory is still 172.0MB. Free memory was 142.8MB in the beginning and 116.4MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3113.74ms. Allocated memory was 172.0MB in the beginning and 234.9MB in the end (delta: 62.9MB). Free memory was 115.7MB in the beginning and 131.7MB in the end (delta: -16.0MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Witness Printer took 5.97ms. Allocated memory is still 234.9MB. Free memory was 131.7MB in the beginning and 130.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 80. Possible FailurePath: [L230] unsigned int a ; [L231] unsigned int ma = __VERIFIER_nondet_uint(); [L232] signed char ea = __VERIFIER_nondet_char(); [L233] unsigned int b ; [L234] unsigned int mb = __VERIFIER_nondet_uint(); [L235] signed char eb = __VERIFIER_nondet_char(); [L236] unsigned int r_add1 ; [L237] unsigned int r_add2 ; [L238] unsigned int zero ; [L239] int tmp ; [L240] int tmp___0 ; [L241] int __retres14 ; VAL [ea=0, eb=0] [L245] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L33] COND TRUE ! m [L34] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L84] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L245] RET, EXPR base2flt(0, 0) VAL [ea=0, eb=0] [L245] zero = base2flt(0, 0) [L246] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L33] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L39] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L61] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L63] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L80] EXPR m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0] [L80] m = m & ~ (1U << 24U) [L81] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L81] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, m=0] - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 134 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 747 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 733 mSDsluCounter, 4146 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2729 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 935 IncrementalHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 1417 mSDtfsCounter, 935 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=257occurred in iteration=7, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 131 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 492 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 26/26 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-17 03:52:24,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash da84b0bfdfce2fad5f551c5bc14b33ff3764ad6f4b0c00bd09707e2922ecd646 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:52:27,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:52:27,424 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-11-17 03:52:27,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:52:27,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:52:27,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:52:27,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:52:27,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:52:27,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:52:27,468 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:52:27,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:52:27,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:52:27,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:52:27,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:52:27,472 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:52:27,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:52:27,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 03:52:27,473 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:52:27,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:52:27,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:52:27,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 03:52:27,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:52:27,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 03:52:27,479 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:52:27,479 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 03:52:27,479 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:52:27,479 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 03:52:27,487 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 03:52:27,488 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:52:27,490 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:52:27,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 03:52:27,493 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:52:27,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:52:27,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:52:27,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:52:27,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:52:27,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:52:27,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:52:27,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:52:27,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 03:52:27,494 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 03:52:27,496 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 03:52:27,496 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:52:27,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:52:27,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:52:27,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:52:27,497 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> da84b0bfdfce2fad5f551c5bc14b33ff3764ad6f4b0c00bd09707e2922ecd646 [2024-11-17 03:52:27,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:52:27,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:52:27,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:52:27,888 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:52:27,890 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:52:27,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c [2024-11-17 03:52:29,604 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:52:29,802 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:52:29,803 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c [2024-11-17 03:52:29,811 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa7105e33/db924fcc12af46e6914fd789f40f245f/FLAGbf9c6ad01 [2024-11-17 03:52:29,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa7105e33/db924fcc12af46e6914fd789f40f245f [2024-11-17 03:52:29,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:52:29,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:52:29,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:52:29,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:52:29,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:52:29,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:52:29" (1/1) ... [2024-11-17 03:52:29,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@619608e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:29, skipping insertion in model container [2024-11-17 03:52:29,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:52:29" (1/1) ... [2024-11-17 03:52:29,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:52:30,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:52:30,184 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:52:30,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:52:30,267 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:52:30,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:30 WrapperNode [2024-11-17 03:52:30,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:52:30,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:52:30,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:52:30,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:52:30,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:30" (1/1) ... [2024-11-17 03:52:30,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:30" (1/1) ... [2024-11-17 03:52:30,319 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 121 [2024-11-17 03:52:30,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:52:30,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:52:30,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:52:30,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:52:30,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:30" (1/1) ... [2024-11-17 03:52:30,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:30" (1/1) ... [2024-11-17 03:52:30,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:30" (1/1) ... [2024-11-17 03:52:30,361 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 03:52:30,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:30" (1/1) ... [2024-11-17 03:52:30,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:30" (1/1) ... [2024-11-17 03:52:30,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:30" (1/1) ... [2024-11-17 03:52:30,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:30" (1/1) ... [2024-11-17 03:52:30,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:30" (1/1) ... [2024-11-17 03:52:30,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:30" (1/1) ... [2024-11-17 03:52:30,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:52:30,387 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:52:30,388 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:52:30,388 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:52:30,389 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:30" (1/1) ... [2024-11-17 03:52:30,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:52:30,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:52:30,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 03:52:30,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 03:52:30,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:52:30,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 03:52:30,463 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-17 03:52:30,463 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-17 03:52:30,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:52:30,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:52:30,464 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-17 03:52:30,464 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-17 03:52:30,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 03:52:30,464 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 03:52:30,544 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:52:30,547 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:52:30,981 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-17 03:52:30,982 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:52:31,008 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:52:31,009 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:52:31,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:52:31 BoogieIcfgContainer [2024-11-17 03:52:31,010 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:52:31,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:52:31,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:52:31,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:52:31,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:52:29" (1/3) ... [2024-11-17 03:52:31,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa1b4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:52:31, skipping insertion in model container [2024-11-17 03:52:31,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:30" (2/3) ... [2024-11-17 03:52:31,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa1b4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:52:31, skipping insertion in model container [2024-11-17 03:52:31,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:52:31" (3/3) ... [2024-11-17 03:52:31,021 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2.c.cil.c [2024-11-17 03:52:31,037 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:52:31,038 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-17 03:52:31,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:52:31,119 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;@3ef3fba2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:52:31,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-17 03:52:31,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 77 states have (on average 1.5324675324675325) internal successors, (118), 99 states have internal predecessors, (118), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-17 03:52:31,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 03:52:31,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:31,134 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:31,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-17 03:52:31,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:31,140 INFO L85 PathProgramCache]: Analyzing trace with hash 137830155, now seen corresponding path program 1 times [2024-11-17 03:52:31,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:52:31,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543077931] [2024-11-17 03:52:31,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:31,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:52:31,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:52:31,160 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:52:31,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 03:52:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:31,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 03:52:31,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:52:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:52:31,277 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:52:31,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:52:31,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543077931] [2024-11-17 03:52:31,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543077931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:31,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:31,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:52:31,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933367693] [2024-11-17 03:52:31,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:31,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 03:52:31,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:52:31,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 03:52:31,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 03:52:31,306 INFO L87 Difference]: Start difference. First operand has 111 states, 77 states have (on average 1.5324675324675325) internal successors, (118), 99 states have internal predecessors, (118), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:31,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:31,339 INFO L93 Difference]: Finished difference Result 209 states and 271 transitions. [2024-11-17 03:52:31,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 03:52:31,342 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 03:52:31,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:31,351 INFO L225 Difference]: With dead ends: 209 [2024-11-17 03:52:31,351 INFO L226 Difference]: Without dead ends: 91 [2024-11-17 03:52:31,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 03:52:31,365 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:31,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:52:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-17 03:52:31,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-17 03:52:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 81 states have internal predecessors, (92), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 03:52:31,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2024-11-17 03:52:31,418 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 10 [2024-11-17 03:52:31,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:31,418 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2024-11-17 03:52:31,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:31,419 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2024-11-17 03:52:31,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 03:52:31,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:31,420 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:31,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-17 03:52:31,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:52:31,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-17 03:52:31,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:31,622 INFO L85 PathProgramCache]: Analyzing trace with hash -67561476, now seen corresponding path program 1 times [2024-11-17 03:52:31,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:52:31,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118809378] [2024-11-17 03:52:31,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:31,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:52:31,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:52:31,627 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:52:31,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 03:52:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:31,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:52:31,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:52:31,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:52:31,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:52:31,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:52:31,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118809378] [2024-11-17 03:52:31,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118809378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:31,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:31,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:52:31,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133172627] [2024-11-17 03:52:31,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:31,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:52:31,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:52:31,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:52:31,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:52:31,712 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:31,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:31,797 INFO L93 Difference]: Finished difference Result 184 states and 212 transitions. [2024-11-17 03:52:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:52:31,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 03:52:31,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:31,799 INFO L225 Difference]: With dead ends: 184 [2024-11-17 03:52:31,799 INFO L226 Difference]: Without dead ends: 96 [2024-11-17 03:52:31,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:52:31,802 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 4 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 293 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-11-17 03:52:31,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 293 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:52:31,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-17 03:52:31,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-17 03:52:31,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 85 states have internal predecessors, (96), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 03:52:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2024-11-17 03:52:31,815 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 11 [2024-11-17 03:52:31,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:31,815 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2024-11-17 03:52:31,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:31,815 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2024-11-17 03:52:31,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 03:52:31,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:31,816 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:31,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-17 03:52:32,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:52:32,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-17 03:52:32,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:32,018 INFO L85 PathProgramCache]: Analyzing trace with hash -152623519, now seen corresponding path program 1 times [2024-11-17 03:52:32,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:52:32,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251030224] [2024-11-17 03:52:32,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:32,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:52:32,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:52:32,021 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:52:32,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 03:52:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:32,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:52:32,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:52:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 03:52:32,066 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:52:32,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:52:32,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251030224] [2024-11-17 03:52:32,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251030224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:32,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:32,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:52:32,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803566912] [2024-11-17 03:52:32,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:32,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:52:32,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:52:32,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:52:32,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:52:32,069 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:52:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:32,137 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2024-11-17 03:52:32,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:52:32,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-17 03:52:32,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:32,139 INFO L225 Difference]: With dead ends: 96 [2024-11-17 03:52:32,140 INFO L226 Difference]: Without dead ends: 95 [2024-11-17 03:52:32,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:52:32,141 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 2 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:32,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 183 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:32,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-17 03:52:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-17 03:52:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 84 states have internal predecessors, (95), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 03:52:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2024-11-17 03:52:32,154 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 18 [2024-11-17 03:52:32,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:32,157 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2024-11-17 03:52:32,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:52:32,157 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2024-11-17 03:52:32,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 03:52:32,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:32,158 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:32,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-17 03:52:32,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:52:32,360 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-17 03:52:32,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:32,360 INFO L85 PathProgramCache]: Analyzing trace with hash -488920463, now seen corresponding path program 1 times [2024-11-17 03:52:32,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:52:32,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114520543] [2024-11-17 03:52:32,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:32,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:52:32,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:52:32,365 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:52:32,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 03:52:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:32,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:52:32,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:52:32,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 03:52:32,410 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:52:32,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:52:32,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114520543] [2024-11-17 03:52:32,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114520543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:32,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:32,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:52:32,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240447] [2024-11-17 03:52:32,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:32,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:52:32,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:52:32,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:52:32,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:52:32,412 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:52:32,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:32,455 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2024-11-17 03:52:32,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:52:32,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-17 03:52:32,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:32,457 INFO L225 Difference]: With dead ends: 95 [2024-11-17 03:52:32,457 INFO L226 Difference]: Without dead ends: 94 [2024-11-17 03:52:32,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:52:32,459 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 182 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-11-17 03:52:32,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 182 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:52:32,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-17 03:52:32,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-17 03:52:32,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 83 states have internal predecessors, (94), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 03:52:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2024-11-17 03:52:32,473 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 20 [2024-11-17 03:52:32,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:32,474 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2024-11-17 03:52:32,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:52:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2024-11-17 03:52:32,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 03:52:32,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:32,475 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:32,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-17 03:52:32,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:52:32,676 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-17 03:52:32,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:32,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2023998178, now seen corresponding path program 1 times [2024-11-17 03:52:32,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:52:32,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270555817] [2024-11-17 03:52:32,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:32,677 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:52:32,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:52:32,679 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:52:32,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 03:52:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:32,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:52:32,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:52:32,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:52:32,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:52:32,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:52:32,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270555817] [2024-11-17 03:52:32,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270555817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:32,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:32,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:52:32,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673329812] [2024-11-17 03:52:32,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:32,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:52:32,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:52:32,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:52:32,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:52:32,833 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:52:33,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:33,213 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2024-11-17 03:52:33,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:52:33,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-17 03:52:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:33,219 INFO L225 Difference]: With dead ends: 123 [2024-11-17 03:52:33,222 INFO L226 Difference]: Without dead ends: 120 [2024-11-17 03:52:33,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:52:33,223 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 87 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:33,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 214 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 03:52:33,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-17 03:52:33,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 104. [2024-11-17 03:52:33,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 93 states have internal predecessors, (105), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 03:52:33,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2024-11-17 03:52:33,244 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 21 [2024-11-17 03:52:33,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:33,245 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2024-11-17 03:52:33,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 03:52:33,245 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2024-11-17 03:52:33,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 03:52:33,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:33,246 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:33,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-17 03:52:33,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:52:33,450 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-17 03:52:33,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:33,451 INFO L85 PathProgramCache]: Analyzing trace with hash -116171644, now seen corresponding path program 1 times [2024-11-17 03:52:33,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:52:33,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109681988] [2024-11-17 03:52:33,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:33,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:52:33,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:52:33,453 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:52:33,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-17 03:52:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:52:33,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:52:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:52:33,521 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 03:52:33,522 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:52:33,523 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-11-17 03:52:33,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-11-17 03:52:33,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-11-17 03:52:33,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-11-17 03:52:33,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-11-17 03:52:33,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-11-17 03:52:33,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-11-17 03:52:33,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-11-17 03:52:33,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-11-17 03:52:33,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-11-17 03:52:33,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-11-17 03:52:33,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-11-17 03:52:33,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-11-17 03:52:33,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-11-17 03:52:33,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-11-17 03:52:33,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-11-17 03:52:33,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-11-17 03:52:33,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-11-17 03:52:33,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-11-17 03:52:33,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-11-17 03:52:33,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-11-17 03:52:33,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-11-17 03:52:33,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-17 03:52:33,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:52:33,733 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-17 03:52:33,761 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:52:33,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:52:33 BoogieIcfgContainer [2024-11-17 03:52:33,765 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:52:33,765 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:52:33,766 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:52:33,766 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:52:33,766 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:52:31" (3/4) ... [2024-11-17 03:52:33,767 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-17 03:52:33,809 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 03:52:33,812 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:52:33,812 INFO L158 Benchmark]: Toolchain (without parser) took 3983.93ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 32.3MB in the beginning and 28.0MB in the end (delta: 4.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-17 03:52:33,813 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 44.0MB. Free memory was 27.1MB in the beginning and 27.1MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:52:33,813 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.52ms. Allocated memory is still 60.8MB. Free memory was 32.0MB in the beginning and 32.2MB in the end (delta: -143.8kB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-11-17 03:52:33,813 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.81ms. Allocated memory is still 60.8MB. Free memory was 32.2MB in the beginning and 30.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:52:33,814 INFO L158 Benchmark]: Boogie Preprocessor took 64.02ms. Allocated memory is still 60.8MB. Free memory was 30.4MB in the beginning and 28.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:52:33,814 INFO L158 Benchmark]: IcfgBuilder took 622.93ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 28.0MB in the beginning and 37.9MB in the end (delta: -9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-17 03:52:33,814 INFO L158 Benchmark]: TraceAbstraction took 2752.08ms. Allocated memory is still 73.4MB. Free memory was 37.2MB in the beginning and 30.1MB in the end (delta: 7.2MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2024-11-17 03:52:33,815 INFO L158 Benchmark]: Witness Printer took 46.37ms. Allocated memory is still 73.4MB. Free memory was 30.1MB in the beginning and 28.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:52:33,816 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.23ms. Allocated memory is still 44.0MB. Free memory was 27.1MB in the beginning and 27.1MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.52ms. Allocated memory is still 60.8MB. Free memory was 32.0MB in the beginning and 32.2MB in the end (delta: -143.8kB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.81ms. Allocated memory is still 60.8MB. Free memory was 32.2MB in the beginning and 30.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.02ms. Allocated memory is still 60.8MB. Free memory was 30.4MB in the beginning and 28.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 622.93ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 28.0MB in the beginning and 37.9MB in the end (delta: -9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2752.08ms. Allocated memory is still 73.4MB. Free memory was 37.2MB in the beginning and 30.1MB in the end (delta: 7.2MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. * Witness Printer took 46.37ms. Allocated memory is still 73.4MB. Free memory was 30.1MB in the beginning and 28.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 81]: integer overflow possible integer overflow possible We found a FailurePath: [L230] unsigned int a ; [L231] unsigned int ma = __VERIFIER_nondet_uint(); [L232] signed char ea = __VERIFIER_nondet_char(); [L233] unsigned int b ; [L234] unsigned int mb = __VERIFIER_nondet_uint(); [L235] signed char eb = __VERIFIER_nondet_char(); [L236] unsigned int r_add1 ; [L237] unsigned int r_add2 ; [L238] unsigned int zero ; [L239] int tmp ; [L240] int tmp___0 ; [L241] int __retres14 ; [L245] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L33] COND TRUE ! m [L34] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L84] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L245] RET, EXPR base2flt(0, 0) [L245] zero = base2flt(0, 0) [L246] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L33] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L39] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L61] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L63] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L80] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L81] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L81] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, m=0] - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 111 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 990 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 487 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 503 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 11 QuantifiedInterpolants, 132 SizeOfPredicates, 2 NumberOfNonLiveVariables, 170 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-17 03:52:33,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)