./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 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:04:23,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:04:23,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:04:23,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:04:23,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:04:23,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:04:23,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:04:23,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:04:23,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:04:23,821 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:04:23,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:04:23,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:04:23,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:04:23,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:04:23,822 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:04:23,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:04:23,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:04:23,822 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:04:23,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:04:23,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:04:23,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:04:23,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:04:23,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:04:23,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:04:23,826 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:04:23,826 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:04:23,826 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:04:23,826 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:04:23,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:04:23,827 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:04:23,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:04:23,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:04:23,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:04:23,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:04:23,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:04:23,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:04:23,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:04:23,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:04:23,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:04:23,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:04:23,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:04:23,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:04:23,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:04:23,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:04:23,829 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-19 10:04:24,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:04:24,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:04:24,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:04:24,095 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:04:24,095 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:04:24,096 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-19 10:04:25,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:04:25,858 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:04:25,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c [2024-11-19 10:04:25,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cb5c8970/df77be28aa0645d6b2601b95fd63685b/FLAG52293f108 [2024-11-19 10:04:25,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cb5c8970/df77be28aa0645d6b2601b95fd63685b [2024-11-19 10:04:25,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:04:25,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:04:25,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:04:25,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:04:25,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:04:25,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:04:25" (1/1) ... [2024-11-19 10:04:25,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31158b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:25, skipping insertion in model container [2024-11-19 10:04:25,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:04:25" (1/1) ... [2024-11-19 10:04:25,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:04:26,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:04:26,138 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:04:26,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:04:26,183 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:04:26,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:26 WrapperNode [2024-11-19 10:04:26,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:04:26,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:04:26,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:04:26,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:04:26,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:26" (1/1) ... [2024-11-19 10:04:26,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:26" (1/1) ... [2024-11-19 10:04:26,220 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 162 [2024-11-19 10:04:26,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:04:26,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:04:26,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:04:26,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:04:26,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:26" (1/1) ... [2024-11-19 10:04:26,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:26" (1/1) ... [2024-11-19 10:04:26,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:26" (1/1) ... [2024-11-19 10:04:26,252 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-19 10:04:26,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:26" (1/1) ... [2024-11-19 10:04:26,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:26" (1/1) ... [2024-11-19 10:04:26,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:26" (1/1) ... [2024-11-19 10:04:26,268 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:26" (1/1) ... [2024-11-19 10:04:26,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:26" (1/1) ... [2024-11-19 10:04:26,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:26" (1/1) ... [2024-11-19 10:04:26,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:04:26,277 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:04:26,277 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:04:26,277 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:04:26,278 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:26" (1/1) ... [2024-11-19 10:04:26,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:04:26,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:26,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 10:04:26,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 10:04:26,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:04:26,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:04:26,356 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-19 10:04:26,356 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-19 10:04:26,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:04:26,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:04:26,356 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-19 10:04:26,356 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-19 10:04:26,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 10:04:26,358 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 10:04:26,426 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:04:26,428 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:04:26,751 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2024-11-19 10:04:26,751 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:04:26,771 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:04:26,771 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 10:04:26,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:26 BoogieIcfgContainer [2024-11-19 10:04:26,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:04:26,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:04:26,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:04:26,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:04:26,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:04:25" (1/3) ... [2024-11-19 10:04:26,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42bea677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:04:26, skipping insertion in model container [2024-11-19 10:04:26,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:26" (2/3) ... [2024-11-19 10:04:26,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42bea677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:04:26, skipping insertion in model container [2024-11-19 10:04:26,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:26" (3/3) ... [2024-11-19 10:04:26,803 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2.c.cil.c [2024-11-19 10:04:26,832 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:04:26,836 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-19 10:04:26,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:04:26,921 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;@61a5af01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:04:26,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-19 10:04:26,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 88 states have (on average 1.6136363636363635) internal successors, (142), 110 states have internal predecessors, (142), 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-19 10:04:26,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:04:26,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:26,932 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:26,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-19 10:04:26,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:26,936 INFO L85 PathProgramCache]: Analyzing trace with hash -12953697, now seen corresponding path program 1 times [2024-11-19 10:04:26,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:26,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975304847] [2024-11-19 10:04:26,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:26,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:27,130 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-19 10:04:27,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:27,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975304847] [2024-11-19 10:04:27,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975304847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:27,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:27,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:27,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447790594] [2024-11-19 10:04:27,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:27,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:04:27,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:27,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:04:27,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:04:27,154 INFO L87 Difference]: Start difference. First operand has 122 states, 88 states have (on average 1.6136363636363635) internal successors, (142), 110 states have internal predecessors, (142), 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 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-19 10:04:27,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:27,257 INFO L93 Difference]: Finished difference Result 295 states and 409 transitions. [2024-11-19 10:04:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:04:27,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2024-11-19 10:04:27,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:27,266 INFO L225 Difference]: With dead ends: 295 [2024-11-19 10:04:27,266 INFO L226 Difference]: Without dead ends: 166 [2024-11-19 10:04:27,270 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-19 10:04:27,272 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 90 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:27,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 390 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-19 10:04:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2024-11-19 10:04:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 125 states have (on average 1.496) internal successors, (187), 143 states have internal predecessors, (187), 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-19 10:04:27,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 200 transitions. [2024-11-19 10:04:27,308 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 200 transitions. Word has length 9 [2024-11-19 10:04:27,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:27,308 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 200 transitions. [2024-11-19 10:04:27,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-19 10:04:27,309 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 200 transitions. [2024-11-19 10:04:27,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 10:04:27,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:27,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:27,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:04:27,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-19 10:04:27,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:27,311 INFO L85 PathProgramCache]: Analyzing trace with hash -46694463, now seen corresponding path program 1 times [2024-11-19 10:04:27,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:27,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574484209] [2024-11-19 10:04:27,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:27,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:27,353 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-19 10:04:27,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:27,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574484209] [2024-11-19 10:04:27,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574484209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:27,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:27,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:27,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881039036] [2024-11-19 10:04:27,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:27,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:27,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:27,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:27,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:27,356 INFO L87 Difference]: Start difference. First operand 154 states and 200 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-19 10:04:27,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:27,399 INFO L93 Difference]: Finished difference Result 291 states and 376 transitions. [2024-11-19 10:04:27,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:27,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 14 [2024-11-19 10:04:27,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:27,401 INFO L225 Difference]: With dead ends: 291 [2024-11-19 10:04:27,401 INFO L226 Difference]: Without dead ends: 168 [2024-11-19 10:04:27,402 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-19 10:04:27,403 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:27,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 239 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-19 10:04:27,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 158. [2024-11-19 10:04:27,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 129 states have (on average 1.4806201550387597) internal successors, (191), 147 states have internal predecessors, (191), 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-19 10:04:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 204 transitions. [2024-11-19 10:04:27,419 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 204 transitions. Word has length 14 [2024-11-19 10:04:27,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:27,419 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 204 transitions. [2024-11-19 10:04:27,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-19 10:04:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 204 transitions. [2024-11-19 10:04:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 10:04:27,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:27,420 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:27,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:04:27,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-19 10:04:27,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:27,421 INFO L85 PathProgramCache]: Analyzing trace with hash -46805809, now seen corresponding path program 1 times [2024-11-19 10:04:27,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:27,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131153930] [2024-11-19 10:04:27,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:27,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 10:04:27,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:27,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131153930] [2024-11-19 10:04:27,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131153930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:27,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:27,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:04:27,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816091589] [2024-11-19 10:04:27,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:27,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:27,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:27,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:27,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:27,457 INFO L87 Difference]: Start difference. First operand 158 states and 204 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-19 10:04:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:27,488 INFO L93 Difference]: Finished difference Result 158 states and 204 transitions. [2024-11-19 10:04:27,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:27,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-11-19 10:04:27,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:27,490 INFO L225 Difference]: With dead ends: 158 [2024-11-19 10:04:27,490 INFO L226 Difference]: Without dead ends: 157 [2024-11-19 10:04:27,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-19 10:04:27,491 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:27,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 232 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:27,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-19 10:04:27,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-11-19 10:04:27,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 129 states have (on average 1.4651162790697674) internal successors, (189), 146 states have internal predecessors, (189), 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-19 10:04:27,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 202 transitions. [2024-11-19 10:04:27,500 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 202 transitions. Word has length 14 [2024-11-19 10:04:27,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:27,501 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 202 transitions. [2024-11-19 10:04:27,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-19 10:04:27,501 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 202 transitions. [2024-11-19 10:04:27,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 10:04:27,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:27,502 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:27,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:04:27,502 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-19 10:04:27,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:27,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1228715341, now seen corresponding path program 1 times [2024-11-19 10:04:27,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:27,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761040943] [2024-11-19 10:04:27,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:27,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:04:27,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:27,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761040943] [2024-11-19 10:04:27,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761040943] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:27,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275084385] [2024-11-19 10:04:27,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:27,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:27,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:27,568 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:04:27,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 10:04:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:27,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:04:27,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:27,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:04:27,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:04:27,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275084385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:27,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:04:27,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-19 10:04:27,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592077049] [2024-11-19 10:04:27,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:27,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:04:27,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:27,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:04:27,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:04:27,650 INFO L87 Difference]: Start difference. First operand 157 states and 202 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-19 10:04:27,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:27,697 INFO L93 Difference]: Finished difference Result 183 states and 242 transitions. [2024-11-19 10:04:27,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:04:27,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 15 [2024-11-19 10:04:27,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:27,699 INFO L225 Difference]: With dead ends: 183 [2024-11-19 10:04:27,699 INFO L226 Difference]: Without dead ends: 181 [2024-11-19 10:04:27,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:04:27,700 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 32 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:27,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 236 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:27,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-19 10:04:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 164. [2024-11-19 10:04:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 136 states have (on average 1.4411764705882353) internal successors, (196), 153 states have internal predecessors, (196), 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-19 10:04:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 209 transitions. [2024-11-19 10:04:27,708 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 209 transitions. Word has length 15 [2024-11-19 10:04:27,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:27,708 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 209 transitions. [2024-11-19 10:04:27,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-19 10:04:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 209 transitions. [2024-11-19 10:04:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 10:04:27,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:27,709 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:27,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 10:04:27,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:27,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-19 10:04:27,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:27,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1450980022, now seen corresponding path program 1 times [2024-11-19 10:04:27,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:27,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216004481] [2024-11-19 10:04:27,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:27,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:04:27,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:27,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216004481] [2024-11-19 10:04:27,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216004481] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:27,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890041696] [2024-11-19 10:04:27,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:27,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:27,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:27,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:04:27,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 10:04:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:28,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:04:28,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:04:28,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:04:28,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890041696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:28,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:04:28,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-19 10:04:28,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76964490] [2024-11-19 10:04:28,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:28,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:28,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:28,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:28,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:04:28,033 INFO L87 Difference]: Start difference. First operand 164 states and 209 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, (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-19 10:04:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:28,072 INFO L93 Difference]: Finished difference Result 170 states and 217 transitions. [2024-11-19 10:04:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:28,073 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, (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 15 [2024-11-19 10:04:28,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:28,074 INFO L225 Difference]: With dead ends: 170 [2024-11-19 10:04:28,075 INFO L226 Difference]: Without dead ends: 169 [2024-11-19 10:04:28,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-19 10:04:28,077 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 17 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:28,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 223 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-19 10:04:28,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2024-11-19 10:04:28,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 138 states have (on average 1.434782608695652) internal successors, (198), 155 states have internal predecessors, (198), 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-19 10:04:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 211 transitions. [2024-11-19 10:04:28,092 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 211 transitions. Word has length 15 [2024-11-19 10:04:28,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:28,093 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 211 transitions. [2024-11-19 10:04:28,093 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, (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-19 10:04:28,093 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 211 transitions. [2024-11-19 10:04:28,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 10:04:28,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:28,094 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:28,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 10:04:28,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:28,295 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-19 10:04:28,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:28,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1586966879, now seen corresponding path program 1 times [2024-11-19 10:04:28,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:28,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335596603] [2024-11-19 10:04:28,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:28,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:28,376 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-19 10:04:28,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:28,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335596603] [2024-11-19 10:04:28,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335596603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:28,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:28,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:04:28,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133601935] [2024-11-19 10:04:28,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:28,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:04:28,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:28,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:04:28,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:04:28,379 INFO L87 Difference]: Start difference. First operand 166 states and 211 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-19 10:04:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:28,492 INFO L93 Difference]: Finished difference Result 235 states and 299 transitions. [2024-11-19 10:04:28,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:04:28,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 17 [2024-11-19 10:04:28,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:28,494 INFO L225 Difference]: With dead ends: 235 [2024-11-19 10:04:28,494 INFO L226 Difference]: Without dead ends: 231 [2024-11-19 10:04:28,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-19 10:04:28,495 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 85 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:28,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 422 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-19 10:04:28,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 214. [2024-11-19 10:04:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 186 states have (on average 1.424731182795699) internal successors, (265), 202 states have internal predecessors, (265), 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-19 10:04:28,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 278 transitions. [2024-11-19 10:04:28,537 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 278 transitions. Word has length 17 [2024-11-19 10:04:28,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:28,537 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 278 transitions. [2024-11-19 10:04:28,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-19 10:04:28,537 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 278 transitions. [2024-11-19 10:04:28,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 10:04:28,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:28,538 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:28,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 10:04:28,538 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-19 10:04:28,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:28,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1558339523, now seen corresponding path program 1 times [2024-11-19 10:04:28,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:28,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952255354] [2024-11-19 10:04:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:28,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:28,588 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-19 10:04:28,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:28,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952255354] [2024-11-19 10:04:28,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952255354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:28,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:28,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:04:28,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216489460] [2024-11-19 10:04:28,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:28,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:04:28,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:28,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:04:28,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:04:28,590 INFO L87 Difference]: Start difference. First operand 214 states and 278 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-19 10:04:28,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:28,671 INFO L93 Difference]: Finished difference Result 236 states and 300 transitions. [2024-11-19 10:04:28,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:04:28,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 17 [2024-11-19 10:04:28,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:28,672 INFO L225 Difference]: With dead ends: 236 [2024-11-19 10:04:28,673 INFO L226 Difference]: Without dead ends: 233 [2024-11-19 10:04:28,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-19 10:04:28,674 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 87 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:28,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 422 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:28,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-19 10:04:28,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 212. [2024-11-19 10:04:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 185 states have (on average 1.3945945945945946) internal successors, (258), 200 states have internal predecessors, (258), 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-19 10:04:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 271 transitions. [2024-11-19 10:04:28,686 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 271 transitions. Word has length 17 [2024-11-19 10:04:28,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:28,687 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 271 transitions. [2024-11-19 10:04:28,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-19 10:04:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 271 transitions. [2024-11-19 10:04:28,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 10:04:28,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:28,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:28,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 10:04:28,694 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-19 10:04:28,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:28,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1302492865, now seen corresponding path program 1 times [2024-11-19 10:04:28,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:28,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055805037] [2024-11-19 10:04:28,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:28,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:28,723 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-19 10:04:28,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:28,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055805037] [2024-11-19 10:04:28,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055805037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:28,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:28,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:28,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223234238] [2024-11-19 10:04:28,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:28,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:28,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:28,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:28,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:28,725 INFO L87 Difference]: Start difference. First operand 212 states and 271 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-19 10:04:28,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:28,763 INFO L93 Difference]: Finished difference Result 401 states and 510 transitions. [2024-11-19 10:04:28,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:28,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 16 [2024-11-19 10:04:28,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:28,765 INFO L225 Difference]: With dead ends: 401 [2024-11-19 10:04:28,765 INFO L226 Difference]: Without dead ends: 223 [2024-11-19 10:04:28,766 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-19 10:04:28,767 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:28,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 235 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:28,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-19 10:04:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 213. [2024-11-19 10:04:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 186 states have (on average 1.3655913978494623) internal successors, (254), 201 states have internal predecessors, (254), 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-19 10:04:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 267 transitions. [2024-11-19 10:04:28,781 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 267 transitions. Word has length 16 [2024-11-19 10:04:28,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:28,781 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 267 transitions. [2024-11-19 10:04:28,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-19 10:04:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 267 transitions. [2024-11-19 10:04:28,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 10:04:28,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:28,782 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:28,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 10:04:28,782 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-19 10:04:28,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:28,782 INFO L85 PathProgramCache]: Analyzing trace with hash -318397895, now seen corresponding path program 1 times [2024-11-19 10:04:28,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:28,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272174321] [2024-11-19 10:04:28,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:28,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:04:28,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:28,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272174321] [2024-11-19 10:04:28,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272174321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:28,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871740813] [2024-11-19 10:04:28,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:28,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:28,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:28,835 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:04:28,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 10:04:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:28,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:04:28,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:28,896 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-19 10:04:28,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:04:28,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871740813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:28,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:04:28,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-19 10:04:28,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359234586] [2024-11-19 10:04:28,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:28,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:04:28,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:28,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:04:28,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:04:28,899 INFO L87 Difference]: Start difference. First operand 213 states and 267 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-19 10:04:28,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:28,944 INFO L93 Difference]: Finished difference Result 227 states and 286 transitions. [2024-11-19 10:04:28,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:04:28,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 17 [2024-11-19 10:04:28,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:28,946 INFO L225 Difference]: With dead ends: 227 [2024-11-19 10:04:28,946 INFO L226 Difference]: Without dead ends: 226 [2024-11-19 10:04:28,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:04:28,946 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 9 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:28,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 341 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:28,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-19 10:04:28,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 212. [2024-11-19 10:04:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 185 states have (on average 1.3567567567567567) internal successors, (251), 200 states have internal predecessors, (251), 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-19 10:04:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 264 transitions. [2024-11-19 10:04:28,955 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 264 transitions. Word has length 17 [2024-11-19 10:04:28,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:28,956 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 264 transitions. [2024-11-19 10:04:28,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-19 10:04:28,957 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 264 transitions. [2024-11-19 10:04:28,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 10:04:28,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:28,957 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:28,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 10:04:29,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:29,159 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-19 10:04:29,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:29,159 INFO L85 PathProgramCache]: Analyzing trace with hash -71126634, now seen corresponding path program 1 times [2024-11-19 10:04:29,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:29,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114677030] [2024-11-19 10:04:29,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:29,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:29,194 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-19 10:04:29,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:29,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114677030] [2024-11-19 10:04:29,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114677030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:29,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:29,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:04:29,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221601897] [2024-11-19 10:04:29,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:29,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:04:29,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:29,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:04:29,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:04:29,197 INFO L87 Difference]: Start difference. First operand 212 states and 264 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-19 10:04:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:29,231 INFO L93 Difference]: Finished difference Result 374 states and 465 transitions. [2024-11-19 10:04:29,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:04:29,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 17 [2024-11-19 10:04:29,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:29,233 INFO L225 Difference]: With dead ends: 374 [2024-11-19 10:04:29,233 INFO L226 Difference]: Without dead ends: 167 [2024-11-19 10:04:29,233 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-19 10:04:29,234 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 4 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:29,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 357 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:29,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-19 10:04:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-19 10:04:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 140 states have (on average 1.3785714285714286) internal successors, (193), 155 states have internal predecessors, (193), 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-19 10:04:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 206 transitions. [2024-11-19 10:04:29,239 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 206 transitions. Word has length 17 [2024-11-19 10:04:29,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:29,239 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 206 transitions. [2024-11-19 10:04:29,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-19 10:04:29,240 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 206 transitions. [2024-11-19 10:04:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 10:04:29,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:29,240 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:29,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 10:04:29,241 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-19 10:04:29,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:29,241 INFO L85 PathProgramCache]: Analyzing trace with hash 300413940, now seen corresponding path program 1 times [2024-11-19 10:04:29,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:29,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379545519] [2024-11-19 10:04:29,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:29,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:29,269 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-19 10:04:29,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:29,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379545519] [2024-11-19 10:04:29,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379545519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:29,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:29,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:04:29,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207615557] [2024-11-19 10:04:29,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:29,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:04:29,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:29,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:04:29,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:04:29,272 INFO L87 Difference]: Start difference. First operand 167 states and 206 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-19 10:04:29,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:29,349 INFO L93 Difference]: Finished difference Result 175 states and 213 transitions. [2024-11-19 10:04:29,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:04:29,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 24 [2024-11-19 10:04:29,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:29,351 INFO L225 Difference]: With dead ends: 175 [2024-11-19 10:04:29,351 INFO L226 Difference]: Without dead ends: 172 [2024-11-19 10:04:29,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-19 10:04:29,352 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 76 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:29,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 473 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:29,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-19 10:04:29,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2024-11-19 10:04:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 140 states have (on average 1.3642857142857143) internal successors, (191), 153 states have internal predecessors, (191), 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-19 10:04:29,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 204 transitions. [2024-11-19 10:04:29,357 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 204 transitions. Word has length 24 [2024-11-19 10:04:29,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:29,358 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 204 transitions. [2024-11-19 10:04:29,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-19 10:04:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 204 transitions. [2024-11-19 10:04:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 10:04:29,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:29,359 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:29,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 10:04:29,359 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-19 10:04:29,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:29,359 INFO L85 PathProgramCache]: Analyzing trace with hash 271786584, now seen corresponding path program 1 times [2024-11-19 10:04:29,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:29,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033385624] [2024-11-19 10:04:29,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:29,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:29,387 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-19 10:04:29,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:29,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033385624] [2024-11-19 10:04:29,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033385624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:29,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:29,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:04:29,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804163221] [2024-11-19 10:04:29,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:29,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:04:29,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:29,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:04:29,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:04:29,389 INFO L87 Difference]: Start difference. First operand 165 states and 204 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-19 10:04:29,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:29,461 INFO L93 Difference]: Finished difference Result 174 states and 213 transitions. [2024-11-19 10:04:29,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:04:29,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 24 [2024-11-19 10:04:29,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:29,462 INFO L225 Difference]: With dead ends: 174 [2024-11-19 10:04:29,462 INFO L226 Difference]: Without dead ends: 172 [2024-11-19 10:04:29,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-19 10:04:29,463 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 80 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:29,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 480 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:29,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-19 10:04:29,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 154. [2024-11-19 10:04:29,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 131 states have (on average 1.3587786259541985) internal successors, (178), 142 states have internal predecessors, (178), 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-19 10:04:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 191 transitions. [2024-11-19 10:04:29,469 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 191 transitions. Word has length 24 [2024-11-19 10:04:29,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:29,469 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 191 transitions. [2024-11-19 10:04:29,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-19 10:04:29,469 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 191 transitions. [2024-11-19 10:04:29,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 10:04:29,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:29,470 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-19 10:04:29,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 10:04:29,470 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-19 10:04:29,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:29,470 INFO L85 PathProgramCache]: Analyzing trace with hash -835364307, now seen corresponding path program 1 times [2024-11-19 10:04:29,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:29,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340897048] [2024-11-19 10:04:29,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:29,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:04:29,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 10:04:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:04:29,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 10:04:29,496 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 10:04:29,496 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-11-19 10:04:29,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-11-19 10:04:29,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-11-19 10:04:29,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-11-19 10:04:29,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-11-19 10:04:29,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-11-19 10:04:29,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-11-19 10:04:29,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-11-19 10:04:29,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-11-19 10:04:29,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-11-19 10:04:29,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-11-19 10:04:29,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-11-19 10:04:29,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-11-19 10:04:29,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-11-19 10:04:29,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-11-19 10:04:29,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-11-19 10:04:29,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-11-19 10:04:29,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-11-19 10:04:29,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-11-19 10:04:29,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-11-19 10:04:29,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-11-19 10:04:29,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-11-19 10:04:29,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 10:04:29,506 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:29,521 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:04:29,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:04:29 BoogieIcfgContainer [2024-11-19 10:04:29,523 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:04:29,524 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:04:29,524 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:04:29,524 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:04:29,524 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:26" (3/4) ... [2024-11-19 10:04:29,526 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 10:04:29,527 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:04:29,527 INFO L158 Benchmark]: Toolchain (without parser) took 3639.10ms. Allocated memory is still 255.9MB. Free memory was 186.5MB in the beginning and 101.0MB in the end (delta: 85.5MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB. [2024-11-19 10:04:29,527 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 136.3MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:04:29,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.57ms. Allocated memory is still 255.9MB. Free memory was 186.2MB in the beginning and 169.9MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 10:04:29,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.42ms. Allocated memory is still 255.9MB. Free memory was 169.9MB in the beginning and 167.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:04:29,528 INFO L158 Benchmark]: Boogie Preprocessor took 54.75ms. Allocated memory is still 255.9MB. Free memory was 167.9MB in the beginning and 165.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:04:29,528 INFO L158 Benchmark]: RCFGBuilder took 495.07ms. Allocated memory is still 255.9MB. Free memory was 165.5MB in the beginning and 141.5MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 10:04:29,528 INFO L158 Benchmark]: TraceAbstraction took 2729.28ms. Allocated memory is still 255.9MB. Free memory was 224.5MB in the beginning and 102.0MB in the end (delta: 122.5MB). Peak memory consumption was 121.4MB. Max. memory is 16.1GB. [2024-11-19 10:04:29,529 INFO L158 Benchmark]: Witness Printer took 3.41ms. Allocated memory is still 255.9MB. Free memory was 102.0MB in the beginning and 101.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:04:29,530 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 136.3MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.57ms. Allocated memory is still 255.9MB. Free memory was 186.2MB in the beginning and 169.9MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.42ms. Allocated memory is still 255.9MB. Free memory was 169.9MB in the beginning and 167.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.75ms. Allocated memory is still 255.9MB. Free memory was 167.9MB in the beginning and 165.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 495.07ms. Allocated memory is still 255.9MB. Free memory was 165.5MB in the beginning and 141.5MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2729.28ms. Allocated memory is still 255.9MB. Free memory was 224.5MB in the beginning and 102.0MB in the end (delta: 122.5MB). Peak memory consumption was 121.4MB. Max. memory is 16.1GB. * Witness Printer took 3.41ms. Allocated memory is still 255.9MB. Free memory was 102.0MB in the beginning and 101.0MB 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: 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: 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: 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. - 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: 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: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 122 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 515 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 501 mSDsluCounter, 4050 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2556 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 683 IncrementalHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 1494 mSDtfsCounter, 683 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=6, InterpolantAutomatonStates: 52, 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, 12 MinimizatonAttempts, 129 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 156 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 35/45 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 10:04:29,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:04:31,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:04:31,673 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-11-19 10:04:31,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:04:31,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:04:31,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:04:31,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:04:31,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:04:31,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:04:31,710 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:04:31,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:04:31,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:04:31,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:04:31,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:04:31,713 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:04:31,713 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:04:31,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:04:31,714 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:04:31,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:04:31,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:04:31,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:04:31,715 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:04:31,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:04:31,718 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 10:04:31,718 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 10:04:31,718 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:04:31,718 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:04:31,719 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 10:04:31,719 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:04:31,719 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:04:31,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:04:31,719 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:04:31,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:04:31,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:04:31,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:04:31,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:04:31,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:04:31,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:04:31,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:04:31,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:04:31,721 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 10:04:31,722 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 10:04:31,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:04:31,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:04:31,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:04:31,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:04:31,723 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-19 10:04:31,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:04:32,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:04:32,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:04:32,023 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:04:32,025 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:04:32,026 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-19 10:04:33,418 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:04:33,661 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:04:33,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c [2024-11-19 10:04:33,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63cfec883/0763ebd009ee443f9b94dbb6af55229e/FLAG8a85bbf0f [2024-11-19 10:04:33,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63cfec883/0763ebd009ee443f9b94dbb6af55229e [2024-11-19 10:04:33,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:04:33,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:04:33,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:04:33,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:04:33,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:04:33,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:04:33" (1/1) ... [2024-11-19 10:04:33,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c0dc8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:33, skipping insertion in model container [2024-11-19 10:04:33,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:04:33" (1/1) ... [2024-11-19 10:04:33,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:04:33,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:04:33,971 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:04:34,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:04:34,031 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:04:34,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:34 WrapperNode [2024-11-19 10:04:34,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:04:34,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:04:34,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:04:34,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:04:34,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:34" (1/1) ... [2024-11-19 10:04:34,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:34" (1/1) ... [2024-11-19 10:04:34,074 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 121 [2024-11-19 10:04:34,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:04:34,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:04:34,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:04:34,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:04:34,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:34" (1/1) ... [2024-11-19 10:04:34,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:34" (1/1) ... [2024-11-19 10:04:34,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:34" (1/1) ... [2024-11-19 10:04:34,111 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-19 10:04:34,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:34" (1/1) ... [2024-11-19 10:04:34,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:34" (1/1) ... [2024-11-19 10:04:34,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:34" (1/1) ... [2024-11-19 10:04:34,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:34" (1/1) ... [2024-11-19 10:04:34,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:34" (1/1) ... [2024-11-19 10:04:34,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:34" (1/1) ... [2024-11-19 10:04:34,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:04:34,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:04:34,131 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:04:34,131 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:04:34,132 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:34" (1/1) ... [2024-11-19 10:04:34,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:04:34,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:34,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 10:04:34,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 10:04:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:04:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 10:04:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-19 10:04:34,219 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-19 10:04:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:04:34,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:04:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-19 10:04:34,219 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-19 10:04:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 10:04:34,220 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 10:04:34,278 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:04:34,280 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:04:34,536 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-19 10:04:34,537 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:04:34,551 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:04:34,551 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 10:04:34,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:34 BoogieIcfgContainer [2024-11-19 10:04:34,552 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:04:34,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:04:34,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:04:34,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:04:34,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:04:33" (1/3) ... [2024-11-19 10:04:34,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc0f045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:04:34, skipping insertion in model container [2024-11-19 10:04:34,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:34" (2/3) ... [2024-11-19 10:04:34,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc0f045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:04:34, skipping insertion in model container [2024-11-19 10:04:34,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:34" (3/3) ... [2024-11-19 10:04:34,559 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2.c.cil.c [2024-11-19 10:04:34,572 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:04:34,572 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-19 10:04:34,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:04:34,631 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;@7dbd5887, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:04:34,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-19 10:04:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 63 states have (on average 1.6507936507936507) internal successors, (104), 85 states have internal predecessors, (104), 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-19 10:04:34,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:04:34,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:34,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:34,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-19 10:04:34,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:34,649 INFO L85 PathProgramCache]: Analyzing trace with hash 68225597, now seen corresponding path program 1 times [2024-11-19 10:04:34,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 10:04:34,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058296603] [2024-11-19 10:04:34,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:34,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 10:04:34,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 10:04:34,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 10:04:34,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 10:04:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:34,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 10:04:34,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:34,750 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-19 10:04:34,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:04:34,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 10:04:34,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058296603] [2024-11-19 10:04:34,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058296603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:34,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:34,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 10:04:34,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551468430] [2024-11-19 10:04:34,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:34,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 10:04:34,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 10:04:34,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 10:04:34,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 10:04:34,774 INFO L87 Difference]: Start difference. First operand has 97 states, 63 states have (on average 1.6507936507936507) internal successors, (104), 85 states have internal predecessors, (104), 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, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 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-19 10:04:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:34,795 INFO L93 Difference]: Finished difference Result 181 states and 243 transitions. [2024-11-19 10:04:34,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 10:04:34,797 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2024-11-19 10:04:34,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:34,805 INFO L225 Difference]: With dead ends: 181 [2024-11-19 10:04:34,805 INFO L226 Difference]: Without dead ends: 77 [2024-11-19 10:04:34,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 10:04:34,813 INFO L432 NwaCegarLoop]: 104 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, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:34,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:34,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-19 10:04:34,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-19 10:04:34,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 67 states have internal predecessors, (78), 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-19 10:04:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2024-11-19 10:04:34,847 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 9 [2024-11-19 10:04:34,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:34,847 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2024-11-19 10:04:34,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 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-19 10:04:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2024-11-19 10:04:34,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:04:34,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:34,848 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:34,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 10:04:35,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 10:04:35,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-19 10:04:35,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:35,052 INFO L85 PathProgramCache]: Analyzing trace with hash 67284331, now seen corresponding path program 1 times [2024-11-19 10:04:35,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 10:04:35,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468742104] [2024-11-19 10:04:35,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:35,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 10:04:35,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 10:04:35,054 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 10:04:35,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 10:04:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:35,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:04:35,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:35,138 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-19 10:04:35,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:04:35,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 10:04:35,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468742104] [2024-11-19 10:04:35,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468742104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:35,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:35,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:04:35,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578281691] [2024-11-19 10:04:35,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:35,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:04:35,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 10:04:35,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:04:35,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:04:35,146 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-19 10:04:35,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:35,219 INFO L93 Difference]: Finished difference Result 156 states and 184 transitions. [2024-11-19 10:04:35,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:04:35,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2024-11-19 10:04:35,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:35,221 INFO L225 Difference]: With dead ends: 156 [2024-11-19 10:04:35,221 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 10:04:35,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-19 10:04:35,224 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 4 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 251 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-19 10:04:35,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 251 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:35,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 10:04:35,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-19 10:04:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 71 states have internal predecessors, (82), 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-19 10:04:35,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2024-11-19 10:04:35,239 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 9 [2024-11-19 10:04:35,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:35,240 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2024-11-19 10:04:35,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-19 10:04:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2024-11-19 10:04:35,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 10:04:35,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:35,241 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:35,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 10:04:35,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 10:04:35,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-19 10:04:35,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:35,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1241355163, now seen corresponding path program 1 times [2024-11-19 10:04:35,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 10:04:35,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476228457] [2024-11-19 10:04:35,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:35,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 10:04:35,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 10:04:35,447 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 10:04:35,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 10:04:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:35,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 10:04:35,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:35,520 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-19 10:04:35,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:04:35,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 10:04:35,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476228457] [2024-11-19 10:04:35,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476228457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:35,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:35,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:04:35,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357641643] [2024-11-19 10:04:35,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:35,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:35,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 10:04:35,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:35,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:35,523 INFO L87 Difference]: Start difference. First operand 82 states and 95 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-19 10:04:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:35,606 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2024-11-19 10:04:35,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:35,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 16 [2024-11-19 10:04:35,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:35,608 INFO L225 Difference]: With dead ends: 82 [2024-11-19 10:04:35,609 INFO L226 Difference]: Without dead ends: 81 [2024-11-19 10:04:35,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-19 10:04:35,613 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:35,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 159 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:35,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-19 10:04:35,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-19 10:04:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.396551724137931) internal successors, (81), 70 states have internal predecessors, (81), 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-19 10:04:35,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2024-11-19 10:04:35,629 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 16 [2024-11-19 10:04:35,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:35,630 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2024-11-19 10:04:35,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-19 10:04:35,630 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2024-11-19 10:04:35,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 10:04:35,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:35,631 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:35,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 10:04:35,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 10:04:35,832 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-19 10:04:35,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:35,833 INFO L85 PathProgramCache]: Analyzing trace with hash -171146749, now seen corresponding path program 1 times [2024-11-19 10:04:35,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 10:04:35,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552783166] [2024-11-19 10:04:35,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:35,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 10:04:35,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 10:04:35,839 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 10:04:35,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 10:04:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:35,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 10:04:35,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:35,881 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-19 10:04:35,881 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:04:35,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 10:04:35,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552783166] [2024-11-19 10:04:35,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552783166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:35,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:35,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:04:35,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995602530] [2024-11-19 10:04:35,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:35,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:35,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 10:04:35,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:35,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:35,883 INFO L87 Difference]: Start difference. First operand 81 states and 94 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-19 10:04:35,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:35,935 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2024-11-19 10:04:35,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:35,937 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-19 10:04:35,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:35,938 INFO L225 Difference]: With dead ends: 81 [2024-11-19 10:04:35,939 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 10:04:35,939 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-19 10:04:35,940 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:35,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:35,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 10:04:35,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-19 10:04:35,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 69 states have internal predecessors, (80), 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-19 10:04:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2024-11-19 10:04:35,947 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 18 [2024-11-19 10:04:35,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:35,947 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2024-11-19 10:04:35,947 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-19 10:04:35,947 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2024-11-19 10:04:35,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 10:04:35,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:35,948 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:35,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 10:04:36,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 10:04:36,150 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-19 10:04:36,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:36,150 INFO L85 PathProgramCache]: Analyzing trace with hash -171079223, now seen corresponding path program 1 times [2024-11-19 10:04:36,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 10:04:36,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201933843] [2024-11-19 10:04:36,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:36,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 10:04:36,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 10:04:36,154 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-19 10:04:36,155 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-19 10:04:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:36,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:04:36,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:36,260 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-19 10:04:36,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:04:36,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 10:04:36,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201933843] [2024-11-19 10:04:36,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201933843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:36,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:36,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:36,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800365052] [2024-11-19 10:04:36,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:36,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:04:36,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 10:04:36,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:04:36,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:04:36,266 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-19 10:04:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:36,494 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2024-11-19 10:04:36,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:04:36,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2024-11-19 10:04:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:36,496 INFO L225 Difference]: With dead ends: 101 [2024-11-19 10:04:36,496 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 10:04:36,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-19 10:04:36,497 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 65 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:36,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 187 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:04:36,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 10:04:36,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2024-11-19 10:04:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.353846153846154) internal successors, (88), 76 states have internal predecessors, (88), 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-19 10:04:36,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2024-11-19 10:04:36,506 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 18 [2024-11-19 10:04:36,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:36,506 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2024-11-19 10:04:36,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-19 10:04:36,507 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2024-11-19 10:04:36,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 10:04:36,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:36,508 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-19 10:04:36,510 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-19 10:04:36,710 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-19 10:04:36,711 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-19 10:04:36,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:36,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1505150304, now seen corresponding path program 1 times [2024-11-19 10:04:36,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 10:04:36,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865040630] [2024-11-19 10:04:36,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:36,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 10:04:36,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 10:04:36,715 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-19 10:04:36,716 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-19 10:04:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:04:36,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 10:04:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:04:36,832 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 10:04:36,836 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 10:04:36,837 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-11-19 10:04:36,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-11-19 10:04:36,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-11-19 10:04:36,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-11-19 10:04:36,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-11-19 10:04:36,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-11-19 10:04:36,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-11-19 10:04:36,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-11-19 10:04:36,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-11-19 10:04:36,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-11-19 10:04:36,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-11-19 10:04:36,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-11-19 10:04:36,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-11-19 10:04:36,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-11-19 10:04:36,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-11-19 10:04:36,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-11-19 10:04:36,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-11-19 10:04:36,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-11-19 10:04:36,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-11-19 10:04:36,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-11-19 10:04:36,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-11-19 10:04:36,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-11-19 10:04:36,850 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 (7)] Ended with exit code 0 [2024-11-19 10:04:37,051 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-19 10:04:37,054 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-19 10:04:37,082 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:04:37,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:04:37 BoogieIcfgContainer [2024-11-19 10:04:37,092 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:04:37,093 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:04:37,093 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:04:37,093 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:04:37,093 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:34" (3/4) ... [2024-11-19 10:04:37,094 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 10:04:37,157 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:04:37,157 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:04:37,157 INFO L158 Benchmark]: Toolchain (without parser) took 3464.08ms. Allocated memory was 79.7MB in the beginning and 109.1MB in the end (delta: 29.4MB). Free memory was 56.4MB in the beginning and 78.5MB in the end (delta: -22.1MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2024-11-19 10:04:37,161 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 52.4MB. Free memory is still 24.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:04:37,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.54ms. Allocated memory is still 79.7MB. Free memory was 56.2MB in the beginning and 40.1MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 10:04:37,162 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.25ms. Allocated memory is still 79.7MB. Free memory was 40.1MB in the beginning and 38.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:04:37,162 INFO L158 Benchmark]: Boogie Preprocessor took 52.67ms. Allocated memory is still 79.7MB. Free memory was 38.3MB in the beginning and 36.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:04:37,162 INFO L158 Benchmark]: RCFGBuilder took 420.60ms. Allocated memory is still 79.7MB. Free memory was 35.7MB in the beginning and 41.1MB in the end (delta: -5.4MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-11-19 10:04:37,162 INFO L158 Benchmark]: TraceAbstraction took 2539.15ms. Allocated memory was 79.7MB in the beginning and 109.1MB in the end (delta: 29.4MB). Free memory was 40.4MB in the beginning and 81.6MB in the end (delta: -41.2MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-11-19 10:04:37,162 INFO L158 Benchmark]: Witness Printer took 64.24ms. Allocated memory is still 109.1MB. Free memory was 80.6MB in the beginning and 78.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:04:37,163 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.19ms. Allocated memory is still 52.4MB. Free memory is still 24.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.54ms. Allocated memory is still 79.7MB. Free memory was 56.2MB in the beginning and 40.1MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.25ms. Allocated memory is still 79.7MB. Free memory was 40.1MB in the beginning and 38.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.67ms. Allocated memory is still 79.7MB. Free memory was 38.3MB in the beginning and 36.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 420.60ms. Allocated memory is still 79.7MB. Free memory was 35.7MB in the beginning and 41.1MB in the end (delta: -5.4MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2539.15ms. Allocated memory was 79.7MB in the beginning and 109.1MB in the end (delta: 29.4MB). Free memory was 40.4MB in the beginning and 81.6MB in the end (delta: -41.2MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Witness Printer took 64.24ms. Allocated memory is still 109.1MB. Free memory was 80.6MB in the beginning and 78.5MB 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: 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: 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: 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. - 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: 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: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 859 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 421 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 438 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred 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, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 65 ConstructedInterpolants, 8 QuantifiedInterpolants, 110 SizeOfPredicates, 2 NumberOfNonLiveVariables, 160 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-19 10:04:37,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)